Stability and Fast Algorithms of Incomplete LU Factorization with Zero‐Fill for Nine‐Diagonal Matrices

DOI10.1137/040608702zbMATH Open1144.65022OpenAlexW1984030833MaRDI QIDQ5301190FDOQ5301190

Authors:

Publication date: 29 April 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040608702

Recommendations

• EFFICIENT SEMI-IMPLICIT SOLVING ALGORITHM FOR NINE-DIAGONAL COEFFICIENT MATRIX
• A Stable Method for the $LU$ Factorization of M-Matrices
• On the Stability of Relaxed Incomplete Lu Factorizations
• An optimal incomplete factorization method for Stieltjes matrices
• A Stability Analysis of Incomplete LU Factorizations
• Stability of block LU factorization for block tridiagonal matrices
• A new stabilization strategy for incomplete LU preconditioning of indefinite matrices
• Stability of the matrix factorization for solving block tridiagonal symmetric indefinite linear systems
• Bounds for elements of LU factorizations of sparse matrices and their application to incomplete factorization methods
• On the stability of the incomplete LU-factorizations and characterizations of \(H\)-matrices

zbMATH Keywords

fast algorithmstabilityincomplete LU factorizationspecial nine-diagonal matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Cited In (3)

• Title not available (Why is that?)
• Analysis of incomplete factorizations for a nine-point approximation to a convection-diffusion model problem
• Stability and spectral properties of incomplete factorization

This page was built for publication: Stability and Fast Algorithms of Incomplete LU Factorization with Zero‐Fill for Nine‐Diagonal Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301190)