General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case
From MaRDI portal
Publication:6135460
Recommendations
- Reproducible and accurate matrix multiplication
- Reproducibility strategies for parallel preconditioned conjugate gradient
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Modified Krylov acceleration for parallel environments
- Hardware-oriented Krylov methods for high-performance computing
Cites work
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Accurate Sum and Dot Product
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- MPFR
- Parallel Reproducible Summation
- Reproducibility strategies for parallel preconditioned conjugate gradient
- The exact dot product as basic tool for long interval arithmetic
This page was built for publication: General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135460)