AbstractBy 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 r...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
SIGLEAvailable from British Library Document Supply Centre-DSC:6184.6725(308) / BLDSC - British Libr...
Block algorithms are becoming increasingly popular in matrix computations. Since their basic unit of...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...
AbstractIt is showed that if A is I-block diagonally dominant (II-block diagonally dominant), then t...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
A block representation of the BLU factorization for block tridiagonal matrices is presented. Some pr...
Many of the currently popular 'block algorithms' are scalar algorithms in which the operations have ...
AbstractAn LU-type factorization theorem due to Elsner and to Gohberg and Goldberg is generalized to...
An investigation is made of the stability of block LU-decomposition of matrices A arising from bound...
A new backward error analysis of LU factorization is presented. It allows do obtain a sharper up...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractWe present a necessary and sufficient condition for M-matrices in terms of a special diagona...
AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a ...
AbstractIn this note we show that an asymptotically fast algorithm may be designed in order to reali...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
SIGLEAvailable from British Library Document Supply Centre-DSC:6184.6725(308) / BLDSC - British Libr...
Block algorithms are becoming increasingly popular in matrix computations. Since their basic unit of...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...
AbstractIt is showed that if A is I-block diagonally dominant (II-block diagonally dominant), then t...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
A block representation of the BLU factorization for block tridiagonal matrices is presented. Some pr...
Many of the currently popular 'block algorithms' are scalar algorithms in which the operations have ...
AbstractAn LU-type factorization theorem due to Elsner and to Gohberg and Goldberg is generalized to...
An investigation is made of the stability of block LU-decomposition of matrices A arising from bound...
A new backward error analysis of LU factorization is presented. It allows do obtain a sharper up...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractWe present a necessary and sufficient condition for M-matrices in terms of a special diagona...
AbstractWe propose new parallelizable block ILU (incomplete LU) factorization preconditioners for a ...
AbstractIn this note we show that an asymptotically fast algorithm may be designed in order to reali...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
SIGLEAvailable from British Library Document Supply Centre-DSC:6184.6725(308) / BLDSC - British Libr...
Block algorithms are becoming increasingly popular in matrix computations. Since their basic unit of...