AbstractA generalization of tridiagonal matrices is considered, namely treediagonal matrices, which have nonzero off-diagonal elements only in positions where the adjacency matrix of a tree has nonzero elements. Some properties of treediagonal matrices are given, and their inverses are characterized and shown to have an interesting structure
AbstractIn this paper, explicit formulae for the elements of the inverse of a general tridiagonal ma...
Recently some generalizations of Sylvester type tridiagonal matrices have been considered with their...
AbstractWe establish upper and lower bounds for the entries of the inverses of diagonally dominant t...
AbstractA generalization of tridiagonal matrices is considered, namely treediagonal matrices, which ...
AbstractTridiagonal or Jacobi matrices arise in many diverse branches of mathematics and have been s...
AbstractDiscretizations in various types of problems lead to quasi-tridiagonal matrices. In this pap...
AbstractIn this paper, we obtain lower and upper bounds for the entries of the inverses of diagonall...
We give explicit inverses of tridiagonal 2-Toeplitz and 3-Toeplitz matrices which generalize some we...
AbstractIn the current work, the authors present a symbolic algorithm for finding the inverse of any...
In this paper, we consider matrices whose inverses are tridiagonal Z-matrices. Based on a characteri...
AbstractWe give explicit inverses of tridiagonal 2-Toeplitz and 3-Toeplitz matrices which generalize...
Abstract. In this paper some results are reviewed concerning the characterization of inverses of sym...
Using orthogonal polynomials, we give a different approach to some recent results on tridiagonal mat...
AbstractThe lower half of the inverse of a lower Hessenberg matrix is shown to have a simple structu...
AbstractThis paper is concerned with 2n-by-2n tridiagonal matrices with variable diagonal vectors. S...
AbstractIn this paper, explicit formulae for the elements of the inverse of a general tridiagonal ma...
Recently some generalizations of Sylvester type tridiagonal matrices have been considered with their...
AbstractWe establish upper and lower bounds for the entries of the inverses of diagonally dominant t...
AbstractA generalization of tridiagonal matrices is considered, namely treediagonal matrices, which ...
AbstractTridiagonal or Jacobi matrices arise in many diverse branches of mathematics and have been s...
AbstractDiscretizations in various types of problems lead to quasi-tridiagonal matrices. In this pap...
AbstractIn this paper, we obtain lower and upper bounds for the entries of the inverses of diagonall...
We give explicit inverses of tridiagonal 2-Toeplitz and 3-Toeplitz matrices which generalize some we...
AbstractIn the current work, the authors present a symbolic algorithm for finding the inverse of any...
In this paper, we consider matrices whose inverses are tridiagonal Z-matrices. Based on a characteri...
AbstractWe give explicit inverses of tridiagonal 2-Toeplitz and 3-Toeplitz matrices which generalize...
Abstract. In this paper some results are reviewed concerning the characterization of inverses of sym...
Using orthogonal polynomials, we give a different approach to some recent results on tridiagonal mat...
AbstractThe lower half of the inverse of a lower Hessenberg matrix is shown to have a simple structu...
AbstractThis paper is concerned with 2n-by-2n tridiagonal matrices with variable diagonal vectors. S...
AbstractIn this paper, explicit formulae for the elements of the inverse of a general tridiagonal ma...
Recently some generalizations of Sylvester type tridiagonal matrices have been considered with their...
AbstractWe establish upper and lower bounds for the entries of the inverses of diagonally dominant t...
DOI
Add to ORKG