Efficient reduction algorithms for bordered band matrices

DOI10.1002/nla.1680020204zbMath0839.65051OpenAlexW2121465525MaRDI QIDQ4850229

Haesun Park, Sabine Van Huffel

Publication date: 9 October 1995

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1680020204

zbMATH Keywords

sparse matricesreduction algorithmsband matrixplane rotationsbordered band matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items (3)

LINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS IN ARROWHEAD FORM ⋮ A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form ⋮ An efficient method for computing the inverse of arrowhead matrices

Uses Software

• LINPACK
• VanHuffel

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient reduction algorithms for bordered band matrices