Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
DOI10.1007/s10092-011-0039-8zbMath1230.65052OpenAlexW2020199282MaRDI QIDQ652558
Publication date: 14 December 2011
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-011-0039-8
convergencenumerical resultsconjugate gradient methodpreconditionerill-conditioned problemsindefinite least squares problemssparse QR factorization
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Preconditioners for iterative methods (65F08)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preconditioners for least squares problems by LU factorization
- The university of Florida sparse matrix collection
- Direct Methods for Sparse Linear Systems
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
- Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
- An Efficient Algorithm for a Bounded Errors-in-Variables Model
- Linear estimation in Krein spaces. I. Theory
This page was built for publication: Preconditioned conjugate gradient methods for the solution of indefinite least squares problems