The block preconditioned conjugate gradient method on vector computers
From MaRDI portal
Publication:761010
DOI10.1007/BF01934919zbMath0556.65023MaRDI QIDQ761010
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
ICCG and related methods for 3D problems on vector computers, Practical use of the conjugate gradient method on parallel supercomputers, Circulant block-factorization preconditioners for elliptic problems, Recursive two-level ILU preconditioner for nonsymmetric M-matrices, Algorithms for calculating quark propagators on large lattices, Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers, Fast parallel algorithms for matrix inversion and linear systems solution, A block preconditioned conjugate gradient method for solving high-order finite element matrix equations, Partition-Based Nonstationary Covariance Estimation Using the Stochastic Score Approximation, Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, ILU preconditioning based on the FAPINV algorithm, A fine-grained block ILU scheme on regular structures for GPGPUs, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, Multiple search direction conjugate gradient method I: methods and their propositions, An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost, s-step iterative methods for symmetric linear systems, Domain decomposition preconditioners for the conjugate gradient method, Vectorizable preconditioners for elliptic difference equations in three space dimensions, Vectorizable preconditioners for mixed finite element solution of second-order elliptic problems, Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗, Estimation of spectral bounds in gradient algorithms, Multiple search direction conjugate gradient method II: theory and numerical experiments, The effect of block red-black ordering on block ILU preconditioner for sparse matrices, On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations, A Framework for Block ILU Factorizations Using Block-Size Reduction, Data structures to vectorize CG algorithms for general sparsity patterns, The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory, Block incomplete factorization preconditioners for a symmetric block-tridiagonal \(M\)-matrix, A survey of preconditioned iterative methods for linear systems of algebraic equations, Efficient and reliable iterative methods for linear systems, Incomplete block matrix factorization preconditioning methods. The ultimate answer?, On approximate factorization methods for block matrices suitable for vector and parallel processors
Cites Work
- Unnamed Item
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- Block Preconditioning for the Conjugate Gradient Method
- Preconditioning By Incomplete Block Cyclic Reduction
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- A Vectorizable Variant of some ICCG Methods
