In this paper, based on Patel's algorithm (1993), we propose a structure-preserving algorithm for solving palindromic quadratic eigenvalue problems (QEPs). We also show the relationship between the structure-preserving algorithm and the URV-based structure-preserving algorithm by Schröder (2007). For large sparse palindromic QEPs, we develop a generalized -skew-Hamiltonian implicitly restarted shift-and-invert Arnoldi algorithm for solving the resulting -skew-Hamiltonian pencils. Numerical experiments show that our proposed structure-preserving algorithms perform well on the palindromic QEP arising from a finite element model of high-speed trains and rails.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2009) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: