Solving inverse cone-constrained eigenvalue problems

Pedro Gajardo, Alberto Seeger

Research output: Contribution to journalArticle

5 Citations (Scopus)


We compare various algorithms for constructing a matrix of order n whose Pareto spectrum contains a prescribed set Λ = {λ1,...,λp} of reals. In order to avoid overdetermination one assumes that p does not exceed n2. The inverse Pareto eigenvalue problem under consideration is formulated as an underdetermined system of nonlinear equations. We also address the issue of computing Lorentz spectra and solving inverse Lorentz eigenvalue problems. © 2012 Springer-Verlag.
Original languageEnglish
Pages (from-to)309-331
Number of pages23
JournalNumerische Mathematik
Publication statusPublished - 1 Jan 2013

Fingerprint Dive into the research topics of 'Solving inverse cone-constrained eigenvalue problems'. Together they form a unique fingerprint.

  • Cite this