Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions
From MaRDI portal
Publication:5240796
DOI10.1137/18M1196285zbMath1425.65049OpenAlexW4289777353MaRDI QIDQ5240796
Publication date: 29 October 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1196285
Related Items
Uses Software
Cites Work
- Unnamed Item
- Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods
- Exact and inexact breakdowns in the block GMRES method
- The block conjugate gradient algorithm and related methods
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- A breakdown-free block conjugate gradient method
- Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- The university of Florida sparse matrix collection
- A Taxonomy for Conjugate Gradient Methods
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- How to Make Simpler GMRES and GCR More Stable
- Conjugate gradient method with preconditioning by projector
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- New development in freefem++
- Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- An Adaptive MultiPreconditioned Conjugate Gradient Algorithm
- Methods of conjugate gradients for solving linear systems
- Retooling the method of block conjugate gradients
