An algorithm for computing the eigenstructure of a regular matrix polynomial

DOI10.1016/0024-3795(87)90071-1zbMath0618.65028OpenAlexW2156494024MaRDI QIDQ1822455

WenWei Lin

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90071-1

zbMATH Keywords

matrix pencilLU decompositionsrange and nullspace separation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Matrices over function rings in one or more variables (15A54)

Related Items

Nonequivalence transformation of?-matrix eigenproblems and model embedding approach to model tuning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computation of Kronecker's canonical form of a singular pencil
• The eigenstructure of an arbitrary polynomial matrix: Computational aspects
• $Ax = \lambda Bx$ and the Generalized Eigenproblem
• On an Approach to the Solution of the Generalized Latent Value Problem for $\lambda $-Matrices
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Algorithms for the Nonlinear Eigenvalue Problem