Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
From MaRDI portal
Recommendations
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Parallel sparse Gaussian elimination with partial pivoting
- A column approximate minimum degree ordering algorithm
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
Cited in
(38)- Fraction free Gaussian elimination for sparse matrices
- A survey of direct methods for sparse linear systems
- scientific article; zbMATH DE number 4139186 (Why is no real title available?)
- Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
- Factoring matrices with a tree-structured sparsity pattern
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Incremental incomplete LU factorizations with applications
- An improved bordered block diagnal method for solving large scale sparse linear equations in circuit simulation
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Sparse Gaussian Elimination Modulo p: An Update
- Novel update techniques for the revised simplex method
- Computing row and column counts for sparse QR and LU factorization
- Recognizing sparse perfect elimination bipartite graphs
- General Sparse Elimination Requires No Permanent Integer Storage
- Reverse-safe text indexing
- On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
- Parallel sparse Gaussian elimination with partial pivoting
- The positive edge pricing rule for the dual simplex
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Design and implementation of a parallel Markowitz threshold algorithm
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- scientific article; zbMATH DE number 2098239 (Why is no real title available?)
- Differentiation-based and integration-based Chebyshev methods for resolvent analysis of channel flow
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- Hyper-sparsity in the revised simplex method and how to exploit it
- Matrix enlarging methods and their application
- Constructing elimination trees for sparse unsymmetric matrices
- scientific article; zbMATH DE number 3883496 (Why is no real title available?)
- Sparse matrix methods for circuit simulation problems
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Communication Avoiding ILU0 Preconditioner
- Combinatorial Aspects in Sparse Elimination Methods
This page was built for publication: Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804073)
