Minimizing and maximizing the Euclidean norm of the product of two polynomials (Q652575)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimizing and maximizing the Euclidean norm of the product of two polynomials |
scientific article |
Statements
Minimizing and maximizing the Euclidean norm of the product of two polynomials (English)
0 references
14 December 2011
0 references
This paper deals with the maximum and minimum problem for the function \[ f_{m,n}(p,q)= \frac{\parallel pq \parallel}{\parallel p \parallel \parallel q \parallel}, \] where \(p\) and \(q\) are real or complex polynomials with degrees not greater than \(m\) and \(n\) respectively, with \(\parallel. \parallel\) being the euclidean norm of the polynomial coeficients. For the complex case it is proven that for \( f_{m,n}(p,q)\) assume the maximum and the minimum it is necessary that \(p\) and \(q\) have degrees \(m\) and \(n\) respectively and with all roots laying on the complex unit circle. For the real case the above necessary conditions are restrict to the minimum. Furthermore, those results are applied to the problem of finding the largest or the smallest eigenvalue of some positive definite Hermitian matrices.
0 references
inequalities of polynomial products
0 references
eigenvalues
0 references
eigenvectors
0 references
autocorrelation Toeplitz matrices
0 references
positive definite Hermitian matrices
0 references