.png){kind=icon}
Return
A Jacobi-Davidson method for solving complex symmetric eigenvalue problems
.png){kind=icon}
OA
AI
DOI：10.1137/S1064827502410992.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We discuss variants of the Jacobi-Davidson method for solving the generalized complex symmetric eigenvalue problem. The Jacobi-Davidson algorithm can be considered as an accelerated inexact Rayleigh quotient iteration. We show that it is appropriate to replace the Euclidean inner product in C-n with an indefinite inner product. The Rayleigh quotient based on this indefinite inner product leads to an asymptotically cubically convergent Rayleigh quotient iteration. Advantages of the method are illustrated by numerical examples. We deal with problems from electromagnetics that require the computation of interior eigenvalues. The main drawback that we experience in these particular examples is the lack of efficient preconditioners.
Keywords:
generalized complex symmetric eigenvalue problem
interior eigenvalues
Jacobi-Davidson algorithm
Rayleigh quotient iteration
cubic convergence
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
NELL-1 Increased the Osteogenic Differentiation and mRNA Expression of Spheroids Composed of Stem Cells.png)
MedicinaOAAI
MedicinaIF0
OAAIShareSaveOpto-acoustic distance measurement using spread spectrum techniques and carrier phase measurements
PREAI
ShareSave
ShareSaveShareSave
View more