An algorithm for the numerical inversion of a tridiagonal matrix
From MaRDI portal
Publication:3136806
DOI10.1002/CNM.1640090409zbMATH Open0798.65030OpenAlexW2047977402MaRDI QIDQ3136806FDOQ3136806
Authors: Surendra Kumar, Á. Pethő
Publication date: 6 October 1993
Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cnm.1640090409
Recommendations
- An explicit inverse of a tridiagonal matrix
- An inversion algorithm for general tridiagonal matrix
- A fast numerical algorithm for the inverse of a tridiagonal and pentadiagonal matrix
- An algorithm for computing inverses of tridiagonal matrices with applications
- Iterative refinement of computing inverse matrix
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of determinants (65F40)
Cites Work
Cited In (7)
- Variant of the Thomas algorithm for opposite-bordered tridiagonal systems of equations
- Domain-Decomposition-Type Methods for Computing the Diagonal of a Matrix Inverse
- A class of Kung-Traub-type iterative algorithms for matrix inversion
- A bidiagonalization-based numerical algorithm for computing the inverses of \((p, q)\)-tridiagonal matrices
- Title not available (Why is that?)
- An explicit inverse of a tridiagonal matrix
- Title not available (Why is that?)
This page was built for publication: An algorithm for the numerical inversion of a tridiagonal matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136806)