Pages that link to "Item:Q3685075"
From MaRDI portal
The following pages link to An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems (Q3685075):
Displaying 17 items.
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
- Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations (Q1075739) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms (Q1102707) (← links)
- Evaluation of the efficiency of the partially solving method (PSM) in comparison with the Gaussian elimination method (Q1275852) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Sparse Gaussian Elimination Modulo p: An Update (Q2829994) (← links)
- State-of-the-Art Sparse Direct Solvers (Q3300486) (← links)
- Combinatorial Aspects in Sparse Elimination Methods (Q3603887) (← links)
- (Q3685074) (← links)
- The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination (Q3796623) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- Cost-optimal Gaussian Elimination Algorithm on RCC-FULL (Q4820801) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
