Analytical Inverse For The Symmetric Circulant Tridiagonal Matrix

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2023

On Symmetric Factorizations of Hankel Matrices

We present two conjectures regarding the running time of computing symme...
research
12/15/2018

Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric M-Matrices

In this paper we show how to recover a spectral approximations to broad ...
research
07/22/2020

An Adaptive Solver for Systems of Linear Equations

Computational implementations for solving systems of linear equations of...
research
11/26/2017

Effective Matrix Methods in Commutative Domains

Effective matrix methods for solving standard linear algebra problems in...
research
03/05/2020

Straggler Robust Distributed Matrix Inverse Approximation

A cumbersome operation in numerical analysis and linear algebra, optimiz...
research
07/02/2022

A Structured Sparse Neural Network and Its Matrix Calculations Algorithm

Gradient descent optimizations and backpropagation are the most common m...
research
05/31/2022

Mathematical Operations and Equation Solving with Reconfigurable Metadevices

Performing analog computations with metastructures is an emerging wave-b...

Please sign up or login with your details

Forgot password? Click here to reset