A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
DOI10.1002/NLA.2005zbMATH Open1349.65122OpenAlexW2157529542MaRDI QIDQ5739746FDOQ5739746
Authors: Karl Meerbergen, Bor Plestenjak 
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
Recommendations
- A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems
- A two-level method for nonsymmetric eigenvalue problems
- Solutions of the generalized Sylvester matrix equation and the application in eigenstructure assignment
- An Arnoldi type projection method for nonlinear symmetric eigenproblems
- A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
- A Newton‐type method for two‐dimensional eigenvalue problems
- A numerical method for the solution of two-parameter eigenvalue problems
- A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems
- Arnoldi and Jacobi-Davidson methods for generalized eigenvalue problems $Ax=\lambda Bx$ with singular $B$
- Convergence of Arnoldi's method for generalized eigenvalue problems
algorithmsnumerical exampleslow-rank approximationHopf bifurcationgeneralized eigenvalue problemArnoldi methodinverse iterationMatlabSylvester equationMathieu's systemtwo-parameter eigenvalue problemseparable boundary value problemsBartels-Stewart algorithmsubspace iterationoperator determinantsKrylov-Schur iterations
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Matrix equations and identities (15A24)
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Numerical methods for large eigenvalue problems
- Multiparameter eigenvalue problems and expansion theorems
- On the minimal eigenvalue of a positive definite operator determinant
- Harmonic Rayleigh-Ritz extraction for the multiparameter eigenvalue problem
- A Continuation Method for a Right Definite Two-Parameter Eigenvalue Problem
- A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
- A Krylov--Schur algorithm for large eigenproblems
- Krylov-subspace methods for the Sylvester equation
- Spectral collocation solutions to multiparameter Mathieu's system
- Computing elliptic membrane high frequencies by Mathieu and Galerkin methods
- Inverse iteration for purely imaginary eigenvalues with application to the detection of Hopf bifurcations in large-scale problems
- Convergence of inexact inverse iteration with application to preconditioned iterative solvers
- Charge Singularity at the Corner of a Flat Plate
- An error analysis for rational Galerkin projection applied to the Sylvester equation
- Separable boundary-value problems in physics
Cited In (9)
- BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices
- Computing several eigenvalues of nonlinear eigenvalue problems by selection
- Solving two-parameter eigenvalue problems using an alternating method
- Numerical methods for nonlinear two-parameter eigenvalue problems
- Linearizable eigenvector nonlinearities
- Nonlinear multiparameter eigenvalue problems in aeroelasticity
- Nonlinearizing Two-parameter Eigenvalue Problems
- Spectral collocation for multiparameter eigenvalue problems arising from separable boundary value problems
- Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints
Uses Software
This page was built for publication: A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739746)
