Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices

DOI10.1137/050636280zbMath1116.65035OpenAlexW2147208354WikidataQ114074396 ScholiaQ114074396MaRDI QIDQ3435012

Haw-Ren Fang, Dianne P. O'Leary

Publication date: 3 May 2007

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

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

zbMATH Keywords

numerical stabilitytridiagonal matricespivotingCholesky decompositionmatrix factorizationstriadic matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (5)

A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges ⋮ Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method ⋮ Modified Cholesky algorithms: A catalog with new approaches ⋮ Characterizations of inverse \(M\)-matrices with special zero patterns ⋮ The complete positivity of symmetric tridiagonal and pentadiagonal matrices

Uses Software

• mctoolbox

This page was built for publication: Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices