Fast Algorithms for Structured Least Squares and Total Least Squares Problems

We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z(1) and Z(2). We develop formulas for the generators of the matrix M (H)M in terms of the generators of M and show that the Cholesky factorization of the matrix M (...

Descripción completa

Detalles Bibliográficos
Autores principales: Kalsi, Anoop, O’Leary, Dianne P.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology 2006
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4662500/
https://www.ncbi.nlm.nih.gov/pubmed/27274922
http://dx.doi.org/10.6028/jres.111.010
Descripción
Sumario:We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z(1) and Z(2). We develop formulas for the generators of the matrix M (H)M in terms of the generators of M and show that the Cholesky factorization of the matrix M (H)M can be computed quickly if Z(1) is close to unitary and Z(2) is triangular and nilpotent. These conditions are satisfied for several classes of matrices, including Toeplitz, block Toeplitz, Hankel, and block Hankel, and for matrices whose blocks have such structure. Fast Cholesky factorization enables fast solution of least squares problems, total least squares problems, and regularized total least squares problems involving these classes of matrices.

Ejemplares similares