An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
From MaRDI portal
Publication:4528036
Recommendations
- Parallel Gauss-Jordan elimination for the solution of dense linear systems
- Fast and efficient parallel solution of dense linear systems
- Systolic Gauss-Jordan elimination for dense linear systems
- A new Gaussian elimination-based algorithm for parallel solution of linear equations
- A parallel elimination algorithm for the solution of dense linear systems
- A parallel gaussian elimination method for general linear systems
- scientific article; zbMATH DE number 4139185
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- scientific article; zbMATH DE number 554772
- A parallel algorithm for direct solution of large sparse linear systems, well suitable to domain decomposition methods
Cites work
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- An extension of Purcell's vector method with applications to panel element equations
- BSP linear solvers for dense matrices
- Matrix computation and the theory of moments
- Parallel Gauss-Jordan elimination for the solution of dense linear systems
- Parallel algorithms for solving large linear systems
- Rehabilitation of the Gauss-Jordan algorithm
- The Vector Method of Solving Simultaneous Linear Equations
Cited in
(5)- scientific article; zbMATH DE number 762225 (Why is no real title available?)
- Parallel algorithms of the Purcell method for direct solution of linear systems
- Purcell's method, Egerváry and related results
- Rehabilitation of the Gauss-Jordan algorithm
- Parallel solution of dense linear systems using diagonalization methods
This page was built for publication: An efficient variant of gauss-jordan type algorithms for direct and parallel solution of dense linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528036)