Multivariate Positive Laurent Polynomials
نویسندگان
چکیده
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 Féjer-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. Finally we discuss how to compute nonnegative Laurent polynomial factorizations in the multivariate setting. §
منابع مشابه
Factorization of multivariate positive Laurent polynomials
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 Féjer-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. F...
متن کاملAlgorithms for the Functional Decomposition of Laurent Polynomials
Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univariate Laurent polynomial decompositions efficiently and gives their multivariate generalization. One application of functional decomposition of Laurent polynomials is the functional decomposition of so-called “symbolic polynomials...
متن کاملSymmetrized Chebyshev Polynomials
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that Tn(c cos θ) and Un(c cos θ) are positive definite functions. We further s...
متن کاملMultivariate Refinable Functions of High Approximation Order Via Quotient Ideals of Laurent Polynomials
We give an algebraic interpretation of the well–known “zero–condition” or “sum rule” for multivariate refinable functions with respect to an arbitrary scaling matrix. The main result is a characterization of these properties in terms of containment in a quotient ideal, however not in the ring of polynomials but in the ring of Laurent polynomials.
متن کاملMultivariate Orthogonal Laurent Polynomials and Integrable Systems
An ordering for Laurent polynomials in the algebraic torus (C∗)D, inspired by the Cantero–Moral– Velázquez approach to orthogonal Laurent polynomials in the unit circle, leads to the construction of a moment matrix for a given Borel measure in the unit torus T. The Gauss–Borel factorization of this moment matrix allows for the construction of multivariate biorthogonal Laurent polynomials in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005