English
Related papers

Related papers: On non-optimal spectral factorizations

200 papers

Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…

Numerical Analysis · Mathematics 2017-12-05 Adhemar Bultheel , Ruyman Cruz-Barroso , Andreas Lasarow

Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…

Classical Analysis and ODEs · Mathematics 2007-05-23 Jeffrey S. Geronimo , Ming-Jun Lai

We consider matrix functions with certain invariance under inversion in the unit circle. If such a function satisfies a positivity assumption on the unit circle, then only zero partial indices appear in its Riemann-Hilbert (Wiener-Hopf)…

Mathematical Physics · Physics 2018-06-01 Hideshi Yamane

A spectral factorization theorem is proved for polynomial rank-deficient matrix-functions. The theorem is used to construct paraunitary matrix-functions with first rows given.

Complex Variables · Mathematics 2010-08-19 Lasha Ephremidze , Edem Lagvilava

We investigate the peripheral spectrum of irreducible positive elements of an ordered Banach algebra. In particular, we give conditions under which the peripheral spectrum contains (or coincides with) the cyclic group generated by a root of…

Functional Analysis · Mathematics 2017-05-19 Egor A. Alekhno

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

Complex Variables · Mathematics 2010-11-17 Lasha Ephremidze

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

Functional Analysis · Mathematics 2018-03-29 Ilya M. Spitkovsky , Anatoly F. Voronin

We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…

Algebraic Geometry · Mathematics 2019-02-12 Colin Tan , Wing-Keung To

A linear polyomial non-negative on the non-negativity domain of finitely many linear polynomials can be expressed as their non-negative linear combination. Recently, under several additional assumptions, Helton, Klep, and McCullough…

Operator Algebras · Mathematics 2012-11-28 Aljaž Zalar

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Number Theory · Mathematics 2024-09-16 Jose Felipe Voloch

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

Algebraic Geometry · Mathematics 2014-11-24 O. G. Styrt

We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…

Rings and Algebras · Mathematics 2016-11-01 Xuefang Sui , Paolo Gondolo

Unitarity is the fundamental property of the S-matrix while its usage for a scattering of unstable particles has been subtle as unstable particles do not appear in the asymptotic states. Defining unstable-particle amplitudes as residues of…

High Energy Physics - Theory · Physics 2023-04-05 Katsuki Aoki

We discuss the possibility to represent smooth nonnegative matrix-valued functions as finite linear combinations of fixed matrices with positive real-valued coefficients whose square roots are Lipschitz continuous. This issue is reduced to…

Optimization and Control · Mathematics 2007-06-04 N. V. Krylov

It is well known that a non-negative definite polynomial matrix (a polynomial Gramian) $G(t)$ can be written as a product of its polynomial spectral factors, $G(t) = X(t)^H X(t)$. In this paper, we give a new algebraic characterization of…

Signal Processing · Electrical Eng. & Systems 2019-03-12 Puoya Tabaghi , Ivan Dokmanić

Spectral and factorization properties of oscillatory matrices leads to a spectral Favard theorem for bounded banded matrices, that admit a positive bidiagonal factorization, in terms of sequences of mixed multiple orthogonal polynomials…

Classical Analysis and ODEs · Mathematics 2022-12-21 Amílcar Branquinho , Ana Foulquié-Moreno , Manuel Mañas

In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of…

Optimization and Control · Mathematics 2016-11-15 Giacomo Baggio , Augusto Ferrante

Planar N=4 super Yang-Mills appears to be integrable. While this allows to find this theory's exact spectrum, integrability has hitherto been of no direct use for scattering amplitudes. To remedy this, we deform all scattering amplitudes by…

High Energy Physics - Theory · Physics 2013-03-27 Livia Ferro , Tomasz Lukowski , Carlo Meneghelli , Jan Plefka , Matthias Staudacher

We calculate the particle spectrum of the SSM which follows from the assumption that the commonly assumed universal form of the soft supersymmetry --breaking terms is invariant under renormalisation. It is argued that this ``strong''…

High Energy Physics - Phenomenology · Physics 2008-02-03 I. Jack , D. R. T. Jones , K. L. Roberts

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

Computational Complexity · Computer Science 2017-04-07 Joel Ouaknine , James Worrell
‹ Prev 1 2 3 10 Next ›