A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
From MaRDI portal
Publication:2989130
DOI10.1145/1916461.1916467zbMath1365.65078OpenAlexW2156095889WikidataQ113310463 ScholiaQ113310463MaRDI QIDQ2989130
No author found.
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc926116/
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (10)
Fast Algorithms for Hyperspectral Diffuse Optical Tomography ⋮ Stable and efficient FEM-BEM coupling with OSRC regularisation for acoustic wave transmission ⋮ ParILUT---A New Parallel Threshold ILU Factorization ⋮ pyGDM -- a Python toolkit for full-field electro-dynamical simulations and evolutionary optimization of nanostructures ⋮ Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations ⋮ Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition ⋮ Minimal residual multistep methods for large stiff non-autonomous linear problems ⋮ A high performance level-block approximate LU factorization preconditioner algorithm ⋮ Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs ⋮ An algebraic multifrontal preconditioner that exploits the low‐rank property
This page was built for publication: A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
