𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for computing the eigenstructure of a regular matrix polynomial

✍ Scribed by Wen-Wei Lin

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
665 KB
Volume
91
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

An Algorithm Computing the Regular Forma
An Algorithm Computing the Regular Formal Solutions of a System of Linear Differential Equations
✍ Moulay Barkatou; Eckhard PflΓΌgel πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 367 KB

We propose a method for computing the regular singular formal solutions of a linear differential system in the neighbourhood of a singular point. This algorithm avoids the use of cyclic vectors and has been implemented † in the computer algebra system Maple.