A Direct Projection Method for Sparse Linear Systems
From MaRDI portal
Recommendations
Cited in
(20)- Block SOR methods for rank-deficient least-squares problems
- Iterative refinement using splitting methods
- A direct projection method for Markov chains
- Purcell's method, projective n-space, and a parallelizable, sparse linear equation solver
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes
- Symmetric block-SOR methods for rank-deficient least squares problems
- The direct-projection methods
- Direct Methods for Sparse Linear Systems
- A note on direct methods for approximations of sparse Hessian matrices
- An algorithm for solving certain large scale sparse linear systems
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- The block Kaczmarz algorithm based on solving linear systems with arrowhead matrices
- A survey of direct methods for sparse linear systems
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- A multigrid reduction framework for domains with symmetries
- A surrogate hyperplane Kaczmarz method with oblique projection for solving linear systems
- Nesting approximate inverses for improved preconditioning and algebraic multigrid smoothing
- Finding the orthogonal projection of a point onto an affine subspace
This page was built for publication: A Direct Projection Method for Sparse Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852598)