Assessing the Performance of Mixed-Precision ILU(0)-Preconditioned Multiple-Precision Real and Complex Krylov Subspace Methods
By: Tomonori Kouya
Potential Business Impact:
Makes computer math problems solve faster and more accurately.
Krylov subspace methods are linear solvers based on matrix-vector multiplications and vector operations. While easily parallelizable, they are sensitive to rounding errors and may experience convergence issues. ILU(0), an incomplete LU factorization with zero fill-in, is a well-known preconditioning technique that enhances convergence for sparse matrices. In this paper, we implement a double-precision and multiple-precision ILU(0) preconditioner, compatible with product-type Krylov subspace methods, and evaluate its performance.
Similar Papers
A computational study of low precision incomplete Cholesky factorization preconditioners for sparse linear least-squares problems
Numerical Analysis
Makes computers solve hard math problems faster.
Mixed-precision iterative refinement for low-rank Lyapunov equations
Numerical Analysis
Speeds up computer math without losing accuracy.
HPL-MxP Benchmark: Mixed-Precision Algorithms, Iterative Refinement, and Scalable Data Generation
Numerical Analysis
Makes supercomputers run faster for AI.