Year: 2014
East Asian Journal on Applied Mathematics, Vol. 4 (2014), Iss. 1 : pp. 69–81
Abstract
Based on various matrix decompositions, we compare different techniques for solving the inverse quadratic eigenvalue problem, where $n×n$ real symmetric matrices $M$, $C$ and $K$ are constructed so that the quadratic pencil $Q(λ) = λ^{2}M+λC+K$ yields good approximations for the given $k$ eigenpairs. We discuss the case where $M$ is positive definite for $1≤ k≤n$, and a general solution to this problem for $n+1≤k≤2n$. The efficiency of our methods is illustrated by some numerical experiments.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/eajam.100413.021013a
East Asian Journal on Applied Mathematics, Vol. 4 (2014), Iss. 1 : pp. 69–81
Published online: 2014-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 13
Keywords: Quadratic eigenvalue problem inverse quadratic eigenvalue problem partially prescribed spectral information.