Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
DOI10.1137/0908072zbMATH Open0632.65021OpenAlexW2028495395MaRDI QIDQ3769846FDOQ3769846
Authors:
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
Recommendations
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Parallel sparse Gaussian elimination with partial pivoting
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
sparse matrix algorithmsGaussian elimination with partial pivotingsymbolic factorizationlarge sparse nonsingular system
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23)
Cited In (22)
- Fraction free Gaussian elimination for sparse matrices
- Practical quasi-Newton methods for solving nonlinear systems
- A survey of direct methods for sparse linear systems
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- Title not available (Why is that?)
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- The column-updating method for solving nonlinear equations in Hilbert space
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
- Sparse Gaussian Elimination Modulo p: An Update
- An extension of the theory of secant preconditioners
- On the row merge tree for sparse LU factorization with partial pivoting
- General Sparse Elimination Requires No Permanent Integer Storage
- Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
- Predicting the structure of sparse orthogonal factors
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Parallel sparse Gaussian elimination with partial pivoting
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- Mixed and componentwise condition numbers for matrix decompositions
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- Combinatorial Aspects in Sparse Elimination Methods
This page was built for publication: Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769846)
