Revisiting performance of biCGStab methods for solving systems with multiple right-hand sides

DOI10.1016/j.camwa.2019.11.025zbMath1435.65052arXiv1907.12874OpenAlexW2996183762WikidataQ126544457 ScholiaQ126544457MaRDI QIDQ2308475

Boris I. Krasnopolsky

Publication date: 3 April 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.12874

zbMATH Keywords

Krylov subspace iterative methodsmultiple right-hand sidessystems of linear algebraic equationsexecution time model

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (1)

Exploiting spatial symmetries for solving Poisson's equation

Uses Software

• PETSc
• GpBiCg
• PT-Scotch
• Intel MPI Benchmarks
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
• GPBiCG(\(m,\ell\)): A hybrid of biCGSTAB and GPBiCG methods with efficiency and robustness
• Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
• Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Revisiting performance of biCGStab methods for solving systems with multiple right-hand sides