Partitioning strategies for the block Cimmino algorithm
From MaRDI portal
Publication:525251
DOI10.1007/s10665-014-9699-0zbMath1360.65100OpenAlexW2000895477MaRDI QIDQ525251
Publication date: 28 April 2017
Published in: Journal of Engineering Mathematics (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/manifestation/12369973/RAL-P-2014-005.pdf
Computational methods for sparse matrices (65F50) Hypergraphs (05C65) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Linear equations (linear algebraic aspects) (15A06)
Related Items
Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement ⋮ A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm ⋮ The Reflection Method for the Numerical Solution of Linear Systems ⋮ Randomized Extended Average Block Kaczmarz for Solving Least Squares ⋮ The Augmented Block Cimmino Distributed Method ⋮ Extensions of the Augmented Block Cimmino Method to the Solution of Full Rank Rectangular Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Block-iterative methods for consistent and inconsistent linear equations
- A projection method for solving nonsymmetric linear systems on multiprocessors
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- The university of Florida sparse matrix collection
- Stopping Criteria for Iterative Solvers
- A Block Projection Method for Sparse Matrices
- Row Projection Methods for Large Nonsymmetric Linear Systems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Numerical Methods for Computing Angles Between Linear Subspaces
- Block Lanczos Techniques for Accelerating the Block Cimmino Method
- The Augmented Block Cimmino Distributed Method
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
