Matrices Which Inversions are Tridiagonal, Band or Block-Tridiagonal and Their Relationship with the Covariance Matrices of a Markov Processes
نویسنده
چکیده
The article discusses the matrices of the 1 n A , m n A , m N A forms, whose inversions are: tridiagonal matrix 1 n A (n dimension of the matrix), banded matrix m n A (m the half-width band of the matrix) or block-tridiagonal matrix m N A (N=n x m – full dimension of the block matrix; m the dimension of the blocks) and their relationships with the covariance matrices of measurements with ordinary (simple) Markov Random Processes (MRP), multiconnected MRP and vector MRP respectively. Such covariance matrices are frequently occurring in the problems of optimal filtering, extrapolation and interpolation of MRP and Markov Random Fields (MRF). It is shown, that the structure of the matrix 1 n A , m n A , m N A , has the same form, but the matrix elements in the first case are scalar quantities; in the second case matrix elements representing a product of vectors of dimension m; and in the third case, the off-diagonal elements are the product of matrices and vectors of dimension m. The properties of such matrices were investigated and a simple formulas of their inversion was founded. Also computational efficiency in the storage and inverse of such matrices have been considered. To illustrate the acquired results an example of the covariance matrix inversions of two-dimensional MRP is given.
منابع مشابه
On the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملEigendecomposition of Block Tridiagonal Matrices
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large matrix sizes. In this paper, we address the problem of the eigendecomposition of block tridiagonal matrices by studying a connection between their eigenvalues and...
متن کاملDeterminants of Block Tridiagonal Matrices
A tridiagonal matrix with entries given by square matrices is a block tridiagonal matrix; the matrix is banded if off-diagonal blocks are upper or lower triangular. Such matrices are of great importance in numerical analysis and physics, and to obtain general properties is of great utility. The blocks of the inverse matrix of a block tridiagonal matrix can be factored in terms of two sets of ma...
متن کاملDecay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices
It is well known that the inverse C = c i;j ] of an irreducible nonsingular symmetric tridiagonal matrix is a Green matrix, i.e. it satisses c i;j = u i v j for i j and two sequences of real numbers fu i g and fv i g. A similar result holds for nonsymmetric matrices A. There the inverse is given by four sequences fu i g; fv i g; fy i g; and fy i g: Here we characterize certain properties of A i...
متن کاملBLU Factorization for Block Tridiagonal Matrices and Its Error Analysis
A block representation of the BLU factorization for block tridiagonal matrices is presented. Some properties on the factors obtained in the course of the factorization are studied. Simpler expressions for errors incurred at the process of the factorization for block tridiagonal matrices are considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1507.01763 شماره
صفحات -
تاریخ انتشار 2015