A two-level preconditioned Helmholtz-Jacobi-Davidson method for the Maxwell eigenvalue problem

DOI10.1090/MCOM/3702MaRDI QIDQ5029467zbMATH OpenOpenAlexFDO

Authors

Publication date 14 February 2022

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.03687

zbMATH Keywords

domain decompositionedge elementHelmholtz projectionJacobi-Davidson methodMaxwell eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Abstract: In this paper, based on a domain decomposition (DD) method, we shall propose an efficient two-level preconditioned Helmholtz-Jacobi-Davidson (PHJD) method for solving the algebraic eigenvalue problem resulting from the edge element approximation of the Maxwell eigenvalue problem. In order to eliminate the components in orthogonal complement space of the eigenvalue, we shall solve a parallel preconditioned system and a Helmholtz projection system together in fine space. After one coarse space correction in each iteration and minimizing the Rayleigh quotient in a small dimensional Davidson space, we finally get the error reduction of this two-level PHJD method as $gamma=c(H)(1-Cfracdelt{a}^2{H}^2)$, where $C$ is a constant independent of the mesh size $h$ and the diameter of subdomains $H$, $delta$ is the overlapping size among the subdomains, and $c(H)$ decreasing as $Ho0$, which means the greater the number of subdomains, the better the convergence rate. Numerical results supporting our theory shall be given.

Recommendations

• Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
• On the convergence of a two-level preconditioned Jacobi–Davidson method for eigenvalue problems
• A null space free Jacobi-Davidson iteration for Maxwell's operator
• Two-grid methods for Maxwell eigenvalue problems
• A two-level domain-decomposition preconditioner for the time-harmonic Maxwell's equations

Cites work

• A domain decomposition based Jacobi-Davidson algorithm for quantum dot simulation
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• A new family of mixed finite elements in \({\mathbb{R}}^ 3\)
• A two-grid discretization scheme for eigenvalue problems
• A two-level overlapping hybrid domain decomposition method for eigenvalue problems
• Acceleration of a two-grid method for eigenvalue problems
• An adaptive inverse iteration for Maxwell eigenvalue problem based on edge elements
• Computational Models of Electromagnetic Resonators: Analysis of Edge Element Approximation
• Discontinuous Galerkin computation of the Maxwell eigenvalues on simplicial meshes
• Finite element approximation of eigenvalue problems
• Finite element exterior calculus, homological techniques, and applications
• Finite elements in computational electromagnetism
• scientific article; zbMATH DE number 2113718 (Why is no real title available?)
• scientific article; zbMATH DE number 5681750 (Why is no real title available?)
• scientific article; zbMATH DE number 3239038 (Why is no real title available?)
• Mixed and penalty formulations for finite element analysis of an eigenvalue problem in electromagnetism
• Mixed finite elements in \(\mathbb{R}^3\)
• Multilevel Method for Mixed Eigenproblems
• On the convergence of a two-level preconditioned Jacobi–Davidson method for eigenvalue problems
• Overlapping Schwarz methods for Maxwell's equations in three dimensions
• Solving electromagnetic eigenvalue problems in polyhedral domains with nodal finite elements
• Some Estimates for a Weighted L 2 Projection
• Spectral Approximation for Compact Operators
• Two-grid finite element discretization schemes based on shifted-inverse power method for elliptic eigenvalue problems
• Two-grid methods for Maxwell eigenvalue problems
• Vector potentials in three-dimensional non-smooth domains

Cited in

(13)

• Application of the Jacobi-Davidson method for spectral low-rank preconditioning in computational electromagnetics problems
• Two-grid methods for Maxwell eigenvalue problems
• A null space free Jacobi-Davidson iteration for Maxwell's operator
• On the convergence of a two-level preconditioned Jacobi–Davidson method for eigenvalue problems
• Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
• Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem
• A Two-Level Preconditioned Helmholtz Subspace Iterative Method for Maxwell Eigenvalue Problems
• A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems
• A Two-Level Block Preconditioned Jacobi-Davidson Method for Multiple and Clustered Eigenvalues of Elliptic Operators
• Highly efficient Gauss's law-preserving spectral algorithms for Maxwell's double-curl source and eigenvalue problems based on eigen-decomposition
• On a sharp estimate of overlapping Schwarz methods in \(\boldsymbol{H}(\mathbf{curl}; \Omega)\) and \(\boldsymbol{H}(\mathrm{div}; \Omega)\)
• A new subspace iteration algorithm for solving generalized eigenvalue problems in vibration analysis
• A spurious-free mixed skeletal finite element method for Maxwell eigenvalue problem

Describes a project that uses

Uses Software

• JDQZ

This page was built for publication: A two-level preconditioned Helmholtz-Jacobi-Davidson method for the Maxwell eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5029467)