General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case

DOI10.1007/978-3-031-30442-2_2OpenAlexW4367356023MaRDI QIDQ6135460FDOQ6135460

Authors: Roman Iakymchuk, Stef Graillat, José I. Aliaga 

Publication date: 25 August 2023

Published in: Parallel Processing and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30442-2_2

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

zbMATH Keywords

reproducibilityaccuracypreconditioned BiCGStabfloating-point expansionlong accumulatorfused multiply-add

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Parallel algorithms in computer science (68W10)

Cites Work

• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• MPFR
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Accurate Sum and Dot Product
• Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
• The exact dot product as basic tool for long interval arithmetic
• Reproducibility strategies for parallel preconditioned conjugate gradient
• Parallel Reproducible Summation

Cited In (1)

• Biconjugate direction methods in Krylov subspaces

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)