𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An asymptotically superior algorithm for computing the characteristic polynomial of a tridiagonal matrix

✍ Scribed by Krishna, H.

Book ID
119781456
Publisher
IEEE
Year
1988
Tongue
English
Weight
225 KB
Volume
76
Category
Article
ISSN
0018-9219

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the numerical inversion
An algorithm for the numerical inversion of a tridiagonal matrix
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
✍ S. Rombouts; K. Heyde πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.