Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing a partial schur factorization of nonlinear eigenvalue problems using the infinite Arnoldi method
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Numerical Analysis, NA.ORCID iD: 0000-0001-9443-8772
KU Leuven.
KU Leuven.
2014 (English)In: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 35, no 2, 411-436 p.Article in journal (Refereed) Published
Abstract [en]

The partial Schur factorization can be used to represent several eigenpairs of a matrix in a numerically robust way. Different adaptions of the Arnoldi method are often used to compute partial Schur factorizations. We propose here a technique to compute a partial Schur factorization of a nonlinear eigenvalue problem (NEP). The technique is an extension of our algorithm from [E. Jarlebring, W. Michiels, and K. Meerbergen, Numer. Math., 122 (2012), pp. 169-195], now called the infinite Arnoldi method. The infinite Arnoldi method is a method designed for NEPs, and can be interpreted as Arnoldi's method applied to a linear infinite-dimensional operator, whose reciprocal eigenvalues are the solutions to the NEP. As a first result we show that the invariant pairs of the operator are equivalent to invariant pairs of the NEP. We characterize the structure of the invariant pairs of the operator and show how one can carry out a modification of the infinite Arnoldi method by respecting the structure. This also allows us to naturally add the feature known as locking. We nest this algorithm with an outer iteration, where the infinite Arnoldi method for a particular type of structured functions is appropriately restarted. The restarting exploits the structure and is inspired by the well-known implicitly restarted Arnoldi method for standard eigenvalue problems. The final algorithm is applied to examples from a benchmark collection, showing that both processing time and memory consumption can be considerably reduced with the restarting technique.

Place, publisher, year, edition, pages
2014. Vol. 35, no 2, 411-436 p.
Keyword [en]
Arnoldi's method, Invariant pairs, Nonlinear eigenvalue problems, Restarting
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-144100DOI: 10.1137/110858148ISI: 000338830100005Scopus ID: 2-s2.0-84903942966OAI: oai:DiVA.org:kth-144100DiVA: diva2:711067
Note

QC 20140908

Available from: 2014-04-09 Created: 2014-04-09 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Jarlebring, Elias

Search in DiVA

By author/editor
Jarlebring, Elias
By organisation
Numerical Analysis, NA
In the same journal
SIAM Journal on Matrix Analysis and Applications
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 53 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf