Related papers: Rotation numbers for Jacobi matrices with matrix e…
A Jacobi matrix with matrix entries is a self-adjoint block tridiagonal matrix with invertible blocks on the off-diagonals. Averaging over boundary conditions leads to explicit formulas for the averaged spectral measure which can…
We present here the necessary and sufficient conditions for the invertibility of tridiagonal matrices, commonly named Jacobi matrices, and explicitly compute their inverse. The techniques we use are related with the solution of…
The class of three-diagonal Jacobi matrix with exponentially increasing elements is considered. Under some assumptions the matrix corresponds to unbounded self-adjoint operator in the weighted space. The weight depends on elements of the…
We develop relative oscillation theory for Jacobi matrices which, rather than counting the number of eigenvalues of one single matrix, counts the difference between the number of eigenvalues of two different matrices. This is done by…
For tridiagonal block Jacobi operators, the standard transfer operator techniques only work if the off-diagonal entries are invertible. Under suitable assumptions on the range and kernel of these off-diagonal operators which assure a…
We present an improved form of the algorithm for constructing Jacobi rotations. This is simultaneously a more accurate code for finding the eigenvalues and eigenvectors of a real symmetric 2x2 matrix.
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
In one dimensional transport problems the scattering matrix $S$ is decomposed into a block structure corresponding to reflection and transmission matrices at the two ends. For $S$ a random unitary matrix, the singular value probability…
Jacobi's method is a well-known algorithm in linear algebra to diagonalize symmetric matrices by successive elementary rotations. We report about the generalization of these elementary rotations towards canonical transformations acting in…
The spectral properties of two special classes of Jacobi operators are studied. For the first class represented by the $2M$-dimensional real Jacobi matrices whose entries are symmetric with respect to the secondary diagonal, a new…
We present a comprehensive treatment of relative oscillation theory for finite Jacobi matrices. We show that the difference of the number of eigenvalues of two Jacobi matrices in an interval equals the number of weighted sign-changes of the…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…
Sturm-Liouville oscillation theory is studied for Jacobi operators with block entries given by covariant operators on an infinite dimensional Hilbert space. It is shown that the integrated density of states of the Jacobi operator is…
We describe the relation between block Jacobi matrices and minimization problems for discrete time optimal control problems. Using techniques developed for the continuous case, we provide new algorithms to compute spectral invariants of…
A Jacobi matrix with matrix entries is a self-adjoint block tridiagonal matrix with invertible blocks on the off-diagonals. The Weyl surface describing the dependence of Green's matrix on the boundary conditions is interpreted as the set of…
For a general third-order tensor $\mathcal{A}\in\mathbb{R}^{n\times n\times n}$ the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm…
This paper presents a Jacobi-type iteration for computing a given specified eigenpair of a symmetric matrix. For a certain class of diagonally dominant matrices, the procedure is shown to converge at a linear rate depending on how the…
Jacobi matrices are parametrized by their eigenvalues and norming constants (first coordinates of normalized eigenvectors): this coordinate system breaks down at reducible tridiagonal matrices. The set of real symmetric tridiagonal matrices…
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…