Minimizing synchronization in IDR (s )
From MaRDI portal
Publication:2897405
DOI10.1002/nla.764zbMath1249.65066OpenAlexW2140854528MaRDI QIDQ2897405
Martin B. van Gijzen, Tijmen P. Collignon
Publication date: 10 July 2012
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.764
numerical experimentsfast algorithmsconvection-diffusion problemiterative methodsnonsymmetric linear systemGrid computingperformance modelIDR(s) cluster
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20)
Related Items
Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, IDR(\(s\)) for solving shifted nonsymmetric linear systems, A matrix-free parallel solution method for the three-dimensional heterogeneous Helmholtz equation, Accelerating the induced dimension reduction method using spectral information
Cites Work
- A performance model for Krylov subspace methods on mesh-based parallel computers
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- s-step iterative methods for symmetric linear systems
- Algorithm 913
- Interpreting IDR as a Petrov–Galerkin Method
- Exploiting BiCGstab($\ell$) Strategies to Induce Dimension Reduction
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
