𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the numerical inversion of a tridiagonal matrix

✍ Scribed by Kumar, Surendra ;Shashi, ;Pethö, Árpad


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
280 KB
Volume
9
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

✦ Synopsis


This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.


📜 SIMILAR VOLUMES


Numerical solution of the Gel'fand–Levit
✍ Yan Zhang; Jin Au Kong; Arthur K. Jordan 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB 👁 2 views

In this article a numerical method that makes use of ( ) matrix in¨ersion to sol¨e the Gel'fand᎐Le¨itan᎐Marchenko GLM integral equation for electromagnetic in¨erse scattering is presented. The algorithm is ¨alidated by comparing it to the analytic solution of the in¨erse problem for the reflection c

An algorithm for the matrix-free solutio
✍ Martin W. Heinstein; Tod A. Laursen 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB 👁 2 views

A contact enforcement algorithm has been developed for matrix-free quasistatic finite element techniques. Matrix-free (iterative) solution algorithms such as non-linear conjugate gradients (CG) and dynamic relaxation (DR) are desirable for large solid mechanics applications where direct linear equat