Mock tridiagonal systems

We introduce the notion of a mock tridiagonal system. This is a generalization of a tridiagonal system in which the irreducibility assumption is replaced by a certain nonvanishing condition. We show how mock tridiagonal systems can be used to construct tridiagonal systems that meet certain specifications. This paper is part of our ongoing project to classify the tridiagonal systems up to isomorphism.     

Controllability,inertia, and stability for tridiagonal matrices

Criteria are given for the controllability of certain pairs of tridiagonal matrices. These criteria may be used, with the Chen-Wimmer theorem, to obtain inertia results. Also, a characterization is given of those nonsingular tridiagonal matrices with certain principal minors nonnegative which are positive stable. This extends a previous characterization of the real D-stable tridiagonal matrices.     

Numerically stable deflation of hessenberg and symmetric tridiagonal matrices

While numerically stable techniques have been available for deflating a fulln byn matrix, no satisfactory finite technique has been known which preserves Hessenberg form. We describe a new algorithm which explicitly deflates a Hessenberg matrix in floating point arithmetic by means of a sequence of plane rotations. When applied to a symmetric tridiagonal matrix, the deflated matrix is again symmetric tridiagonal. Repeated deflation can be used to find an orthogonal set of eigenvectors associated with any selection of eigenvalues of a symmetric tridiagonal matrix.     

A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges

This paper concerns the LBM ^T factorization of unsymmetric tridiagonal matrices, where L and M are unit lower triangular matrices and B is block diagonal with 1×1 and 2×2 blocks. In some applications, it is necessary to form this factorization without row or column interchanges while the tridiagonal matrix is formed. Bunch and Kaufman proposed a pivoting strategy without interchanges specifically for symmetric tridiagonal matrices, and more recently, Bunch and Marcia proposed pivoting strategies that are normwise backward stable for linear systems involving such matrices. In this paper, we extend these strategies to the unsymmetric tridiagonal case and demonstrate that the proposed methods both exhibit bounded growth factors and are normwise backward stable. Copyright © 2009 John Wiley & Sons, Ltd.     

The Sylvester–Kac matrix space

The Sylvester–Kac matrix is a tridiagonal matrix with integer entries and integer eigenvalues that appears in a variety of applicative problems. We show that it belongs to a four dimensional linear space of tridiagonal matrices that can be simultaneously reduced to triangular form. We name this space after the matrix.     

Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles

Explicit formulas exist for the (n,m) rational function with monic numerator and prescribed poles that has the smallest possible Chebyshev norm. In this paper we derive two different eigenvalue problems to obtain the zeros of this extremal function. The first one is an ordinary tridiagonal eigenvalue problem based on a representation in terms of Chebyshev polynomials. The second is a generalised tridiagonal eigenvalue problem which we derive using a connection with orthogonal rational functions. In the polynomial case (m = 0) both problems reduce to the tridiagonal eigenvalue problem associated with the Chebyshev polynomials of the first kind. Postdoctoral researcher FWO-Flanders.     

三对角逆M-矩阵

In this paper we study a class of inverse M-matrices:tridiagonal inverse M-matrices,Graph theory is used to discuss the structure and properties of tridiagonal inverse M-matrices,A sufficient and necessary condtion for a nonnegative tridiagonal matrix to be an inverse M-matrix is given.Finally,it is proved that the set of the inverses of M-matrices with unipathic is closed under Hadamard product.     

Inversion of band matrices

In this paper, a formula for inverting general band matrices is established. It takes a simple form when the matrices are tridiagonal, and as a special case it includes the Bukhberger-Emel'yanenko algorithm for symmetric tridiagonal matrices.     

周期三对角矩阵逆的一种新算法

给出了一类周期三对角矩阵逆的新的递归算法.新方法充分利用周期三对角矩阵的结构特点,采用递归方法将高阶周期三对角矩阵求逆转化为低阶周期三对角矩阵的求逆.并同时得到简化的计算方法,方法可以有效地减少运算量和存储量,计算精度也有明显的优势.数值实验表明此算法是有效的.     

The numerical range of a tridiagonal operator

Let r be a real number and A a tridiagonal operator defined by Aej=ej−1+rjej+1, j=1,2,…, where {e₁,e₂,…} is the standard orthonormal basis for ?²(N). Such tridiagonal operators arise in Rogers-Ramanujan identities. In this paper, we study the numerical ranges of these tridiagonal operators and finite-dimensional tridiagonal matrices. In particular, when r=−1, the numerical range of the finite-dimensional tridiagonal matrix is the convex hull of two explicit ellipses. Applying the result, we obtain that the numerical range of the tridiagonal operator is the square

     

三对角逆M矩阵的判定

1、引言 三对角逆M矩阵是指同时为三对角矩阵和逆M矩阵的一类特殊矩阵．文用图论方法探讨三对角逆M矩阵结构,给出了三对角矩阵为逆M矩阵的充分必要条件．此条件提供了判定三对角矩阵是逆M矩阵的方法,但较复杂．文讨论了这类矩阵在Hadamard积下的封闭性．由于三对角逆M矩阵在理论和应用上都有一定价值,所以,寻求一种简单而实用的判定方法是必要的．本文通过对这类矩阵结构特点的研究找到了这样一种方法．同时,由此证明了这类矩阵在Hadamard积下的封闭性．     

关于三角形Toeplitz系统的复杂性

目前,已有结果表明,作两个n阶上(或下)三角形T矩阵的乘积以及做n阶三角形T矩阵乘n维列向量的算术运算次数,均不超过O(nlog_2n);而求n阶三角形T矩阵的逆,其工作量则不超过O(nlog_2~2n). 本文给出三角形T矩阵求逆与求解三角形Toeplitz线性方程组的快速算法.该算     

A note on certain matrices with h(x) – Fibonacci quaternion polynomials

In this paper we consider a g – circulant, right circulant, left circulant and a special kind of a tridiagonal matrices whose entries are h(x) – Fibonacci quaternion polynomials. We present the determinant of these matrices and with the tridiagonal matrices we show that the determinant is equal to the nth term of the h(x) – Fibonacci quaternion polynomial sequences.     

Reflections on the almost Mathieu operator

An explicit derivation of a tridiagonal matrix form for the almost Mathieu operator (Harper's equation) is obtained via conjugation with a reflection operator, valid for all rational values of the rotation parameter. The difference between even and odd values of the denominator is highlighted. This tridiagonal form is useful for numerical eigenvalue computations; some Matlab code is included.This research was supported in part by an NSERC individual research grant.     

The {\cal {D Q R}} algorithm, basic theory, convergence, and conditional stability

Summary. We describe a fast matrix eigenvalue algorithm that uses a matrix factorization and reverse order multiply technique involving three factors and that is based on the symmetric matrix factorization as well as on –orthogonal reduction techniques where is computed from the given matrix . It operates on a similarity reduction of a real matrix to general tridiagonal form and computes all of 's eigenvalues in operations, where the part of the operations is possibly performed over , instead of the 7–8 real flops required by the eigenvalue algorithm. Potential breakdo wn of the algorithm can occur in the reduction to tridiagonal form and in the –orthogonal reductions. Both, however, can be monitored during the computations. The former occurs rather rarely for dimensions and can essentially be bypassed, while the latter is extremely rare and can be bypassed as well in our conditionally stable implementation of the steps. We prove an implicit theorem which allows implicit shifts, give a convergence proof for the algorithm and show that is conditionally stable for general balanced tridiagonal matrices . Received April 25, 1995 / Revised version received February 9, 1996     

三对角矩阵的亚正定性

讨论了比三对角矩阵更广泛的一类矩阵的亚正定性,从而给出了三对角矩阵是亚正定矩阵的充分条件.     

Extremal eigenvalue intervals of symmetric tridiagonal interval matrices

Computing the extremal eigenvalue bounds of interval matrices is non‐deterministic polynomial‐time (NP)‐hard. We investigate bounds on real eigenvalues of real symmetric tridiagonal interval matrices and prove that for a given real symmetric tridiagonal interval matrices, we can achieve its exact range of the smallest and largest eigenvalues just by computing extremal eigenvalues of four symmetric tridiagonal matrices.     

Synchronizing chaotic systems using control based on tridiagonal structure

The direct design approach based on tridiagonal structure combines the structure analysis with the design of stabilizing controller and the original nonlinear affine systems is transformed into a stable system with special tridiagonal structure using the method. In this study, the direct method is proposed for synchronizing chaotic systems. There are several advantages in this method for synchronizing chaotic systems: (a) it presents an easy procedure for selecting proper controllers in chaos synchronization; (b) it constructs simple controllers easy to implement. Examples of Lorenz system, Chua’s circuit and Duffing system are presented.     

Analytical inversion of general periodic tridiagonal matrices

In this paper we present an analytical forms for the inversion of general periodic tridiagonal matrices, and provide some very simple analytical forms which immediately lead to closed formulae for some special cases such as symmetric or perturbed Toeplitz for both periodic and non-periodic tridiagonal matrices. An efficient computational algorithm for finding the inverse of any general periodic tridiagonal matrices from the analytical form is given, it is suited for implementation using Computer Algebra systems such as MAPLE, MATLAB, MACSYMA, and MATHEMATICA. An example is also given to illustrate the algorithm.     

A fourth-order compact ADI method for solving two-dimensional unsteady convection–diffusion problems

In this article, an exponential high-order compact (EHOC) alternating direction implicit (ADI) method, in which the Crank–Nicolson scheme is used for the time discretization and an exponential fourth-order compact difference formula for the steady-state 1D convection–diffusion problem is used for the spatial discretization, is presented for the solution of the unsteady 2D convection–diffusion problems. The method is temporally second-order accurate and spatially fourth order accurate, which requires only a regular five-point 2D stencil similar to that in the standard second-order methods. The resulting EHOC ADI scheme in each ADI solution step corresponds to a strictly diagonally dominant tridiagonal matrix equation which can be inverted by simple tridiagonal Gaussian decomposition and may also be solved by application of the one-dimensional tridiagonal Thomas algorithm with a considerable saving in computing time. The unconditionally stable character of the method was verified by means of the discrete Fourier (or von Neumann) analysis. Numerical examples are given to demonstrate the performance of the method proposed and to compare mostly it with the high order ADI method of Karaa and Zhang and the spatial third-order compact scheme of Note and Tan.