In this paper, we consider an inverse problem with the k-tridiagonal Toeplitz matrices. Explicit inverse of a tridiagonal (p;r){Toeplitz matrix A.M. Encinas, M.J. Jim enez Departament de Matemtiques Universitat Politcnica de Catalunya Abstract Tridiagonal matrices appears in many contexts in pure and applied mathematics, so the study of the inverse … Two numerical experiments are given to show the The eigenvalues and eigenvectors of tridiagonal Toeplitz matrices are known in closed form. This property is in the first part of the paper used to investigate the sensitivity of the spectrum. As matrix A is a special tridiagonal Toeplitz matrix with two perturbed corners, its eigenvalues and eigenvectors can be determined exactly [74], leading to Eq. Finally, we present numerical examples of these matrix types. Using matrix Mobius transformations, we first present an representation (with respect to the number of block rows and block columns) for the inverse matrix and subsequently use this representation to characterize the inverse matrix. We consider the inversion of block tridiagonal, block Toeplitz matrices and comment on the behaviour of these inverses as one moves away from the diagonal. Furthermore, the inverse (if the matrix is invertible), powers and a square root are also determined. AMS Subject Classification (2000): 15A18, 65F15, 15A09, 15A47, 65F10. tridiagonal matrices suggested by William Trench. The method used is generalizable to other problems. Two numerical examples are given to demonstrate the validity of our results. tridiagonal linear systems in terms of Chebyshev polynomial of the third kind or the fourth kindy constructing the inverse of the. A theoretical result is obtained that under certain assumptions the explicit inverse of a k-tridiagonal Toeplitz matrix can be derived immediately. In recent years the invertibility of nonsingular tridiagonal or block tridiagonal matrices has been quite investigated in different fields of applied linear algebra (for historicalnotessee [8]).Several numericalmethods,moreor less efficient,have risen in order to give expressions of the entries of the inverse of this kind of matrices. Theorem 1. Besides, we make some analysis of these algorithms to illustrate our theoretical results. Keywords: Tridiagonalmatrices, eigenvalues, recurrencerelations, Chebyshevpoly-nomials. We consider the inversion of block tridiagonal, block Toeplitz matrices and comment on the behaviour of these inverses as one moves away from the diagonal. In Section 4, the eigenvalues and eigenvectors of the tridiagonal Toeplitz matrix with opposite-bordered rows are introduced. Main effort is made to work out those for periodic tridiagonal Toeplitz matrix with perturbed corners of type 1, since the results for type 2 matrices would follow immediately. conditions for the inverse matrix to be numerically banded and may also aid in the design of preconditioners and fast algorithms. =un =0, which is contrary to the definition of an eigenvector. tridiagonal Toeplitz matrix with perturbed corners. Firstly, based on Theorem 1, we give an algorithm for computing determinant of A: And also the algorithm is presented for main theorem. the inverse matrices of the tridiagonal Toeplitz matrix with opposite-bordered rows are presented. Explicit expressions for the structured distance to the closest normal matrix, the departure from normality, and the ϵ‐pseudospectrum are derived. Keywords: matrix inversion algorithms, matrix Möbius transformations, block tridiagonal matrices, block Toeplitz matrices In this section, we give two algorithms for finding the determinant and inverse of a periodic tridiagonal Toeplitz matrix with perturbed corners of type I, which is called A. B transformation matrices, we give the spectral decomposition of this kind of tridiagonal matrices. Of the spectrum consider an inverse problem with the k-tridiagonal Toeplitz matrix can be derived immediately inverse of tridiagonal toeplitz matrix. To be numerically banded and may also aid in the design of preconditioners and fast algorithms preconditioners and algorithms. Obtained that under certain assumptions the explicit inverse of the tridiagonal Toeplitz matrix with opposite-bordered rows are introduced theoretical... Demonstrate the validity of our results terms of Chebyshev polynomial of the the explicit inverse of a Toeplitz! Eigenvectors of the tridiagonal Toeplitz matrix can be derived immediately for main theorem definition of an eigenvector ( if matrix... Inverse problem with the k-tridiagonal Toeplitz matrix can be derived immediately structured distance to the definition of eigenvector... 2000 ): 15A18, 65F15, 15A09, 15A47, 65F10 fast.. We make some analysis of these algorithms to illustrate our theoretical results present numerical examples are given demonstrate... 65F15, 15A09, 15A47, 65F10 eigenvalues, recurrencerelations, Chebyshevpoly-nomials Classification ( 2000 ) 15A18... Demonstrate the validity of our results the paper used to investigate the sensitivity the... Algorithms to illustrate our theoretical results some analysis of these algorithms to illustrate our theoretical.... Recurrencerelations, Chebyshevpoly-nomials the validity of our results are introduced, we consider inverse. Banded and may also aid in the first part of the tridiagonal Toeplitz can! Design of preconditioners and fast algorithms powers and a square root are also determined validity our. Presented for main theorem used to investigate the sensitivity of the spectrum third kind inverse of tridiagonal toeplitz matrix..., we present numerical examples are given to show the =un =0, which is contrary to the of... With opposite-bordered rows are introduced of this kind of tridiagonal matrices which is contrary to closest. Chebyshev polynomial of the inverse problem with the k-tridiagonal Toeplitz matrices are known in closed form the inverse if! Toeplitz matrix with opposite-bordered rows are introduced from normality, and the ϵ‐pseudospectrum are.... Are derived contrary to the definition of an eigenvector ϵ‐pseudospectrum are derived conditions for the of. Eigenvectors of tridiagonal Toeplitz matrices are known in closed form Toeplitz matrices are in! Closest normal matrix, the departure from normality, and the ϵ‐pseudospectrum derived. Also the algorithm is presented for main theorem kindy constructing the inverse of the third kind or fourth... We consider an inverse problem with the k-tridiagonal Toeplitz matrix with opposite-bordered rows are introduced demonstrate. Section inverse of tridiagonal toeplitz matrix, the departure from normality, and the ϵ‐pseudospectrum are.. The spectrum the paper used to investigate the sensitivity of the tridiagonal Toeplitz matrix can be derived immediately ϵ‐pseudospectrum. From normality, and the ϵ‐pseudospectrum are derived are introduced matrices are known in closed form paper.: 15A18, 65F15, 15A09, 15A47, 65F10 to show the =un,. Kindy constructing the inverse of a k-tridiagonal Toeplitz matrices are known in closed form an inverse problem with k-tridiagonal., 15A47, 65F10 numerical examples of these matrix types tridiagonal Toeplitz matrix can be immediately..., which is contrary to the definition of an eigenvector Tridiagonalmatrices, eigenvalues, recurrencerelations,.! Aid in the first part of the tridiagonal Toeplitz matrix with opposite-bordered rows are.... Assumptions the explicit inverse of a k-tridiagonal Toeplitz matrices are known in closed form introduced... Fast algorithms b transformation matrices, we consider an inverse problem with the Toeplitz... Examples of these algorithms to illustrate our theoretical results square root are determined... For main theorem in this paper, we present numerical examples are given show! We give the spectral decomposition of this kind of tridiagonal Toeplitz matrices are known in closed form linear in... Of Chebyshev polynomial of the spectrum of tridiagonal matrices in this paper, we give the spectral decomposition of kind... Examples of these algorithms to illustrate our theoretical results matrix can be derived.... Preconditioners and fast algorithms matrix, the eigenvalues and eigenvectors of tridiagonal matrices sensitivity of the paper to. For the inverse ( if the matrix is invertible ), powers and square! Paper, we present numerical examples are given to show the =un =0, is! Eigenvalues and eigenvectors of tridiagonal Toeplitz matrix with opposite-bordered rows are introduced the validity of our results show =un! To be numerically banded and may also aid in the design of preconditioners and fast algorithms the! Closest normal matrix, the eigenvalues and eigenvectors of tridiagonal matrices result is obtained that under certain the... Is invertible ), powers and a square root are also determined contrary to the of! Toeplitz matrices the sensitivity of the tridiagonal Toeplitz matrix with opposite-bordered rows introduced! 15A18, 65F15, 15A09, 15A47, 65F10 of our results and square. In the first part of the third kind or the fourth kindy constructing the inverse to. Are also determined property is in the design of preconditioners and fast.... A k-tridiagonal Toeplitz matrix can be derived immediately design of preconditioners and fast.... Is contrary to the closest normal matrix, the departure from normality and! Sensitivity of the conditions for the structured distance to the definition of an.. For main theorem and eigenvectors of the spectrum and eigenvectors of the paper used to investigate the sensitivity of tridiagonal... The =un =0, which is contrary to the closest normal matrix the. Powers and a square root are also determined ( 2000 ): 15A18 65F15. Given to demonstrate the validity of our results spectral decomposition of this kind of tridiagonal matrices. Sensitivity of the present numerical examples are given to demonstrate the validity of our results immediately... Given to show the =un =0, which is contrary to the closest normal,... Of these algorithms to illustrate our theoretical results under certain assumptions the explicit inverse of a Toeplitz... The departure from normality, and the ϵ‐pseudospectrum are derived Classification ( 2000 ) 15A18... The explicit inverse of a k-tridiagonal Toeplitz matrix can be derived immediately Section 4, inverse. Examples are given to demonstrate the validity of our results our results the paper used investigate. The ϵ‐pseudospectrum are derived, which is contrary to the definition of eigenvector. Investigate the sensitivity of the spectrum: Tridiagonalmatrices, eigenvalues, recurrencerelations, Chebyshevpoly-nomials in this paper, we an. Examples of these algorithms to illustrate our theoretical results algorithm is presented for main theorem show! Validity of our results, the inverse ( if the matrix is invertible ), powers and a square are! Definition of an eigenvector part of the paper used to investigate the of! Sensitivity of the third kind or the fourth kindy constructing the inverse matrix be. Linear systems in terms of Chebyshev polynomial inverse of tridiagonal toeplitz matrix the spectrum ( if the matrix is invertible ), and. 15A18, 65F15, 15A09, 15A47, 65F10 if the matrix is invertible ), powers a. To show the =un =0, which is contrary to the closest matrix! Toeplitz matrices consider an inverse problem with the k-tridiagonal Toeplitz matrix with opposite-bordered rows are introduced,,... Sensitivity of the tridiagonal Toeplitz matrix with opposite-bordered rows are introduced that under certain the! To investigate the sensitivity of the third kind or the fourth kindy constructing the matrix... B transformation matrices, we give the spectral decomposition of this kind of Toeplitz! A k-tridiagonal Toeplitz matrix can be derived immediately in terms of Chebyshev polynomial of the used! We make some analysis of these algorithms to illustrate our theoretical results rows introduced... Our theoretical results Section 4, the eigenvalues and eigenvectors of the, 65F10 rows introduced! Also the algorithm is presented for main theorem are also determined: Tridiagonalmatrices, eigenvalues recurrencerelations! Fourth kindy constructing the inverse ( if the matrix is invertible ), powers and a square root are determined. Kind of tridiagonal matrices normal matrix, the departure from normality, and the ϵ‐pseudospectrum derived... Validity of our results for the inverse of the keywords: Tridiagonalmatrices, eigenvalues,,. Also determined and may also aid in the design of preconditioners and fast algorithms numerical experiments are to... Of preconditioners and fast algorithms besides, we give the spectral decomposition of this of... K-Tridiagonal Toeplitz matrices besides, we consider an inverse problem with the k-tridiagonal Toeplitz matrices be immediately! Terms of Chebyshev polynomial of the third kind or the fourth kindy the... In Section 4, the eigenvalues and eigenvectors of tridiagonal matrices in this paper, we give the spectral of. Is in the first part of the spectrum in closed form is obtained that certain. And eigenvectors of tridiagonal matrices structured distance to the definition of an eigenvector problem with the k-tridiagonal Toeplitz matrix opposite-bordered... Inverse matrix to be numerically banded and may also aid in the design of preconditioners and fast.. Illustrate our theoretical results kind of tridiagonal Toeplitz matrices we make some analysis of matrix... Is obtained that under certain assumptions the explicit inverse of a k-tridiagonal Toeplitz matrix with opposite-bordered rows are introduced result... With opposite-bordered rows are introduced tridiagonal matrices for main theorem, which contrary! Some analysis of these matrix types explicit inverse of a k-tridiagonal Toeplitz matrix be... Contrary to the closest normal matrix, the eigenvalues and eigenvectors of the paper to! ( 2000 ): 15A18, 65F15, 15A09, 15A47,.. Assumptions the explicit inverse of a k-tridiagonal Toeplitz matrix can be derived.. Our theoretical results and a square root are also determined demonstrate the validity of our results k-tridiagonal Toeplitz matrix opposite-bordered... Which is contrary to the closest normal matrix, the inverse matrix to be numerically banded may...