Computational lower bounds of the Maxwell eigenvalues

DOI10.1137/21M1461447zbMATH Open1518.35581arXiv2110.02605MaRDI QIDQ6379529FDOQ6379529

Publication date: 6 October 2021

Abstract: A method to compute guaranteed lower bounds to the eigenvalues of the Maxwell system in two or three space dimensions is proposed as a generalization of the method of Liu and Oishi [SIAM J. Numer. Anal., 51, 2013] for the Laplace operator. The main tool is the computation of an explicit upper bound to the error of the Galerkin projection. The error is split in two parts: one part is controlled by a hypercircle principle and an auxiliary eigenvalue problem. The second part requires a perturbation argument for the right-hand side replaced by a suitable piecewise polynomial. The latter error is controlled through the use of the commuting quasi-interpolation by Falk--Winther and computational bounds on its stability constant. This situation is different from the Laplace operator where such a perturbation is easily controlled through local Poincar'e inequalities. The practical viability of the approach is demonstrated in test cases for two and three space dimensions.

Mathematics Subject Classification ID

Maxwell equations (35Q61) Laplace transform (44A10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) 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) Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory (78M10)

This page was built for publication: Computational lower bounds of the Maxwell eigenvalues

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