AbstractThe forward stability of the block cyclic reduction without back substitution for block tridiagonal systems is studied. The basic assumption is that the matrix of the system is block column diagonally dominant. Then it is shown that for nonstrictly diagonally dominant matrices the forward error is O(Cnn2log2 nκϱ0), and for strictly diagonally dominant matrices it is O(Cng(s) log2 nκϱ0), where n is the block size of the matrix, N is the size of each block, g(s) is a function which measures the diagonal dominance, κ is a condition number, and ϱ0 is the machine roundoff unit. At the end some numerical evidence is presented
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
We discuss the method of Cyclic Reduction for solving special systems of linear equations that arise...
Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Sign...
AbstractThe forward stability of the block cyclic reduction without back substitution for block trid...
Tridiagonal systems play a fundamental role in matrix computation. In particular, in recent years pa...
The ScaLAPACK library contains a pair of routines for solving banded linear systems which are strict...
AbstractIt is showed that if A is I-block diagonally dominant (II-block diagonally dominant), then t...
It was recently observed that the singular values of the off-diagonal blocks of the matrix sequences...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with m×m quasis...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with . m×m quas...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with $m\times ...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
We discuss the method of Cyclic Reduction for solving special systems of linear equations that arise...
Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Sign...
AbstractThe forward stability of the block cyclic reduction without back substitution for block trid...
Tridiagonal systems play a fundamental role in matrix computation. In particular, in recent years pa...
The ScaLAPACK library contains a pair of routines for solving banded linear systems which are strict...
AbstractIt is showed that if A is I-block diagonally dominant (II-block diagonally dominant), then t...
It was recently observed that the singular values of the off-diagonal blocks of the matrix sequences...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with m×m quasis...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with . m×m quas...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with $m\times ...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
We discuss the method of Cyclic Reduction for solving special systems of linear equations that arise...
Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Sign...