Decompositions of Some Special Block Tridiagonal Matrices

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 (α ,β )∈ Rpq× 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∈ Rp× q , are general square matrices. The decomposed block diagonal matrices (α ,β ) for the three cases are all of the form: (α ,β ) = D1 (α ,β ) ⊕ D2 (α ,β ) ⊕---⊕ Dq (α ,β ) , where Dk (α ,β ) = 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.

Generate mesh with shape parameters

In CAD/CAM, mesh rather than smooth surface is only needed sometimes. A mesh-generating method from permanence principle of Coons patch is developed. A new mesh point is defined through local small subpatch and all mesh points are computed by a linear system with special symmetric block tridiagonal coefficient matrix. By simplification, the determinant of coefficient matrix is determined by determinants of submatrices. Condition of existence of solution is given. Whether coefficient matrix is singular can be judged by a simple polynomial function with the eigenvalue of submatrix as variable. Numerical examples demonstrate the effects of shape parameters.

Schur Complement Based Preconditioners for Twofold an

In this paper,we consider using Schur complements to design preconditioners for twofold and block tridiagonal saddle point problems.One type of the preconditioners are based on the nested(or recursive)Schur complement,the other is based on an additive type Schur complement after permuting the original saddle point systems.We analyze different preconditioners incorporating the exact Schur complements.We show that some of them will lead to positively stable preconditioned systems if proper signs are selected in front of the Schur complements.These positive-stable preconditioners outperform other preconditioners if the Schur complements are further approximated inexactly.Numerical experiments for a 3-field formulation of the Biot model are provided to verify our predictions.