Repository logo
  • Research Outputs
  • Researchers
  • Schools
    Felizberta Lo Padilla Tong School of Social SciencesIp Ying To Lee Yu Yee School of Humanities and LanguagesRita Tong Liu School of Business and Hospitality ManagementS.K. Yee School of Health SciencesYam Pak Charitable Foundation School of Computing and Information Sciences
  • Help
Repository logo
  1. Home
  2. Computing and Information Sciences
  3. CIS Publication
  4. An algorithm for matrix polynomial eigenproblems
 
  • Details

An algorithm for matrix polynomial eigenproblems

Author(s)
Leung, Andrew Yee Tak  
Date Issued
1992
Publisher
Elsevier
Journal
Journal of Sound and Vibration
Volume
158
Issue
2
Start page
363
End page
368
Abstract
When a system is described by higher order differential equations with time as the independent variable, the solution for the homogeneous system is defined by a matrix polynomial eigenproblem. A method alternative to the classical companion matrix method is introduced to expand the determinant algebraically to result in a scalar polynomial equation for the eigenvalues. The eigenvectors are obtained by inverse iteration. It is shown that the new method is computationally more advantageous than the conventional companion matrix method. A computer program is given for general matrix polynomials as well as Hermitian matrix polynomials. Defective eigenproblems can be handled without special attention.
URI
https://repository.sfu.edu.hk/handle/sfu/3233
DOI
10.1016/0022-460X(92)90057-5
SFU Affiliated Publication
No
Availability at SFU Library

No database links found.

Responsible Use of E‑Resources | Privacy Policy | Disclaimer
© SFU Library. All Rights Reserved.
SFU Library