An integer arithmetic-based AMG preconditioned FGMRES solver

DOI10.1145/3704726MaRDI QIDQ6966608zbMATH OpenFDO

Authors Kengo Suzuki, Takeshi Fukaya, Takeshi Iwashita

Publication date 27 June 2025

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3704726

zbMATH Keywords

Krylov subspace methodssparse linear systemsiterative refinementinteger arithmeticflexible GMRESalgebraic multigrid preconditionersfixed-point numbers

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic
• A Multigrid Tutorial, Second Edition
• A Note on GMRES Preconditioned by a Perturbed L D L^T Decomposition with Static Pivoting
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• Accelerating the solution of linear systems by iterative refinement in three precisions
• Algebraic Error Analysis for Mixed-Precision Multigrid Solvers
• Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
• Mixed precision algorithms in numerical linear algebra
• The University of Florida sparse matrix collection
• \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner

This page was built for publication: An integer arithmetic-based AMG preconditioned FGMRES solver

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