Leverrier’s Algorithm: A New Proof and Extensions

DOI10.1137/0610040MaRDI QIDQ4732033zbMATH OpenOpenAlexFDO

Authors Stephen Barnett

Publication date 1989

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0610040

zbMATH Keywords

adjointcompanion matrixdeterminantinverseLeverrier's algorithmLeverrier-Fadeev algorithmlinear control systemspolynomial matrix

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)

Recommendations

• scientific article; zbMATH DE number 1916837
• Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
• A new extension of Leverrier's algorithm
• On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
• Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils \(sE - A\)

Cited in

(30)

• Lepp-bisection algorithms, applications and mathematical properties
• A new extension of Leverrier's algorithm
• On the coefficients of the characteristic polynomial of a matrix
• An alternative limit expression of Drazin inverse and its application
• Inversion of matrix pencils for generalized systems
• Leverrier's algorithm and Cayley-Hamilton theorem for 2-D system
• Singular divergence instability thresholds of kinematically constrained circulatory systems
• A finite algorithm for the Drazin inverse of a polynomial matrix
• Partitioning method for rational and polynomial matrices
• Leverrier's algorithm for orthogonal polynomial bases
• Efficient GPU implementation of multidimensional incomplete Riemann solvers for hyperbolic nonconservative systems: applications to shallow water systems with topography and dry areas
• The Moore-Penrose inverses of matrices over quaternion polynomial rings
• On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
• Symbolic computation of weighted Moore-Penrose inverse using partitioning method
• Effective partitioning method for computing weighted Moore-Penrose inverse
• Computing generalized inverses of a rational matrix and applications
• n-order linear state space systems: computing the transfer function using the DFT
• A novel proof of the Souriau-Frame-Faddeev algorithm
• Cyclicity in multicompanion canonical matrices
• A new proof of the Garsia-Wachs algorithm
• Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
• Brouwer's problem on a heavy particle in a rotating vessel: Wave propagation, ion traps, and rotor dynamics
• Symbolic computation of the Moore–Penrose inverse using a partitioning method
• scientific article; zbMATH DE number 1916837 (Why is no real title available?)
• scientific article; zbMATH DE number 810730 (Why is no real title available?)
• Solution of spring-mass system by using Faddeev-Leverrier method together with Laplace transform
• The Faddeev-LeVerrier algorithm and the Pfaffian
• On the stability of nonconservative systems with small dissipation
• Gyroscopic stabilization of non-conservative systems
• Differentiation of generalized inverses for rational and polynomial matrices

This page was built for publication: Leverrier’s Algorithm: A New Proof and Extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732033)