Decompositions of Some Special Block Tridiagonal Matrices

Abstract

In this paper, we present a unified approach to decomposing a special class of block tridiagonal matrices K ( α , β ) into block diagonal matrices using similarity transformations. The matrices K ( α , β )∈ R pq × pq are of the form K ( α , β = block-tridiag[ β B , A , α B ] for three special pairs of ( α , β ): K (1,1), K (1,2) and K (2,2) , where the matrices A and B , A , B ∈ R p × q , are general square matrices. The decomposed block diagonal matrices ( α , β ) for the three cases are all of the form: ( α , β ) = D 1 ( α , β ) ⊕ D 2 ( α , β ) ⊕---⊕ D q ( α , β ) , where D k ( α , β ) = A + 2cos ( θ k ( α , β )) B , in which θ k ( α , β ) , k = 1,2, --- q , depend on the values of α and β . Our decomposition method is closely related to the classical fast Poisson solver using Fourier analysis. Unlike the fast Poisson solver, our approach decomposes K ( α , β ) into q diagonal blocks, instead of p blocks. Furthermore, our proposed approach does not require matrices A and B to be symmetric and commute, and employs only the eigenvectors of the tridiagonal matrix T ( α , β ) = tridiag[ β b , a , αb ] in a block form, where a and b are scalars. The transformation matrices, their inverses, and the explicit form of the decomposed block diagonal matrices are derived in this paper. Numerical examples and experiments are also presented to demonstrate the validity and usefulness of the approach. Due to the decoupled nature of the decomposed matrices, this approach lends itself to parallel and distributed computations for solving both linear systems and eigenvalue problems using multiprocessors.