A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
DOI10.1002/nla.2005zbMath1349.65122MaRDI QIDQ5739746
Bor Plestenjak, Karl Meerbergen
Publication date: 19 July 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/631493
algorithms; numerical examples; Hopf bifurcation; generalized eigenvalue problem; Bartels-Stewart algorithm; inverse iteration; Sylvester equation; Matlab; Arnoldi method; low-rank approximation; Mathieu's system; two-parameter eigenvalue problem; separable boundary value problems; subspace iteration; operator determinants; Krylov-Schur iterations
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
15A24: Matrix equations and identities
15A18: Eigenvalues, singular values, and eigenvectors
65F10: Iterative numerical methods for linear systems
Uses Software