1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
Avoiding breakdown in incomplete factorizations in low precision arithmetic
Jennifer Scott, Miroslav Tůma
The emergence of low precision floating-point arithmetic in computer hardware has led to a resurgence of interest in the use of mixed precision numerical linear algebra. For linear…