An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices

DOI10.1016/j.cam.2014.07.003zbMath1296.65047OpenAlexW2088029986MaRDI QIDQ399074

I. Fernández de Bustos, R. Ansola, Josu Agirrebeitia, Goizalde Ajuria

Publication date: 19 August 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.07.003

zbMATH Keywords

Gaussian eliminationbackward error analysismatrix factorizationBunch-Kaufman methodBunch-Parlett methodsymmetric indefinite matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Add-sub pivoting triangular factorization for symmetric matrix

Uses Software

• mctoolbox
• MersenneTwister

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Growth-Factor Bound for the Bunch-Kaufman Factorization Is Tight
• Stability of the Diagonal Pivoting Method with Partial Pivoting
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Mersenne twister
• Accurate Symmetric Indefinite Linear Equation Solvers
• Stability of block algorithms with fast level-3 BLAS
• Stability of block LU factorization
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations