A Breakdown Free Numerical Algorithm for Inverting General Tridiagonal Matrices
From MaRDI portal
Publication:6408962
arXiv2208.12843MaRDI QIDQ6408962FDOQ6408962
Authors: Moawwad El-Mikkawy, Abdelrahman Karawia
Publication date: 26 August 2022
Abstract: In the current paper the authors linked two methods in order to evaluate general n-th order tridiagonal determinants. A breakdown free numerical algorithm is developed for computing the inverse of any nxn general nonsingular tridiagonal matrix without imposing any constrains. The algorithm is suited for implementation using any computer language such as FORTRAN, PYTHON, MATLAB, MAPLE, C, C++, MACSYMA, ALGOL, PASCAL and JAVA. Some illustrative examples are presented.
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Linear difference equations (39A06)
This page was built for publication: A Breakdown Free Numerical Algorithm for Inverting General Tridiagonal Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408962)