A new class of decomposition for inverting asymmetric and indefinite matrices
From MaRDI portal
Publication:2365944
DOI10.1016/0898-1221(93)90252-QzbMath0776.65021OpenAlexW1994538962MaRDI QIDQ2365944
Publication date: 29 June 1993
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(93)90252-q
Related Items
A sparsity for decomposing a symmetric matrix ⋮ Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix ⋮ ILU preconditioning based on the FAPINV algorithm ⋮ Different versions of ILU and IUL factorizations obtained from forward and backward factored approximate inverse processes. I ⋮ A proof in favor of block-based procedure ⋮ On the relation between the AINV and the FAPINV algorithms ⋮ Finite differences and collocation methods for the solution of the two-dimensional heat equation ⋮ Parallel implementation of a high-order implicit collocation method for the heat equation ⋮ A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices ⋮ An optimum partition for inverting a nonsingular matrix ⋮ Multigrid treatment and robustness enhancement for factored sparse approximate inverse preconditioning
Cites Work
