Developing robust incomplete Cholesky factorizations in half precision arithmetic

DOI10.1007/S11075-025-02015-XMaRDI QIDQ6875893zbMATH OpenFDO

Authors J. A. Scott, Miroslav Tuma

Publication date 13 January 2026

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

preconditioningincomplete factorizationshalf precision arithmeticiterative methods for sparse linear systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Numerical algorithms for computer arithmetic, etc. (65Y04)

This page was built for publication: Developing robust incomplete Cholesky factorizations in half precision arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875893)