A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
From MaRDI portal
(Redirected from Publication:5739746)
algorithmsArnoldi methodBartels-Stewart algorithmgeneralized eigenvalue problemHopf bifurcationinverse iterationKrylov-Schur iterationslow-rank approximationMathieu's systemMatlabnumerical examplesoperator determinantsseparable boundary value problemssubspace iterationSylvester equationtwo-parameter eigenvalue problem
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
Cites work
- 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
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- An error analysis for rational Galerkin projection applied to the Sylvester equation
- Charge Singularity at the Corner of a Flat Plate
- Computing elliptic membrane high frequencies by Mathieu and Galerkin methods
- Convergence of inexact inverse iteration with application to preconditioned iterative solvers
- Harmonic Rayleigh-Ritz extraction for the multiparameter eigenvalue problem
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Inverse iteration for purely imaginary eigenvalues with application to the detection of Hopf bifurcations in large-scale problems
- Krylov-subspace methods for the Sylvester equation
- Multiparameter eigenvalue problems and expansion theorems
- Numerical methods for large eigenvalue problems
- On the minimal eigenvalue of a positive definite operator determinant
- Separable boundary-value problems in physics
- Spectral collocation solutions to multiparameter Mathieu's system
Cited in
(12)- Solving two-parameter eigenvalue problems using an alternating method
- Computing several eigenvalues of nonlinear eigenvalue problems by selection
- Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints
- Spectral collocation for multiparameter eigenvalue problems arising from separable boundary value problems
- Numerical methods for nonlinear two-parameter eigenvalue problems
- Nonlinearizing Two-parameter Eigenvalue Problems
- Linearizable eigenvector nonlinearities
- Nonlinear multiparameter eigenvalue problems in aeroelasticity
- BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices
- On properties and numerical computation of critical points of eigencurves of bivariate matrix pencils
- A Sylvester equation approach for the computation of zero-group-velocity points in waveguides
- A Newton method for solving locally definite multiparameter eigenvalue problems by multi-index
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)
