A new folding gaussian elimination algorithm for general linear systems
From MaRDI portal
Publication:3200463
Recommendations
Cites work
- scientific article; zbMATH DE number 43693 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3198397 (Why is no real title available?)
- A Parallel Method for Tridiagonal Equations
- A parallel linear system solver
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- Systolic lu-factorization “dequeues” for trldiagonal systems
- The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
Cited in
(6)- A parallel elimination algorithm for the solution of dense linear systems
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
- An efficient algorithm for the generalized Foldy-Lax formulation
- A parallel gaussian elimination method for general linear systems
- Z-folding and its applications
- Gaussian elimination is optimal for solving linear equations in dimension two
This page was built for publication: A new folding gaussian elimination algorithm for general linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200463)