A new extension of Leverrier's algorithm (Q1210398): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:58, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new extension of Leverrier's algorithm |
scientific article |
Statements
A new extension of Leverrier's algorithm (English)
0 references
8 August 1993
0 references
A recursion derived by \textit{S.Barnett} [SIAM J. Matrix Anal. Appl. 10, No. 4, 551-556 (1989; Zbl 0682.65022)], for computing the inverse of a matrix polynomial by means of a Leverrier type recursion, is extended to the case of a singular leading term.
0 references
Leverrier's algorithm
0 references
inverse
0 references
matrix polynomial
0 references
