On a two-term recurrence for the determinant of a general matrix

DOI10.1016/j.amc.2006.08.156zbMath1123.65302OpenAlexW2093807366MaRDI QIDQ883880

Tomohiro Sogabe

Publication date: 12 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.156

zbMATH Keywords

determinantstwo-term recurrenceDETGTRI algorithmgeneral matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of determinants (65F40)

Related Items (11)

A note on a fast breakdown-free algorithm for computing the determinants and the permanents of \(k\)-tridiagonal matrices ⋮ Numerical algorithms for solving comrade linear systems based on tridiagonal solvers ⋮ Numerical algorithms for the determinants of opposite-bordered and singly-bordered tridiagonal matrices ⋮ Numerical algorithms for the determinant evaluation of general Hessenberg matrices ⋮ A generalized symbolic Thomas algorithm for the solution of opposite-bordered tridiagonal linear systems ⋮ On the inverse of a general pentadiagonal matrix ⋮ A note on ``A fast numerical algorithm for the determinant of a pentadiagonal matrix ⋮ Determinants of block tridiagonal matrices ⋮ A fast numerical algorithm for the determinant of a pentadiagonal matrix ⋮ Numerical algorithm for the determinant evaluation of cyclic pentadiagonal matrices with Toeplitz structure ⋮ Generalized Sherman-Morrison-Woodbury formula based algorithm for the inverses of opposite-bordered tridiagonal matrices

Cites Work

• A note on a three-term recurrence for a tridiagonal matrix.
• A fast algorithm for evaluating \(n\)th order tri-diagonal determinants.
• The Schur complement and its applications
• Comments on ``A note on a three-term recurrence for a tridiagonal matrix

This page was built for publication: On a two-term recurrence for the determinant of a general matrix