Minimizing synchronization in IDR(s).
DOI10.1002/NLA.764zbMATH Open1249.65066OpenAlexW2140854528MaRDI QIDQ2897405FDOQ2897405
Authors: Tijmen P. Collignon, Martin B. van Gijzen
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
Recommendations
- On the minimal synchronism needed for distributed consensus
- Reducibility of synchronization structures
- Minimal Threshold Separators and Memory Requirements for Synchronization
- Efficient synchronization of multiprocessors with shared memory
- Space-Optimal, Wait-Free Real-Time Synchronization
- Another approach to the implementation of synchronization primitives
- scientific article; zbMATH DE number 1875365
numerical experimentsiterative methodsfast algorithmsnonsymmetric linear systemconvection-diffusion problemGrid computingperformance modelIDR(s) cluster
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06)
Cites Work
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- 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
- 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
- Interpreting IDR as a Petrov-Galerkin method
- A performance model for Krylov subspace methods on mesh-based parallel computers
Cited In (4)
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- A matrix-free parallel solution method for the three-dimensional heterogeneous Helmholtz equation
- Accelerating the induced dimension reduction method using spectral information
This page was built for publication: Minimizing synchronization in \(\text{IDR}(s)\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897405)