A stable method for the LU factorization of M-matrices
SIAM Journal on Algebraic and Discrete Methods
Topics in matrix analysis
Growth in Gaussian elimination
American Mathematical Monthly
Average-case stability of Gaussian elimination
SIAM Journal on Matrix Analysis and Applications
Exploiting fast matrix multiplication within the level 3 BLAS
ACM Transactions on Mathematical Software (TOMS)
On growth in Gaussian elimination with complete pivoting
SIAM Journal on Matrix Analysis and Applications
Stability of block algorithms with fast level-3 BLAS
ACM Transactions on Mathematical Software (TOMS)
On the perturbation of LU, Cholesky, and QR factorizations
SIAM Journal on Matrix Analysis and Applications
Iterative solution methods
SIAM Journal on Matrix Analysis and Applications
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Perturbation Theory for Factorizations of LU Type through Series Expansions
SIAM Journal on Matrix Analysis and Applications
Stability of block LU factorization for block tridiagonal matrices
Computers & Mathematics with Applications
Hi-index | 7.29 |
By a block representation of LU factorization for a general matrix introduced by Amodio and Mazzia [P. Amodio, F. Mazzia, A new approach to the backward error analysis in the LU factorization algorithm, BIT 39 (1999) 385-402], a block representation of block LU factorization for block tridiagonal block H-matrices is obtained and some properties on the factors of the factorization are presented. Perturbation theory for the block LU factorization of block tridiagonal block H-matrices is also considered. Then a rounding error analysis of the block LU factorization for block tridiagonal block H-matrices is given, and some bounds for the growth factor are proposed. Finally, a numerical example is presented to illustrate our theoretical results.