Fine-Grained Parallel Incomplete LU Factorization
From MaRDI portal
Publication:5254437
DOI10.1137/140968896zbMath1320.65048OpenAlexW2095258827WikidataQ56698236 ScholiaQ56698236MaRDI QIDQ5254437
Publication date: 9 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1951278b65921aecf0908af7708d507f28e62a81
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Related Items
Updating strategy of a domain decomposition preconditioner for parallel solution of dynamic fracture problems ⋮ Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings ⋮ Parallel accelerated Stokesian dynamics with Brownian motion ⋮ Stabilized Finite Element Formulation and High-Performance Solver for Slightly Compressible Navier–Stokes Equations ⋮ A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners ⋮ ParILUT---A New Parallel Threshold ILU Factorization ⋮ A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units ⋮ Updating incomplete factorization preconditioners for model order reduction ⋮ Iterative ILU Preconditioners for Linear Systems and Eigenproblems ⋮ Toward a GPU-aware comparison of explicit and implicit CFD simulations on structured meshes ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Fully iterative ILU preconditioning of the unsteady Navier-Stokes equations for GPGPU ⋮ Supporting theory for a block approximate inverse preconditioner ⋮ An Asynchronous Incomplete Block LU Preconditioner for Computational Fluid Dynamics on Unstructured Grids ⋮ MPI+OpenMP реализация метода сопряженных градиентов с факторизованными неявными предобусловливателями ⋮ An implicit block ILU smoother for preconditioning of Newton-Krylov solvers with application in high-order stabilized finite-element methods ⋮ A robust and scalable multi-level domain decomposition preconditioner for multi-core architecture with large number of cores ⋮ A supernodal block factorized sparse approximate inverse for non-symmetric linear systems ⋮ Preconditioning techniques based on the Birkhoff-von Neumann decomposition ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ A block version of left-looking AINV preconditioner with one by one or two by two block pivots ⋮ Asynchronous fine-grain parallel implicit smoother in multigrid solvers for compressible flow ⋮ Fast Solvers for Charge Distribution Models on Shared Memory Platforms ⋮ A Scalable Multigrid Reduction Framework for Multiphase Poromechanics of Heterogeneous Media ⋮ ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures ⋮ Preparing sparse solvers for exascale computing ⋮ Preconditioning Parametrized Linear Systems ⋮ Development of general finite differences for complex geometries using a sharp interface formulation ⋮ A novel ILU preconditioning method with a block structure suitable for SIMD vectorization ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ Gaussian Belief Propagation Solvers for Nonsymmetric Systems of Linear Equations ⋮ RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the performance of a simple parallel implementation of the ILU-PCG for the Poisson equation on irregular domains
- Exploiting thread-level parallelism in the iterative solution of sparse linear systems
- On parallelism and convergence of incomplete LU factorizations
- Parallel algorithms for solving linear systems with sparse triangular matrices
- Sufficient conditions for the convergence of asynchronous iterations
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- The effect of ordering on preconditioned conjugate gradients
- Numerical experiments with parallel orderings for ILU preconditioners
- A comparative study of sparse approximate inverse preconditioners
- Scalable iterative solution of sparse linear systems
- Ordering techniques for the preconditioned conjugate gradient method on parallel computers
- Experimental study of ILU preconditioners for indefinite matrices
- Independent columns: A new parallel ILU preconditioner for the PCG method
- On asynchronous iterations
- A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
- Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
- Factors Impacting Performance of Multithreaded Sparse Triangular Solve
- Parallel Hybrid Preconditioning: Incomplete Factorization with Selective Sparse Approximate Inversion
- An implicit, numerical method for solving two-dimensional time-dependent diffusion problems
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- High Performance Preconditioning
- Distributed asynchronous computation of fixed points
- Multicolor ICCG Methods for Vector Computers
- A Vectorizable Variant of some ICCG Methods
- A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Asynchronous Iterative Methods for Multiprocessors
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Parallel Preconditioning with Sparse Approximate Inverses
- Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
- Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers
- Optimal Parallel Solution of Sparse Triangular Systems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
