Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
The authors investigate different eigensolvers to compute a small number (5-10) of the smallest eigenvalues of the homogeneous Helmholtz equation discretized by the finite element method. The practical background of this problem originates in accelerator physics where the lowest eigenmodes of resonant rf (radio frequency) accelerating structures are of central interest in the design phase. Discretization by finite elements leads to a real symmetric generalized matrix eigenvalue problem. Different eigenvalue solvers and preconditioners are carefully described and compared for a realistic, practical application problem. These are especially the Jacobi-Davidson algorithm, the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm and a multilevel preconditioner which combines a hierarchical basis and a smoothed aggregation algebraic multigrid (AMG) preconditioner. As a result of the extensive study the Jacobi-Davidson algorithms turns out to be superior to LOBPCG for the given Maxwell eigenvalue problem. The well-compiled study gives important information for further research not only in the field of Maxwell's eigenvalue problem.
- scientific article; zbMATH DE number 1305048
- A two-level preconditioned Helmholtz-Jacobi-Davidson method for the Maxwell eigenvalue problem
- A comparison of solvers for large eigenvalue problems occuring in the design of resonant cavities
- Algebraic multigrid preconditioning for iterative eigensolvers
- A Comparison of Factorization-Free Eigensolvers with Application to Cavity Resonators
- A comparison of solvers for large eigenvalue problems occuring in the design of resonant cavities
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A Supernodal Approach to Sparse Partial Pivoting
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- An algebraic multigrid method for finite element discretizations with edge elements
- An Improved Algebraic Multigrid Method for Solving Maxwell's Equations
- ARPACK Users' Guide
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- Finite element approximation of the Navier-Stokes equations
- scientific article; zbMATH DE number 3943253 (Why is no real title available?)
- scientific article; zbMATH DE number 3696612 (Why is no real title available?)
- scientific article; zbMATH DE number 967332 (Why is no real title available?)
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Mixed and penalty formulations for finite element analysis of an eigenvalue problem in electromagnetism
- Multilevel Method for Mixed Eigenproblems
- Numerical Linear Algebra for High-Performance Computers
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- Software for simplified Lanczos and QMR algorithms
- Templates for the Solution of Algebraic Eigenvalue Problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Computing extremal eigenvalues for three-dimensional photonic crystals with wave vectors near the Brillouin zone center
- On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices
- A comparison of solvers for large eigenvalue problems occuring in the design of resonant cavities
- A large-scale nonlinear eigensolver for the analysis of dispersive nanostructures
- An extended basis inexact shift-invert Lanczos for the efficient solution of large-scale generalized eigenproblems
- A robust numerical algorithm for computing Maxwell's transmission eigenvalue problems
- A null space free Jacobi-Davidson iteration for Maxwell's operator
- A fast multigrid-based electromagnetic eigensolver for curved metal boundaries on the Yee mesh
- scientific article; zbMATH DE number 1305048 (Why is no real title available?)
- scientific article; zbMATH DE number 2042647 (Why is no real title available?)
- Matrix representation of the double-curl operator for simulating three dimensional photonic crystals
- A Comparison of Factorization-Free Eigensolvers with Application to Cavity Resonators
- Sensitivity analysis for Maxwell eigenvalue problems in industrial applications
- A two-level preconditioned Helmholtz-Jacobi-Davidson method for the Maxwell eigenvalue problem
- GPU-accelerated LOBPCG method with inexact null-space filtering for solving generalized eigenvalue problems in computational electromagnetics analysis with higher-order FEM
- Block preconditioning for saddle point systems with indefinite (1, 1) block
- Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations
- Numerical approximation based on a decoupled dimensionality reduction scheme for Maxwell eigenvalue problem
- An efficient decoupled and dimension reduction scheme for quad-curl eigenvalue problem in balls and spherical shells
- Eigendecompositions and fast eigensolvers for Maxwell equations
This page was built for publication: Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557926)
