Leverrier's algorithm for orthogonal polynomial bases (Q1911435)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Leverrier's algorithm for orthogonal polynomial bases |
scientific article |
Statements
Leverrier's algorithm for orthogonal polynomial bases (English)
0 references
7 October 1996
0 references
For a given \(n \times n\) matrix \(A\), the well-known Leverrier-Fadeev algorithm can be used for simultaneous computation of the adjoint \(B(\lambda)\) and determinant \(a(\lambda)\) of the characteristic matrix \(\lambda I - A\). This paper deals with the case when both \(B(\lambda)\) and \(a(\lambda)\) are expressed relative to a basis of orthogonal polynomials. By using the standard three-term recurrence relation of orthogonal polynomials, the Leverrier-Fadeev algorithm is modified and specific formulae are derived for the cases of Chebyshev, Hermite, Legendre, and Laguerre polynomials. These results may be very useful in linear control theory and elsewhere. Obviously, further numerical analysis should be investigated.
0 references
Chebyshev polynomials
0 references
Hermite polynomials
0 references
Legendre polynomials
0 references
Leverrier-Fadeev algorithm
0 references
adjoint
0 references
determinant
0 references
basis of orthogonal polynomials
0 references
three-term recurrence relation
0 references
Laguerre polynomials
0 references
0 references