Subspace methods for three‐parameter eigenvalue problems

DOI10.1002/NLA.2240MaRDI QIDQ5227186zbMATH OpenOpenAlexFDO

Authors M. E. Hochstenbach, Karl Meerbergen, Emre Mengi, Bor Plestenjak

Publication date 5 August 2019

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1802.07386

zbMATH Keywords

tensorArnoldi methodJacobi-Davidson methodmultiparameter eigenvalue problemellipsoidal wave equationBaer wave equation

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix equations and identities (15A24)

Abstract: We propose subspace methods for 3-parameter eigenvalue problems. Such problems arise when separation of variables is applied to separable boundary value problems; a particular example is the Helmholtz equation in ellipsoidal and paraboloidal coordinates. While several subspace methods for 2-parameter eigenvalue problems exist, their extensions to three parameter setting seem to be challenging. An inherent difficulty is that, while for 2-parameter eigenvalue problems we can exploit a relation to Sylvester equations to obtain a fast Arnoldi type method, such a relation does not seem to exist when there are three or more parameters. Instead, we introduce a subspace iteration method with projections onto generalized Krylov subspaces that are constructed from scratch at every iteration using certain Ritz vectors as the initial vectors. Another possibility is a Jacobi--Davidson type method for three or more parameters, which we generalize from its 2-parameter counterpart. For both approaches, we introduce a selection criterion for deflation that is based on the angles between left and right eigenvectors. The Jacobi--Davidson approach is devised to locate eigenvalues close to a prescribed target, yet it often also performs well when eigenvalues are sought based on the proximity of one of the components to a prescribed target. The subspace iteration method is devised specifically for the latter task. The proposed approaches are suitable especially for problems where the computation of several eigenvalues is required with high accuracy. Matlab implementations of both methods have been made available in the package MultiParEig.

Recommendations

• Subspace iterative methods for eigenvalue problems
• scientific article; zbMATH DE number 3974169
• scientific article; zbMATH DE number 997682
• Subspace correction multi‐level methods for elliptic eigenvalue problems
• scientific article; zbMATH DE number 2069268
• scientific article; zbMATH DE number 1240754
• A variant of the subspace iteration algorithm for generalized eigenproblems
• Publication:4890936
• Eigenvalue assignment problem for 3-D linear systems
• Inexact rational Krylov subspace method for eigenvalue problems

Cited in

(6)

• Computing several eigenvalues of nonlinear eigenvalue problems by selection
• On the two-parameter matrix pencil problem
• A Newton method for solving locally definite multiparameter eigenvalue problems by multi-index
• Linearizable eigenvector nonlinearities
• Nonlinearizing Two-parameter Eigenvalue Problems
• Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems

Describes a project that uses

Uses Software

• MultiParEig
• Matlab

This page was built for publication: Subspace methods for three‐parameter eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227186)