We investigate algorithms for solving large sparse symmetric matrix eigenvalue problems resulting from finite element discretizations of steady state electromagnetic fields in accelerating cavities. The methods have been applied to the new design of the accelerating cavity for the PSI 590 MeV ring cyclotron. The solutions of this kind of eigenvalue problems can be polluted by so-called spurious modes if the divergencefree condition is not treated properly. In this paper we deal with a method that suppresses spurious modes by adding a penalty term to the basic quadratic form. This is the method we had the best experience with [1, 2]. The large sparse eigenvalue problems have been solved with the implicitly restarted Lanczos algorithm. Numeri...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell ...
. We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwel...
The authors are interested in determining the electromagnetic fields within closed perfectly conduct...
We investigate eigensolvers for computing a few of the smallest eigenvalues of a generalized eigenva...
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computation...
We present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems ...
We present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems ...
We present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems ...
This paper presents two fast generalized eigenvalue solvers for sparse symmetric matrices that arise...
Omega3P is a parallel eigenmode calculation code for accelerator cavities in frequency domain analys...
The ability of computers to solve hitherto intractable problems and simulate complex processes using...
We discuss several techniques for nding leading eigenvalues and eigenvectors for large sparse matric...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell ...
. We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwel...
The authors are interested in determining the electromagnetic fields within closed perfectly conduct...
We investigate eigensolvers for computing a few of the smallest eigenvalues of a generalized eigenva...
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computation...
We present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems ...
We present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems ...
We present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems ...
This paper presents two fast generalized eigenvalue solvers for sparse symmetric matrices that arise...
Omega3P is a parallel eigenmode calculation code for accelerator cavities in frequency domain analys...
The ability of computers to solve hitherto intractable problems and simulate complex processes using...
We discuss several techniques for nding leading eigenvalues and eigenvectors for large sparse matric...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...