@Article{EAJAM-4-1,
author = {},
title = {General Solutions for a Class of Inverse Quadratic Eigenvalue Problems},
journal = {East Asian Journal on Applied Mathematics},
year = {2014},
volume = {4},
number = {1},
pages = {69--81},
abstract = {<p style="text-align: justify;">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.</p>},
issn = {2079-7370},
doi = {https://doi.org/10.4208/eajam.100413.021013a},
url = {https://global-sci.com/article/82794/general-solutions-for-a-class-of-inverse-quadratic-eigenvalue-problems}
}