The approximation of the Maxwell eigenvalue problem using a least-squares method

  • Bramble J
  • Kolev T
  • Pasciak J
37Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

In this paper we consider an approximation to the Maxwell's eigenvalue problem based on a very weak formulation of two div-curl systems with complementary boundary conditions. We formulate each of these div-curl systems as a general variational problem with different test and trial spaces, i.e., the solution space is Ä 2 (Ω) ≡ (L 2 (Ω)) 3 and components in the test spaces are in subspaces of H 1 (Ω), the Sobolev space of order one on the computational domain Ω. A finite-element least-squares approximation to these variational problems is used as a basis for the approximation. Using the structure of the continuous eigenvalue problem, a discrete approximation to the eigenvalues is set up involving only the approximation to either of the div-curl systems. We give some theorems that guarantee the convergence of the eigenvalues to those of the continuous problem without the occurrence of spurious values. Finally, some results of numerical experiments are given.

Cite

CITATION STYLE

APA

Bramble, J. H., Kolev, T. V., & Pasciak, J. E. (2005). The approximation of the Maxwell eigenvalue problem using a least-squares method. Mathematics of Computation, 74(252), 1575–1599. https://doi.org/10.1090/s0025-5718-05-01759-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free