Skip to main content

A Substructuring Preconditioner for Three-Dimensional Maxwell’s Equations

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 91))

Summary

We propose a new nonoverlapping domain decomposition preconditioner for the discrete system arising from the edge element discretization of the three-dimensional Maxwell’s equations. This preconditioner uses the simplest coarse edge element space induced by the coarse triangulation. We will show that the rate of the PCG convergence with this substructuring preconditioner is quasi-optimal, and is independent of large variations of the coefficients across the local interfaces.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. A. Alonso and A. Valli. Some remarks on the characterization of the space of tangential traces of H(curl; Ω) and the construction of an extension operator. Manuscr. Math., 89: 159–178, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. Alonso and A. Valli. An optimal domain decomposition preconditioner for low-frequency time-harmonic maxwell equations. Math. Comp., 68(6):607–631, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Bramble, J. Pasciak, and A. Schatz. The construction of preconditioner for elliptic problems by substructuring. IV. Math. Comp., 53(5):1–24, 1989.

    MathSciNet  MATH  Google Scholar 

  4. M. Cessenat. Mathematical methods in electromagnetism. World Scientific, River Edge, NJ, 1998.

    Google Scholar 

  5. Z. Chen, Q. Du, and J. Zou. Finite element methods with matching and non-matching meshes for maxwell equations with discontinuous coefficients. SIAM J. Numer. Anal., 37:1542–1570, 1999.

    Article  MathSciNet  Google Scholar 

  6. P. Ciarlet, Jr., and J. Zou. Fully discrete finite element approaches for time-dependent maxwell’s equations. Numer. Math., 82(8):193–219, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  7. C. R. Dohrmann and O. Widlund. An iterative substructuring algorithm for two-dimensional problems in H(curl). Technical report, TR2010-936, Courant Institute, New York, 2010.

    Google Scholar 

  8. R. Hiptmair. Finite elements in computational electromagnetism. Acta Numerica, 11:237–339, 2002.

    Article  MathSciNet  MATH  Google Scholar 

  9. Q. Hu and J. Zou. A non-overlapping domain decomposition method for maxwell’s equations in three dimensions. SIAM J. Numer. Anal., 41: 1682–1708, 2003.

    Article  MathSciNet  MATH  Google Scholar 

  10. Q. Hu and J. Zou. Substructuring preconditioners for saddle-point problems arising from maxwell’s equations in three dimensions. Math. Comput., 73:35–61, 2004.

    MathSciNet  MATH  Google Scholar 

  11. P. Monk. Analysis of a finite element method for maxwell’s equations. SIAM J. Numer. Anal., 29:32–56, 1992.

    Article  MathSciNet  Google Scholar 

  12. P. Monk. Finite Element Methods for Maxwell’s Equations. Oxford University Press, Oxford, 2003.

    Book  MATH  Google Scholar 

  13. J. Nedelec. Mixed finite elements in R 3. Numer. Math., 35:315–341, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  14. A. Toselli. Dual-primal FETI algorithms for edge finite-element approximations in 3d. IMA J. Numer. Anal., 26:96–130, 2006.

    Article  MathSciNet  MATH  Google Scholar 

  15. A. Toselli and O. Widlund. Domain Decomposition Methods – Algorithms and Theory. Springer, New York, 2004.

    Google Scholar 

  16. A. Toselli, O. Widlund, and B. Wohlmuth. An iterative substructuring method for Maxwell’s equations in two dimensions. Math. Comp., 70: 935–949, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. Xu and Y. Zhu. Uniform convergent multigrid methods for elliptic problems with strongly discontinuous coefficients. M 3 AS, 18:77–105, 2008.

    Google Scholar 

  18. J. Xu and J. Zou. Some non-overlapping domain decomposition methods. SIAM Review, 40:857–914, 1998.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

QH was supported by the Major Research Plan of Natural Science Foundation of China G91130015, the Key Project of Natural Science Foundation of China G11031006 and National Basic Research Program of China G2011309702. SS was supported by NSFC Project 91130002 and 11171281, the project of Scientific Research Fund of Hunan Provincial Education Department 10C1265 and 11C1219, and the project of Xiangtan University 10XZX03. JZ was substantially supported by Hong Kong RGC grant (Project 405110) and a Direct Grant from Chinese University of Hong Kong.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qiya Hu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, Q., Shu, S., Zou, J. (2013). A Substructuring Preconditioner for Three-Dimensional Maxwell’s Equations. In: Bank, R., Holst, M., Widlund, O., Xu, J. (eds) Domain Decomposition Methods in Science and Engineering XX. Lecture Notes in Computational Science and Engineering, vol 91. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35275-1_7

Download citation

Publish with us

Policies and ethics