Bounding Multivariate Trigonometric Polynomials

The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop simple and efficiently computable estimates of the extremal values of a multivariate trigonometric polynomial directly from its samples. We provide an upper bound on the modulus of a complex trigonometric polynomial, and develop upper and lower bounds for real trigonometric polynomials. For a univariate polynomial, these bounds are tighter than existing bounds, and the extension to multivariate polynomials is new. As an application, the lower bound provides a sufficient condition to certify global positivity of a real trigonometric polynomial.

[1]  The Crest Factor for Trigonometric PolynomialsPart I : Approximation Theoretical , 2001 .

[2]  Minh N. Do,et al.  Multidimensional orthogonal filter bank characterization and design using the Cayley transform , 2005, IEEE Transactions on Image Processing.

[3]  Tony F. Chan,et al.  Circulant preconditioners for Toeplitz-block matrices , 1994, Numerical Algorithms.

[4]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[5]  V. Pisarenko.  The Retrieval of Harmonics from a Covariance Function , 1973 .

[6]  Robert M. Gray,et al.  Toeplitz and Circulant Matrices: A Review , 2005, Found. Trends Commun. Inf. Theory.

[7]  Martin Vetterli,et al.  Oversampled filter banks , 1998, IEEE Trans. Signal Process..

[8]  Holger Boche,et al.  Peak Magnitude of Oversampled Trigonometrie Polynomials , 2002 .

[9]  Minh N. Do,et al.  Multidimensional Filter Banks and Multiscale Geometric Representations , 2012, Found. Trends Signal Process..

[10]  Elias M. Stein,et al.  Fourier Analysis: An Introduction , 2003 .

[11]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[12]  Bogdan Dumitrescu,et al.  POS3POLY—a MATLAB preprocessor for optimization with positive polynomials , 2013 .

[13]  T. Sørevik,et al.  Trigonometric interpolation on lattice grids , 2016 .

[14]  Bernard C. Levy,et al.  State space representations of 2-D FIR lossless transfer matrices , 1994 .

[15]  B. Dumitrescu.  Positive Trigonometric Polynomials and Signal Processing Applications , 2007 .

[16]  Faramarz Fekri,et al.  Results on the factorization of multidimensional matrices for paraunitary filterbanks over the complex field , 2004, IEEE Transactions on Signal Processing.

[17]  J. Nagy,et al.  Circulant Preconditioned Toeplitz Least Squares Iterations , 1994, SIAM J. Matrix Anal. Appl..

[18]  Georg Zimmermann,et al.  The Crest factor for trigonometric polynomials. Part I: Approximation theoretical estimates , 2001 .

[19]  Marc Van Barel,et al.  Computing a Lower Bound of the Smallest Eigenvalue of a Symmetric Positive-Definite Toeplitz Matrix , 2008, IEEE Transactions on Information Theory.

[20]  P. Vaidyanathan.  Multirate Systems And Filter Banks , 1992 .

[21]  P. Heywood.  Trigonometric Series , 1968, Nature.

[22]  Martin Vetterli,et al.  A theory of multirate filter banks , 1987, IEEE Trans. Acoust. Speech Signal Process..

[23]  A. Böttcher,et al.  Introduction to Large Truncated Toeplitz Matrices , 1998 .

[24]  John G. Proakis,et al.  Digital Signal Processing 4th Edition , 2006 .

[25]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..