Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)

Cites Work

\textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
The university of Florida sparse matrix collection
A fully asynchronous multifrontal solver using distributed dynamic scheduling
Preconditioning techniques for large linear systems: A survey
Benchmarking optimization software with performance profiles.
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
On algorithms for permuting large entries to the diagonal of a sparse matrix
Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
The block conjugate gradient algorithm and related methods
Row Projection Methods for Large Nonsymmetric Linear Systems
Solving linear least squares problems by Gram-Schmidt orthogonalization
Splitting dense columns in sparse linear systems
Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
Improved Error Bounds for Underdetermined System Solvers
Detecting ``dense columns in interior point methods for linear programs
A Block Projection Method for Sparse Matrices
On the augmented system approach to sparse least-squares problems
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm
Block Lanczos Techniques for Accelerating the Block Cimmino Method
Partitioning strategies for the block Cimmino algorithm
The Augmented Block Cimmino Distributed Method
Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
Solution of sparse linear least squares problems using Givens rotations
A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
Splitting dense columns of constraint matrix in interior point methods for large scale linear programming¹¹The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:²²A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
A projection method of the Cimmino type for linear algebraic systems
Matrix stretching for sparse least squares problems
A breakdown of the block CG method
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
A breakdown-free block conjugate gradient method
Sparse Approximations of the Schur Complement for Parallel Algebraic Hybrid Solvers in 3<em>D</em>
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)

Uses Software

BoomerAMG
HSL
hypre
MUMPS
METIS
SparseMatrix

This page was built for publication: Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889340)