Symbolic-Numeric Computation pp 1-15
On a Generalized Companion Matrix Pencil for Matrix Polynomials Expressed in the Lagrange Basis
Experimental observations of univariate rootfinding by generalized companion matrix pencils expressed in the Lagrange basis show that the method can sometimes be numerically stable. It has recently been proved that a new rootfinding condition number, defined for points on a set containing the interpolation points, is never larger than the rootfinding condition number for the Bernstein polynomial (which is itself optimally small in a certain sense); and computation shows that sometimes it can be much smaller. These results extend to the matrix polynomial case, although in this case we are not computing polynomial roots but rather ‘polynomial eigenvalues’ (sometimes known as ‘latent roots’), i.e. finding the values of x where the matrix polynomial is singular. This paper gives two theorems explaining part of the influence of the geometry of the interpolation nodes on the conditioning of the rootfinding and eigenvalue problems.
KeywordsLagrange basis companion matrix polynomial eigenvalue
Unable to display preview. Download preview PDF.
- A. Amiraslani. Dividing polynomials when you only know their values. In Laureano Gonzalez-Vega and Tomas Recio, editors, Proceedings EACA, pages 5–10, June 2004.Google Scholar
- A. Amiraslani. Algorithms for Matrices, Polynomials, and Matrix Polynomials. PhD thesis, University of Western Ontario, London, Canada, May 2006.Google Scholar
- A. Amiraslani, D. Aruliah, and R.M. Corless. The Rayleigh quotient iteration for generalized companion matrix pencils. in preparation, 2006.Google Scholar
- A. Amiraslani, D. Aruliah, R.M. Corless, and N. Rezvani. Pseudospectra of matrix polynomials in different bases. Poster TR-06-03, Ontario Research Centre for Computer Algebra, http://www.orcca.on.ca/techreports, June 2006. presented as a poster at CAIMS/MITACS York, June 2006.Google Scholar
- A. Amiraslani, R.M. Corless, L. Gonzalez-Vega, and A. Shakoori. Polynomial algebra by values. Technical Report TR-04-01, Ontario Research Centre for Computer Algebra, http://www.orcca.on.ca/TechReports, January 2004.Google Scholar
- R.M. Corless. Generalized companion matrices in the Lagrange basis. In Laureano Gonzalez-Vega and Tomas Recio, editors, Proceedings EACA, pages 317–322, June 2004.Google Scholar
- R.M. Corless. The reducing subspace at infinity for the generalized companion matrix in the Lagrange basis. in preparation, 2006.Google Scholar
- R.M. Corless and S.M. Watt. Bernstein bases are optimal, but, sometimes, Lagrange bases are better. In Proceedings SYNASC, Timisoara, pages 141–153. MITRON Press, September 2004.Google Scholar
- S. Fortune. Polynomial root finding using iterated eigenvalue computation. In Bernard Mourrain, editor, Proceedings ISSAC, pages 121–128, London, Canada, 2001. ACM Press.Google Scholar
- O. Ruatta. A multivariate Weierstrass iterative rootfinder. In ISSAC’ 01: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, pages 276–283, New York, NY, USA, 2001. ACM Press.Google Scholar
- A. Shakoori. The Bézout matrix in the Lagrange basis. In Laureano Gonzalez-Vega and Tomas Recio, editors, Proceedings EACA, pages 295–299, June 2004.Google Scholar