Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
From MaRDI portal
Recommendations
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
- An Unsymmetrized Multifrontal LU Factorization
Cited in
(11)- Mixed and componentwise condition numbers for matrix decompositions
- A survey of direct methods for sparse linear systems
- An Unsymmetrized Multifrontal LU Factorization
- scientific article; zbMATH DE number 741175 (Why is no real title available?)
- On the finite volume reformulation of the mixed finite element method for elliptic and parabolic PDE on triangles.
- A shared- and distributed-memory parallel general sparse direct solver
- Parallel Symbolic Factorization for Sparse LU with Static Pivoting
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
- The Factorization of Sparse Symmetric Indefinite Matrices
This page was built for publication: Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785789)