Numerical block diagonalization of matrix *-algebras with application to semidefinite programming
✍ Scribed by Etienne de Klerk; Cristian Dobre; Dmitrii V. Ṗasechnik
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 340 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We introduce a new method of constructing approximation algorithms for combinatorial optimization problems using semidefinite programming. It consists of expressing each combinatorial object in the original problem as a constellation of vectors in the semidefinite program. When we apply this techniq
method for computing a complete set of block eigenvalues for a block partitioned matrix using a generalized form of Wielandt's deflation is presented. An application of this process is given to compute a complete set of solvents of matrix polynomials where the coefficients and the variable are commu