Abstract
An algorithm for computing the inverse of a general tridiagonal matrix is introduced. This algorithm is obtained by factoring this matrix into the product of two bidiagonal matrices using Crout’s LU factorization, one upper and one lower bidiagonal. A simple recurrence relation is used to generate a sequence of numbers, this sequence is then used to fill in the matrices L, U, L −1, U −1 and consequently the required inverse.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call