Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients

02/14/2022
by   Victor Magron, et al.
0

Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fejéz spectral factorization theorem that any trigonometric univariate polynomial positive on the unit circle can be decomposed as a Hermitian square with complex coefficients. Here we focus on the case of polynomials with Gaussian integer coefficients, i.e., with real and imaginary parts being integers. We design, analyze and compare, theoretically and practically,three hybrid numeric-symbolic algorithms computing weighted sums of Hermitian squares decompositions for trigonometric univariate polynomials positive on the unit circle with Gaussian coefficients. The numerical steps the first and second algorithm rely on are complex root isolation and semidefinite programming, respectively. An exact sum of Hermitian squares decomposition is obtained thanks to compensation techniques. The third algorithm, also based on complex semidefinite programming, is an adaptation of the rounding and projection algorithm by Peyrl and Parrilo. For all three algorithms, we prove bit complexity and output size estimates that are polynomial in the degree of the input and linear in the maximum bitsize of its coefficients. We compare their performance on randomly chosen benchmarks, and further design a certified finite impulse filter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2017

Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials

It is well-known that every non-negative univariate real polynomial can ...
research
02/28/2018

On Exact Polya and Putinar's Representations

We consider the problem of finding exact sums of squares (SOS) decomposi...
research
11/25/2018

On Exact Reznick, Hilbert-Artin and Putinar's Representations

We consider the problem of finding exact sums of squares (SOS) decomposi...
research
02/08/2018

Exact algorithms for semidefinite programs with degenerate feasible set

Let A_0, ..., A_n be m × m symmetric matrices with entries in Q, and let...
research
08/12/2021

Matrix pencils with coefficients that have positive semidefinite Hermitian part

We analyze when an arbitrary matrix pencil is equivalent to a dissipativ...
research
05/23/2022

Low-Rank Univariate Sum of Squares Has No Spurious Local Minima

We study the problem of decomposing a polynomial p into a sum of r squar...
research
12/14/2020

SONC Optimization and Exact Nonnegativity Certificates via Second-Order Cone Programming

The second-order cone (SOC) is a class of simple convex cones and optimi...

Please sign up or login with your details

Forgot password? Click here to reset