Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting

DOI10.1137/0908072MaRDI QIDQ3769846zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Gaussian elimination with partial pivotinglarge sparse nonsingular systemsparse matrix algorithmssymbolic factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

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

Cited in

(25)

• Predicting the structure of sparse orthogonal factors
• Practical quasi-Newton methods for solving nonlinear systems
• An extension of the theory of secant preconditioners
• Fraction free Gaussian elimination for sparse matrices
• Sparse Gaussian Elimination Modulo p: An Update
• Combinatorial Aspects in Sparse Elimination Methods
• Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
• General Sparse Elimination Requires No Permanent Integer Storage
• A Data Structure for Sparse QR and LU Factorizations
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
• The column-updating method for solving nonlinear equations in Hilbert space
• An Approximate Probabilistic Model for Structured Gaussian Elimination
• scientific article; zbMATH DE number 554767 (Why is no real title available?)
• Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗
• scientific article; zbMATH DE number 1163753 (Why is no real title available?)
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
• A survey of direct methods for sparse linear systems
• Mixed and componentwise condition numbers for matrix decompositions
• Computing row and column counts for sparse QR and LU factorization
• Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
• Parallel sparse Gaussian elimination with partial pivoting
• On the row merge tree for sparse LU factorization with partial pivoting

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)