An inversion algorithm for general tridiagonal matrix
The authors propose an algorithm for the inverse of a general tridiagonal matrix. The algorithm first computes an \textit{LU} factorization of the matrix and then uses the special structure of the inverses of \textit{L} and \textit{U} for computing the elements of the inverse. The computational cost is \(n^2+5n-5\).
scientific article; zbMATH DE number 5550592