A new folding gaussian elimination algorithm for general linear systems
DOI10.1080/00207169008803925zbMATH Open0714.65028OpenAlexW2071580409MaRDI QIDQ3200463FDOQ3200463
Authors: Man M. Chawla 
Publication date: 1990
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803925
Recommendations
consistencyGaussian eliminationefficiencyparallel implementationspeedupbanded systemsfolding algorithmsimilar transformationsfull general coefficient matrix
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Title not available (Why is that?)
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parallel linear system solver
- The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
- A Parallel Method for Tridiagonal Equations
- Systolic lu-factorization “dequeues” for trldiagonal systems
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)
