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
Disguised and new quasi-Newton methods for nonlinear eigenvalue problems
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Numerical Analysis, NA. KTH, Centres, SeRC - Swedish e-Science Research Centre.ORCID iD: 0000-0001-9443-8772
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Numerical Analysis, NA.
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Numerical Analysis, NA. KTH, Centres, SeRC - Swedish e-Science Research Centre.
2018 (English)In: Numerical Algorithms, ISSN 1017-1398, E-ISSN 1572-9265, Vol. 79, no 1, p. 311-335Article in journal (Refereed) Published
Abstract [en]

In this paper, we take a quasi-Newton approach to nonlinear eigenvalue problems (NEPs) of the type M(λ)v = 0, where (Formula presented.) is a holomorphic function. We investigate which types of approximations of the Jacobian matrix lead to competitive algorithms, and provide convergence theory. The convergence analysis is based on theory for quasi-Newton methods and Keldysh’s theorem for NEPs. We derive new algorithms and also show that several well-established methods for NEPs can be interpreted as quasi-Newton methods, and thereby, we provide insight to their convergence behavior. In particular, we establish quasi-Newton interpretations of Neumaier’s residual inverse iteration and Ruhe’s method of successive linear problems.

Place, publisher, year, edition, pages
Springer, 2018. Vol. 79, no 1, p. 311-335
Keywords [en]
Nonlinear eigenvalue problems, Inverse iteration, Iterative methods, Quasi-Newton methods
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-218702DOI: 10.1007/s11075-017-0438-2ISI: 000442612400014Scopus ID: 2-s2.0-85034666004OAI: oai:DiVA.org:kth-218702DiVA, id: diva2:1161440
Note

QC 20171211

Available from: 2017-11-30 Created: 2017-11-30 Last updated: 2019-11-11Bibliographically approved

Open Access in DiVA

fulltext(1186 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 1186 kBChecksum SHA-512
bbc150b5fcc282b83eee4e9effd7b12f504a19c57c9470c7e9a3f506f0bf54a48aaf2e42fab6fba624a764296c82a6d662285586866de4b9571ea799476254b3
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Jarlebring, EliasKoskela, AnttiMele, Giampaolo
By organisation
Numerical Analysis, NASeRC - Swedish e-Science Research Centre
In the same journal
Numerical Algorithms
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 34 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