Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
Publications associées (31)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Parity-Time (PT) symmetry refers to the invariance of a physical system upon reflection of space and time. An intriguing property of PT-symmetric quantum systems is the fact that they can have entirely real eigenvalue spectra, despite being non-Hermitian. ...
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional rela ...
This thesis is concerned with the algebraic theory of hermitian forms. It is organized in two parts. The first, consisting of the first two chapters, deals with some descent properties of unimodular hermitian forms over central simple algebras with involut ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of th ...
This article is concerned with the efficient numerical solution of the Lyapunov equation A(T) X + XA = -C with a stable matrix A and a symmetric positive semidefinite matrix C of possibly small rank. We discuss the efficient implementation of Hammarling's ...
Consider the problem of signal detection via multiple distributed noisy sensors. We study a linear decision fusion rule of [Z. Quan, S. Cui, and A. H. Sayed, ¿Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks,¿ IEEE J. Sel. Topics ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
Unconstrained zero-one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known spectral decomposition. ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate func- tions based on random sampling according to a given probability measure. Recent work has shown th ...