Abstract:We give explicit inverses of tridiagonal 2-Toeplitz and 3-Toeplitz matrices which generalize some well-known results concerning the inverse of a tridiagonal Toeplitz matrix.
“…Closed-form expressions for the other structural polynomials can be derived using the explicit inverse for 2-Toeplitz matrices derived by da Fonseca and Petronilho [2], and using Eqs. (1.1) and (1.2).…”
Section: Structural Polynomials Of Alternating Pathsmentioning
In chemistry and physics, distortivity of π-systems (stabilisation of bond-alternated structures) is an important factor in the calculation of geometric, energetic, and electronic properties of molecules via graph theoretical methods. We use the spectra of paths and cycles with alternating vertex and edge weights to obtain the eigenvalues and eigenvectors for a class of linear and cyclic ladders with alternating rung and backbone edge weights. We derive characteristic polynomials and other structural polynomials formed from the cofactors of the characteristic matrix for these graphs. We also obtain spectra and structural polynomials for ladders with flipped weights and/or Möbius topology. In all cases, the structural polynomials for the composite graphs are expressed in terms of products of polynomials for graphs of half order. This form of the expressions allows global deductions about the transmission spectra of molecular devices in the graph-theoretical theory of ballistic molecular conduction.
“…Closed-form expressions for the other structural polynomials can be derived using the explicit inverse for 2-Toeplitz matrices derived by da Fonseca and Petronilho [2], and using Eqs. (1.1) and (1.2).…”
Section: Structural Polynomials Of Alternating Pathsmentioning
In chemistry and physics, distortivity of π-systems (stabilisation of bond-alternated structures) is an important factor in the calculation of geometric, energetic, and electronic properties of molecules via graph theoretical methods. We use the spectra of paths and cycles with alternating vertex and edge weights to obtain the eigenvalues and eigenvectors for a class of linear and cyclic ladders with alternating rung and backbone edge weights. We derive characteristic polynomials and other structural polynomials formed from the cofactors of the characteristic matrix for these graphs. We also obtain spectra and structural polynomials for ladders with flipped weights and/or Möbius topology. In all cases, the structural polynomials for the composite graphs are expressed in terms of products of polynomials for graphs of half order. This form of the expressions allows global deductions about the transmission spectra of molecular devices in the graph-theoretical theory of ballistic molecular conduction.
Based on a modification of the "Dichotomy Algorithm" (Terekhov, 2010), we propose a parallel procedure for solving tridiagonal systems of equations with Toeplitz matrices. Taking the structure of the Toeplitz matrices, we may substantially reduce the number of the "preliminary calculations" of the Dichotomy Algorithm, which makes it possible to effectively solve a series as well as a single system of equations. On the example of solving of elliptic equations by the Separation Variable Method, we show that the computation accuracy is comparable with the sequential version of the Thomas method, and the dependence of the speedup on the number of processors is almost linear. The proposed modification is aimed at parallel realization of a broad class of numerical methods including the inversion of Toeplitz and quasi-Toeplitz tridiagonal matrices.
“…Alternatively, we apply the usual techniques for discrete boundary value problems, see [1,7]. Specifically, we have the following result expressing the entries of R −1 + D 2 in terms of two solutions of a difference equations.…”
Section: Polyominoes With Link Number Greater Than Onementioning
A Polyomino is an edge-connected union of cells in the planar square lattice. Here we consider generalized linear polyominoes; that is, the polyominoes supported by a n × 2 lattice. In this paper, we obtain the Green function and the Kirchhoff index of a generalized linear polyomino as a perturbation of a 2n-path by adding weighted edges between opposite vertices. This approach deeply links generalized linear polyomino Green functions with the inverse M-matrix problem, and especially with the so-called Green matrices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.