A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 25 (2), 405-428
- https://doi.org/10.1137/s0895479802409390
Abstract
We present a Krylov subspace-type projection method for a quadratic matrix polynomial $\lambda^2 I -\lambda A - B$ that works directly with A and B without going through any linearization. We discuss a special case when one matrix is a low rank perturbation of the other matrix. We also apply the method to solve quadratically constrained linear least squares problem through a reformulation of Gander, Golub, and von Matt as a quadratic eigenvalue problem, and we demonstrate the effectiveness of this approach. Numerical examples are given to illustrate the efficiency of the algorithms.
Keywords
This publication has 25 references indexed in Scilit:
- On the regularizing properties of the GMRES methodNumerische Mathematik, 2002
- Templates for the Solution of Algebraic Eigenvalue ProblemsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2000
- Iterative exponential filtering for large discrete ill-posed problemsNumerische Mathematik, 1999
- Estimation of the L-Curve via Lanczos BidiagonalizationBIT Numerical Mathematics, 1999
- Applied Numerical Linear AlgebraPublished by Society for Industrial & Applied Mathematics (SIAM) ,1997
- Quadratically constrained least squares and quadratic problemsNumerische Mathematik, 1991
- A constrained eigenvalue problemLinear Algebra and its Applications, 1989
- Least squares with a quadratic constraintNumerische Mathematik, 1980
- On the Stationary Values of a Second-Degree Polynomial on the Unit SphereJournal of the Society for Industrial and Applied Mathematics, 1965
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951