Cargando…
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 (...
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: | |
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 |
Ejemplares similares
-
New fast algorithms for structured linear least squares problems
por: Gu, M
Publicado: (1995) -
The total least squares problem : computational aspects and analysis /
por: Huffel, Sabine van
Publicado: (1991) -
Solving least squares problems /
por: Lawson, Charles L.
Publicado: (1995) -
Solving least squares problems
por: Lawson, Charles L, et al.
Publicado: (1995) -
Solving least squares problems
por: Lawson, Charles L, et al.
Publicado: (1974)