Results 1 
3 of
3
Stable factorizations of symmetric tridiagonal and triadic matrices
 SIAM J. Matrix Anal. Appl., to Appear
, 2006
"... Abstract. We call a matrix triadic if it has no more than two nonzero offdiagonal elements in any column. A symmetric tridiagonal matrix is a special case. In this paper we consider LXLT factorizations of symmetric triadic matrices, where L is unit lower triangular and X is diagonal, block diagonal ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Abstract. We call a matrix triadic if it has no more than two nonzero offdiagonal elements in any column. A symmetric tridiagonal matrix is a special case. In this paper we consider LXLT factorizations of symmetric triadic matrices, where L is unit lower triangular and X is diagonal, block
BACKWARD ERROR ANALYSIS OF FACTORIZATION ALGORITHMS FOR SYMMETRIC AND SYMMETRIC TRIADIC MATRICES
"... We consider the LBLT factorization of a symmetric matrix where L is unit lower triangular and B is block diagonal with diagonal blocks of order 1 or 2. This is a generalization of the Cholesky factorization, and pivoting is incorporated for stability. However, the reliability of the BunchKaufman p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of symmetric indenite matrices by LBLT factorization incorporated with the BunchParlett pivoting strategy, generalizing results of Higham for the symmetric semidenite case. We call a matrix triadic if it has no more than two nonzero odiagonal elements in any column. A symmetric tridiagonal matrix is a
MATRIX FACTORIZATIONS, TRIADIC MATRICES, AND MODIFIED CHOLESKY FACTORIZATIONS FOR OPTIMIZATION
, 2006
"... This thesis focuses on the Choleskyrelated factorizations of symmetric matrices and their application to Newtontype optimization. A matrix is called triadic if it has at most two nonzero offdiagonal elements in each column. Tridiagonal matrices are a special case of these. We prove that the triad ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This thesis focuses on the Choleskyrelated factorizations of symmetric matrices and their application to Newtontype optimization. A matrix is called triadic if it has at most two nonzero offdiagonal elements in each column. Tridiagonal matrices are a special case of these. We prove