Pages that link to "Item:Q4917164"
From MaRDI portal
The following pages link to Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines (Q4917164):
Displaying 28 items.
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers (Q316448) (← links)
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR (Q327002) (← links)
- An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. (Q778541) (← links)
- Robust and efficient adjoint solver for complex flow conditions (Q1653706) (← links)
- Inner product free iterative solution and elimination methods for linear systems of a three-by-three block matrix form (Q2199774) (← links)
- Distributed fast boundary element methods for Helmholtz problems (Q2286030) (← links)
- Anatomically accurate high resolution modeling of human whole heart electromechanics: A strongly scalable algebraic multigrid solver method for nonlinear deformation (Q2374953) (← links)
- Deflation-accelerated preconditioning of the Poisson-Neumann Schur problem on long domains with a high-order discontinuous element-based collocation method (Q2375067) (← links)
- Analysis and practical use of flexible biCGStab (Q2399204) (← links)
- GMRES algorithms over 35 years (Q2698151) (← links)
- Communication-hiding pipelined BiCGSafe methods for solving large linear systems (Q2698258) (← links)
- Enlarged Krylov subspace conjugate gradient methods for reducing communication (Q2813336) (← links)
- Pipelined, flexible Krylov subspace methods (Q2818249) (← links)
- ViennaCL-linear algebra library for multi- and many-core architectures (Q2830624) (← links)
- The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology (Q4553788) (← links)
- The Adaptive $s$-Step Conjugate Gradient Method (Q4584923) (← links)
- On the cost of iterative computations (Q4993500) (← links)
- A Communication Optimization Scheme for Basis Computation of Krylov Subspace Methods on Multi-GPUs (Q5055706) (← links)
- Scalable Asynchronous Domain Decomposition Solvers (Q5147969) (← links)
- DASHMM Accelerated Adaptive Fast Multipole Poisson-Boltzmann Solver on Distributed Memory Architecture (Q5161413) (← links)
- s-Step Enlarged Krylov Subspace Conjugate Gradient Methods (Q5208740) (← links)
- Communication Avoiding ILU0 Preconditioner (Q5254468) (← links)
- Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units (Q5270772) (← links)
- Novel Multilevel Preconditioners for the Systems Arising from Plane Wave Discretization of Helmholtz Equations with Large Wave Numbers (Q5350443) (← links)
- Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method (Q5373919) (← links)
- Chaotic multigrid methods for the solution of elliptic equations (Q6042304) (← links)
- Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems (Q6043327) (← links)
- Coarsest-level improvements in multigrid for lattice QCD on large-scale computers (Q6051367) (← links)
