Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows

DOI10.1145/3412559OpenAlexW3033311085WikidataQ113309908 ScholiaQ113309908MaRDI QIDQ5025215

Jennifer Scott, Miroslav Tůma

Publication date: 1 February 2022

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3412559

zbMATH Keywords

Schur complementCholesky factorizationsparse matricesiterative solversnormal matrixlinear least-squares problemsdirect solversdense rowsmatrix stretching

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items

A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations, Solving large linear least squares problems with linear equality constraints