Year: 2026
Type: preprint
Abstract: Preconditioning for overdetermined least-squares problems has received comparatively little attention, and designing methods that are both effective and memory-efficient remains challenging. We propose a class of ILU-based preconditioners built around a row-splitting strategy that identifies a well-conditioned square submatrix via an incomplete LU factorization and combines its incomplete factors with algebraic corrections from the remaining rows. This construction avoids forming the normal equations and is well suited to problems for which the normal matrix is ill-conditioned or relatively dense. Numerical experiments on test problems arising from practical applications illustrate the effectiveness of the proposed approach when used with a Krylov subspace solver and demonstrate it can outperform preconditioners based on incomplete Cholesky factorization of the normal equations, including for sparse-dense problems, where the splitting naturally isolates dense rows.
Source: arXiv (Cornell University)
Authors: Scott, Jennifer, Tůma, Miroslav
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7147267987
Cites:
Cited by:
Related to: