HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from PDEs
From MaRDI portal
Publication:5033213
DOI10.1002/NLA.2400OpenAlexW3170522364WikidataQ114235408 ScholiaQ114235408MaRDI QIDQ5033213
Xiangmin Jiao, Qiao Chen, Aditi Ghai
Publication date: 22 February 2022
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.10139
robustnesspreconditionersmultilevel methodsKrylov subspace methodsincomplete LU factorizationsaddle-point problems
Related Items (3)
Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs ⋮ HILUCSI ⋮ Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
This page was built for publication: HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from PDEs