Updating preconditioners for modified least squares problems

DOI10.1007/s11075-017-0315-zzbMath1368.65042OpenAlexW2604296924MaRDI QIDQ2360681

Yanyan Li

Publication date: 4 July 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/105807

zbMATH Keywords

numerical experimentsiterative methodssparse matricespreconditionersleast squares problemsbordering methodlow-rank updates

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Preconditioners for iterative methods (65F08)

Related Items (2)

Preconditioners for rank deficient least squares problems ⋮ Restrictively Preconditioned Conjugate Gradient Method for a Series of Constantly Augmented Least Squares Problems

Uses Software

• SparseMatrix
• ILUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-rank updates of balanced incomplete factorization preconditioners
• Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
• Multiple-Rank Modifications of a Sparse Cholesky Factorization
• The university of Florida sparse matrix collection
• Modifying a Sparse Cholesky Factorization
• Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
• Computing the block triangular form of a sparse matrix
• ILUT: A dual threshold incomplete LU factorization
• Row Modifications of a Sparse Cholesky Factorization
• A robust incomplete factorization preconditioner for positive definite matrices

This page was built for publication: Updating preconditioners for modified least squares problems