Efficient reduction algorithms for bordered band matrices

DOI10.1002/NLA.1680020204MaRDI QIDQ4850229zbMATH OpenOpenAlexFDO

Authors 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

band matrixbordered band matricesplane rotationsreduction algorithmssparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 1330401
• Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
• O( n^2 ) Reduction Algorithms for the Construction of a Band Matrix from Spectral Data
• Parallel reduction of banded matrices to bidiagonal form

Cited in

(4)

• An efficient method for computing the inverse of arrowhead matrices
• Bandwidth reduction of rectangular matrices
• A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
• Linear systems of differential equations in arrowhead form

Describes a project that uses

Uses Software

• LINPACK
• VanHuffel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850229)