Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials

This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of Hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allows us to use semidefinite programming. Throughout the paper several examples are given illustrating the results.


Published in:
Computational Optimization And Applications, 55, 1, 137-153
Year:
2013
Publisher:
New York, Springer
ISSN:
0926-6003
Keywords:
Laboratories:




 Record created 2013-10-01, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)