A scalable parallel algorithm for incomplete factor preconditioning
From MaRDI portal
The paper deals with a parallel algorithm for computing incomplete factor preconditioners. It is shown that the algorithm attains a high degree of parallelism through graph partitioning and a two-level ordering strategy. Adequate experimental results are presented.
Recommendations
- scientific article; zbMATH DE number 434785
- An efficient implementation for SSOR and incomplete factorization preconditionings
- Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion
- Parallel versions of some iterative methods with factorized preconditioners
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- A multilevel block incomplete factorization preconditioning
- Adaptive techniques for improving the performance of incomplete factorization preconditioning
- Factorized parallel preconditioner for the saddle point problem
- High Performance Computing for Computational Science - VECPAR 2004
- A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings
Cited in
(39)- Parallel versions of some iterative methods with factorized preconditioners
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- A fine-grained block ILU scheme on regular structures for GPGPUs
- The effect of block red-black ordering on block ILU preconditioner for sparse matrices
- Preconditioning techniques for large linear systems: A survey
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A parallel multithreaded sparse triangular linear system solver
- A high performance level-block approximate LU factorization preconditioner algorithm
- Domain decomposition based parallel computing for multi-scale coronary blood flow simulations
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- Hierarchically parallel coupled finite strain multiscale solver for modeling heterogeneous layers
- Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- ParILUT---A New Parallel Threshold ILU Factorization
- Discretization and parallel iterative schemes for advection-diffusion-reaction problems
- A parallel adaptive finite element method for the simulation of photon migration with the radiative‐transfer‐based model
- CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
- A parallel wavelet-based algebraic multigrid black-box solver and preconditioner
- A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings
- Incomplete LU preconditioner based on max-plus approximation of LU factorization
- JASMIN-based two-dimensional adaptive combined preconditioner for radiation diffusion equations in inertial fusion research
- Efficient numerical solution of geometric inverse problems involving Maxwell's equations using shape derivatives and automatic code generation
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
- scientific article; zbMATH DE number 2099046 (Why is no real title available?)
- A robust incomplete factorization based on value and space constraints
- Parallel Iterative Solvers with Localized ILU Preconditioning for Unstructured Grids on Workstation Clusters
- A new relaxed splitting preconditioner for multidimensional multi-group radiation diffusion equations
- Iterative ILU preconditioners for linear systems and eigenproblems
- Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs
- Fine-grained parallel incomplete LU factorization
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
- A latency tolerant hybrid sparse solver using incomplete Cholesky factorization
- Exploiting thread-level parallelism in the iterative solution of sparse linear systems
- A hybrid PML formulation for the 2D three-field dynamic poroelastic equations
- Exploiting spatial symmetries for solving Poisson's equation
- The importance of structure in incomplete factorization preconditioners
- Some ways of parallel implementation of the conjugate gradient method with an implicit factorized preconditioner
- Matrix-free preconditioning using partial matrix estimation
This page was built for publication: A scalable parallel algorithm for incomplete factor preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719261)