Robust incomplete factorization for nonsymmetric matrices
From MaRDI portal
Publication:543347
DOI10.1007/S00211-010-0336-1zbMATH Open1218.65033OpenAlexW2152252020MaRDI QIDQ543347FDOQ543347
Authors: Matthias Bollhöfer, Amin Rafiei 
Publication date: 17 June 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-010-0336-1
Recommendations
- New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- Balanced Incomplete Factorization
- Balanced incomplete factorization preconditioner with pivoting
Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
- ILUT: A dual threshold incomplete LU factorization
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Relations between ILUs and Factored Approximate Inverses
- A robust incomplete factorization preconditioner for positive definite matrices
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- Crout Versions of ILU for General Sparse Matrices
- An Estimate for the Condition Number of a Matrix
- Robust approximate inverse preconditioning for the conjugate gradient method
- New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- Title not available (Why is that?)
- Robust incomplete factorization for nonsymmetric matrices
Cited In (9)
- Robust incomplete factorization for nonsymmetric matrices
- Complete pivoting strategy for the left-looking robust incomplete factorization preconditioner
- A block version of left-looking AINV preconditioner with one by one or two by two block pivots
- Left-looking version of AINV preconditioner with complete pivoting strategy
- Balanced incomplete factorization preconditioner with pivoting
- On the robustness of modified incomplete factorization methods
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- An Analysis of the Robustness of Some Incomplete Factorizations
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Uses Software
This page was built for publication: Robust incomplete factorization for nonsymmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543347)
