Parallel m-step preconditioners for the conjugate gradient method
From MaRDI portal
Recommendations
Cited in
(19)- Consistent sparse factorization
- Practical use of the conjugate gradient method on parallel supercomputers
- An efficient parallel preconditioned conjugate gradient method for sparse linear equations
- scientific article; zbMATH DE number 3992788 (Why is no real title available?)
- Some ways of parallel implementation of the conjugate gradient method with an implicit factorized preconditioner
- scientific article; zbMATH DE number 4174230 (Why is no real title available?)
- scientific article; zbMATH DE number 218073 (Why is no real title available?)
- scientific article; zbMATH DE number 671776 (Why is no real title available?)
- An assessment of the preconditioned gradient method with retards for parallel computers
- scientific article; zbMATH DE number 440661 (Why is no real title available?)
- A full parallel preconditioner for a class of M-matrices
- Parallel scheduling of the PCG method for banded matrices rising from FDM/FEM.
- An adaptive multipreconditioned conjugate gradient algorithm
- Overhead considerations for parallelizing conjugate gradient
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- A parallel additive preconditioner for conjugate gradient method for \(AX+XB=C\)
- A parallel version of the preconditioned conjugate gradient method for boundary element equations
- Efficient parallel implementations of finite element methods based on the conjugate gradient method
- Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
This page was built for publication: Parallel m-step preconditioners for the conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285688)