Leverrier-Fadeev algorithm and classical orthogonal polynomials
From MaRDI portal
Recommendations
- Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils \(sE - A\)
- Leverrier-Chebyshev algorithm for the singular pencils
- Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
- Leverrier's algorithm for orthogonal polynomial bases
- On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
Cited in
(7)- Leverrier's algorithm for orthogonal polynomial bases
- On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
- scientific article; zbMATH DE number 5015711 (Why is no real title available?)
- Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
- scientific article; zbMATH DE number 1916837 (Why is no real title available?)
- Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils \(sE - A\)
- An application of the modified Leverrier-Faddeev algorithm to the spectral decomposition of symmetric block-circulant matrices
This page was built for publication: Leverrier-Fadeev algorithm and classical orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3410360)
