Simple convergence analysis for the block conjugate gradient method with variable preconditioning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2182372 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
- A deflated conjugate gradient method for multiple right hand sides and multiple shifts
- Block CG algorithms revisited
- Flexible Inner-Outer Krylov Subspace Methods
- Flexible conjugate gradients
- GPCG–generalized preconditioned CG method and its use with non‐linear and non‐symmetric displacement decomposition preconditioners
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Multilevel Block Factorization Preconditioners
- Retooling the method of block conjugate gradients
- Steepest Descent and Conjugate Gradient Methods with Variable Preconditioning
- The University of Florida sparse matrix collection
- The block conjugate gradient algorithm and related methods
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
This page was built for publication: Simple convergence analysis for the block conjugate gradient method with variable preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898595)
