Multilevel preconditioners for solving eigenvalue problems occuring in the design of resonant cavities
نویسندگان
چکیده
We investigate eigensolvers for computing a few of the smallest eigenvalues of a generalized eigenvalue problem resulting from the finite element discretization of the time independent Maxwell equation. Various multilevel preconditioners are employed to improve the convergence and memory consumption of the JacobiDavidson algorithm and of the locally optimal block preconditioned conjugate gradient (LOBPCG) method. We present numerical results of very large eigenvalue problems originating from the design of resonant cavities of particle accelerators.
منابع مشابه
Local and Parallel Finite Element Algorithm Based on Multilevel Discretization for Eigenvalue Problems
In this paper, a local and parallel algorithm based on the multilevel discretization is proposed for solving the eigenvalue problem by the finite element method. With this new scheme, the eigenvalue problem solving in the finest grid is transferred to solutions of the eigenvalue problems on the coarsest mesh and a series of solutions of boundary value problems on each level mesh. Therefore this...
متن کاملNo . UIUCDCS - R - 2005 - 2540 UILU - ENG - 2005 - 1744 Probing Methods for Generalized Saddle - Point Problems
Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...
متن کاملProbing Methods for Generalized Saddle-Point Problems
Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...
متن کاملProbing Methods for Saddle-point Problems
Abstract. Several Schur complement-based preconditioners have been proposed for solving (generalized) saddle-point problems. We consider matrices where the Schur complement has rapid decay over some graph known a priori. This occurs for many matrices arising from the discretization of systems of partial differential equations, and this graph is then related to the mesh. We propose the use of pr...
متن کاملMultilevel NDA Methods for Solving Multigroup Eigenvalue Neutron Transport Problems
The nonlinear diffusion acceleration (NDA) method is an efficient and flexible transport iterative scheme for solving reactor-physics problems. This paper presents a fast iterative algorithm for solving multigroup neutron transport eigenvalue problems in one-dimensional slab geometry. The proposed method is defined by a multilevel system of equations that includes multigroup and effective onegr...
متن کامل