Analytical inverse for the symmetric circulant tridiagonal matrix

DOI10.17654/AM099010001MaRDI QIDQ5210593zbMATH OpenOpenAlexWikidataFDO

Authors Seyyed Mostafa Mousavi Janbeh Sarayi, Saman Tavana, Morad Karimpour, Mansour Nikkhah-Bahrami

Publication date 21 January 2020

Published in Far East Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.10871

zbMATH Keywords

sparse matrixToeplitz matrixcirculant matrixlinear equationsdecomposition methodmatrix inversion

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)

Abstract: Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce the matrix to a simple form, only then beginning a mathematical procedure. For symmetric matrices, the preferred simple form is tridiagonal. This makes tridiagonal matrices of high interest in applied mathematics and engineering problems. This study presents a time efficient, exact analytical approach for finding the inverse, decomposition, and solving linear systems of equations where symmetric circulant matrix appears. This matrix appears in many researches and it is different from ordinary tridiagonal matrices as there are two corner elements. For finding the inverse matrix, a set of matrices are introduced that any symmetric circulant matrix could be decomposed into them. After that, the exact analytical inverse of this set is found which gives the inverse of circulant matrix. Moreover, solving linear equations can be carried out using implemented decomposition where this matrix appears as a coefficient matrix. The methods principal strength is that it is as stable as any other direct methods (i.e., execute in a predictable number of operations). It is straightforward, understandable, solid as a rock and an exceptionally good psychological backup for those times when something is going wrong and you think it might be your linear equation solver. The downside of present method, and every other direct method, is the accumulation of round off errors.

Recommendations

• A new method for solving symmetric circulant tridiagonal systems of linear equations
• Analytic inversion of matrices with \(2^k\times 2^k\) circulant blocks
• The inverses of some circulant matrices
• Analytical inversion of general periodic tridiagonal matrices
• Analytical inversion of general tridiagonal matrices

Cites work

• scientific article; zbMATH DE number 2098242 (Why is no real title available?)
• A Fast Algorithm for the Electromagnetic Scattering from a Large Cavity
• A new method for solving symmetric circulant tridiagonal systems of linear equations
• A parallel method for linear equations with tridiagonal Toeplitz coefficient matrices
• Iterative system solvers for the frequency analysis of linear mechanical systems
• Numerical recipes. The art of scientific computing.
• Parallel algorithms for solving tridiagonal and near-circulant systems.
• Solving systems of symmetric Toeplitz tridiagonal equations: Rojo's algorithm revisited

This page was built for publication: Analytical inverse for the symmetric circulant tridiagonal matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210593)