Logo image
Stable and real-zero polynomials in two variables
Journal article   Open access   Peer reviewed

Stable and real-zero polynomials in two variables

Anatolii Grinshpan, Dmitry S. Kaliuzhnyi-Verbovetskyi, Victor Vinnikov and Hugo J. Woerdeman
Multidimensional systems and signal processing, v 27(1), pp 1-26
01 Jan 2016
url
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.767.8178View

Abstract

Computer Science Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology
For every bivariate polynomial p( z(1), z(2)) of bidegree ( n(1), n(2)), with p( 0, 0) = 1, which has no zeros in the open unit bidisk, we construct a determinantal representation of the form p( z1, z2) = det( I - K Z), where Z is an ( n1 + n2) x( n1 + n2) diagonal matrix with coordinate variables z1, z2 on the diagonal and K is a contraction. We show that K may be chosen to be unitary if and only if p is a ( unimodular) constant multiple of its reverse. Furthermore, for every bivariate real-zero polynomial p( x(1), x(2)), with p( 0, 0) = 1, we provide a construction to build a representation of the form p( x1, x2) = det( I + x(1)A(1) + x2 A(2)), where A(1) and A2 are Hermitian matrices of size equal to the degree of p. A key component of both constructions is a stable factorization of a positive semidefinite matrix- valued poly-nomial in one variable, either on the circle ( trigonometric polynomial) or on the real line ( algebraic polynomial).

Metrics

9 Record Views
28 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Logo image