Partial Elimination
From MaRDI portal
Cited in
(14)- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Numerical linear algebra algorithms and software
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- The solution of sparse linear equations by the conjugate gradient method
- Accelerated simultaneous iterations for large finite element eigenproblems
- The conjugate gradient method for queueing networks
- Experimental study of ILU preconditioners for indefinite matrices
- Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES
- A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer
- Preconditioning methods for very ill-conditioned three-dimensional linear elasticity problems
- MPI+OpenMP parallel implementation of conjugate gradient method with factored implicit preconditioners
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
This page was built for publication: Partial Elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4144106)