Non-symbolic algorithms for the inversion of tridiagonal matrices
DOI10.1016/j.cam.2012.05.003zbMath1291.65085OpenAlexW2018191074MaRDI QIDQ2453126
Publication date: 6 June 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.05.003
computational complexityscalinginverse matrixdeterminanttridiagonal matrixdifference equationnumerical algorithmdiagonally dominant matriceslinear recurrence relationprincipal submatrices
Computational methods for sparse matrices (65F50) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical aspects of recurrence relations (65Q30)
Related Items
Cites Work
- On the closed representation for the inverses of Hessenberg matrices
- Companion factorization in the general linear group \(\mathrm{GL}(n,\mathbb C)\) and applications
- Growth factors of pivoting strategies associated with Neville elimination
- On the eigenvalues of some tridiagonal matrices
- On computing of block ILU preconditioner for block tridiagonal systems
- On the inverses of general tridiagonal matrices
- Inversion of band matrices
- Inversion of a tridiagonal Jacobi matrix
- Some algorithms for solving special tridiagonal block Toeplitz linear systems
- A fast algorithm for evaluating \(n\)th order tri-diagonal determinants.
- Inversion of general tridiagonal matrices
- An explicit inverse of a tridiagonal matrix
- Analytical inversion of general tridiagonal matrices
- Reliable Computation of the Condition Number of a Tridiagonal Matrix in O(n) Time
- Methods of inverting tridiagonal matrices