Factoring Symmetric Indefinite Matrices on High-Performance Architectures

DOI10.1137/S089547989018008XMaRDI QIDQ4287909zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1137/S089547989018008X

zbMATH Keywords

block algorithmhigh-performance architecturematrix factorizationnumerical examplessymmetric indefinite matrices

Mathematics Subject Classification ID

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

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

(7)

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

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)