Factoring Symmetric Indefinite Matrices on High-Performance Architectures

DOI10.1137/S089547989018008XzbMATH Open0802.65023MaRDI QIDQ4287909FDOQ4287909

Authors Mark Jones, Merrell L. Patrick

Publication date 9 May 1994

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

matrix factorizationnumerical examplessymmetric indefinite matricesblock algorithmhigh-performance architecture

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Bunch–Kaufman Factorization for Real Symmetric Indefinite Banded Matrices
• An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
• The Antitriangular Factorization of Symmetric Matrices
• Communication-avoiding symmetric-indefinite factorization

Cited in

(6)

• Partial factorization of a dense symmetric indefinite matrix
• Communication-avoiding symmetric-indefinite factorization
• On the growth factor upper bound for Aasen's algorithm
• An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
• Symmetric elimination without pivoting
• The retraction algorithm for factoring banded symmetric matrices

Describes a project that uses

Uses Software

• LAPACK
• BLAS

This page was built for publication: Factoring Symmetric Indefinite Matrices on High-Performance Architectures

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