Some ways of parallel implementation of the conjugate gradient method with an implicit factorized preconditioner
From MaRDI portal
Publication:6493858
DOI10.20948/MM-2024-02-10MaRDI QIDQ6493858
Publication date: 29 April 2024
Published in: Matematicheskoe Modelirovanie (Search for Journal in Brave)
conjugate gradient methodparallel preconditioningincomplete Cholesky factorizationdomain decomposition ordering
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Cites Work
- Unnamed Item
- Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods
- On parallelism and convergence of incomplete LU factorizations
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The effect of ordering on preconditioned conjugate gradients
- A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
- Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- New convergence results and preconditioning strategies for the conjugate gradient method
- Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
- Parallel approximate factorization method for solving discrete elliptic equations
- Parallel iterative methods using factorized preconditioning matrices for solving elliptic equations on triangular grids
This page was built for publication: Some ways of parallel implementation of the conjugate gradient method with an implicit factorized preconditioner
