Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
From MaRDI portal
Publication:3769846
DOI10.1137/0908072zbMath0632.65021OpenAlexW2028495395MaRDI QIDQ3769846
No author found.
Publication date: 1987
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0908072
sparse matrix algorithmsGaussian elimination with partial pivotingsymbolic factorizationlarge sparse nonsingular system
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (11)
The column-updating method for solving nonlinear equations in Hilbert space ⋮ An extension of the theory of secant preconditioners ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗ ⋮ A survey of direct methods for sparse linear systems ⋮ Combinatorial Aspects in Sparse Elimination Methods ⋮ Mixed and componentwise condition numbers for matrix decompositions ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ Predicting the structure of sparse orthogonal factors
This page was built for publication: Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
