A new folding gaussian elimination algorithm for general linear systems

DOI10.1080/00207169008803925zbMath0714.65028OpenAlexW2071580409MaRDI QIDQ3200463

M. 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

zbMATH Keywords

consistencyefficiencyGaussian eliminationparallel implementationspeedupbanded systemsfolding algorithmsimilar transformationsfull general coefficient matrix

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

A parallel gaussian elimination method for general linear systems ⋮ A parallel elimination algorithm for the solution of dense linear systems

Cites Work

• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Systolic lu-factorization “dequeues” for trldiagonal systems
• A parallel linear system solver
• A Parallel Method for Tridiagonal Equations
• The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new folding gaussian elimination algorithm for general linear systems