3 papers
math.NA2026
Row-Splitting ILU Preconditioners for Sparse Least-Squares Problems
Jennifer Scott, Miroslav Tůma
Preconditioning for overdetermined least-squares problems has received comparatively little attention, and designing methods that are both effective and memory-efficient remains ch…
math.NA2025
A computational study of low precision incomplete Cholesky factorization preconditioners for sparse linear least-squares problems
Jennifer Scott, Miroslav Tůma
Our interest lies in the robust and efficient solution of large sparse linear least-squares problems. In recent years, hardware developments have led to a surge in interest in expl…
math.NA2025
Developing robust incomplete Cholesky factorizations in half precision arithmetic
Jennifer Scott, Miroslav Tůma
Incomplete factorizations have long been popular general-purpose algebraic preconditioners for solving large sparse linear systems of equations. Guaranteeing the factorization is b…