Inverse subspace problems with applications.

SUMMARY Given a square matrix A, the inverse subspace problem is concerned with determining a closest matrix to A with a prescribed invariant subspace. When A is Hermitian, the closest matrix may be required to be Hermitian. We measure distance in the Frobenius norm and discuss applications to Krylov subspace methods for the solution of large-scale linear systems of equations and eigenvalue problems as well as to the construction of blurring matrices. Extensions that allow the matrix A to be rectangular and applications to Lanczos bidiagonalization, as well as to the recently proposed subspace-restricted SVD method for the solution of linear discrete ill-posed problems, also are considered.Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]