arXiv Analytics

Sign in

arXiv:1801.08622 [math.NA]AbstractReferencesReviewsResources

Automatic rational approximation and linearization of nonlinear eigenvalue problems

Pieter Lietaert, Javier Pérez, Bart Vandereycken, Karl Meerbergen

Published 2018-01-25Version 1

We present a method for solving nonlinear eigenvalue problems using rational approximation. The method uses the AAA method by Nakatsukasa, S\`{e}te, and Trefethen to approximate the nonlinear eigenvalue problem by a rational eigenvalue problem and is embedded in the state space representation of a rational polynomial by Su and Bai. The advantage of the method, compared to related techniques such as NLEIGS and infinite Arnoldi, is the efficient computation by an automatic procedure. In addition, a set-valued approach is developed that allows building a low degree rational approximation of a nonlinear eigenvalue problem. The method perfectly fits the framework of the Compact rational Krylov methods (CORK and TS-CORK), allowing to efficiently solve large scale nonlinear eigenvalue problems. Numerical examples show that the presented framework is competitive with NLEIGS and usually produces smaller linearizations with the same accuracy but with less effort for the user.

Related articles: Most relevant | Search more
arXiv:2102.09726 [math.NA] (Published 2021-02-19)
Equivalences for Linearizations of Matrix Polynomials
arXiv:1705.06982 [math.NA] (Published 2017-05-19)
A compact rational Krylov method for large-scale rational eigenvalue problems
arXiv:1106.4266 [math.NA] (Published 2011-06-21)
On the linearization of Regge calculus