Skip to main content

Computer Algebra Meets Finite Elements: An Efficient Implementation for Maxwell’s Equations

  • Chapter
  • First Online:
Numerical and Symbolic Scientific Computing

Abstract

We consider the numerical discretization of the time-domain Maxwell’s equations with an energy-conserving discontinuous Galerkin finite element formulation. This particular formulation allows for higher order approximations of the electric and magnetic field. Special emphasis is placed on an efficient implementation which is achieved by taking advantage of recurrence properties and the tensor-product structure of the chosen shape functions. These recurrences have been derived symbolically with computer algebra methods reminiscent of the holonomic systems approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Notes

  1. 1.

    These are polynomials which are products of univariate polynomials.

  2. 2.

    Values at a boundary.

  3. 3.

    Extensions to 3D are straightforward.

References

  1. Arnold, D.N., Brezzi, F., Cockburn, B., Marini, D.: Unified analysis of discontinuous Galerkin methods for elliptic problems. SIAM J. Numer. Anal. 39(5), 1749–1779 (2002)

    Google Scholar 

  2. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck, Innsbruck, Austria (1965)

    Google Scholar 

  3. Chyzak, F.: An extension of Zeilberger’s fast algorithm to general holonomic functions. Discrete Math. 217(1–3), 115–134 (2000)

    Google Scholar 

  4. Cohen, G., Ferries, X., Pernet, S.: A spatial high-order hexahedral discontinuous Galerkin method to solve Maxwell’s equations in time domain. J. Comput. Phys. 217, 340–363 (2006)

    Google Scholar 

  5. Dubiner, M.: Spectral methods on triangles and other domains. J. Sci. Comput. 6(4), 345–390 (1991)

    Google Scholar 

  6. Hesthaven, J.S., Warburton, T.: Nodal Discontinuous Galerkin Methods–Algorithms, Analysis and Applications. Text in Applied Mathematics. Springer, Berlin (2007)

    Google Scholar 

  7. Hesthaven, J.S., Warburton, T.: On the constants in hp-finite element trace inverse inequalities. Comput. Methods Appl. Mech. Eng. 192, 2765–2773 (2003)

    Google Scholar 

  8. Houston, P., Perugia, I., Schötzau, D.: Mixed discontinuous Galerkin approximation of the Maxwell operator. SIAM J. Numer. Anal. 42(1), 434–459 (2004)

    Google Scholar 

  9. Karniadakis, G.E., Sherwin, S.J.: Spectral/hp Element Methods for Computational Fluid Dynamics. Oxford Science Publications, Oxford (2005)

    Google Scholar 

  10. Koutschan, C. Advanced Applications of the Holonomic Systems Approach. Ph.D. thesis, RISC, Johannes Kepler University, Linz, Austria (2009)

    Google Scholar 

  11. Perugia, I., Schötzau, D., Monk, P.: Stabilized interior penalty methods for the time-harmonic Maxwell equations. Comput. Methods Appl. Mech. Eng. 191, 4675–4697 (2002)

    Google Scholar 

  12. Pillwein, V.: Computer Algebra Tools for Special Functions in High Order Finite Element Methods. Ph.D. thesis, Johannes Kepler University, Linz, Austria (2008)

    Google Scholar 

  13. Zeilberger, D.: A holonomic systems approach to special functions identities. J. Comput. Appl. Math. 32(3), 321–368 (1990)

    Google Scholar 

Download references

Acknowledgements

We would like to thank Veronika Pillwein for making contact between the first- and the last-named author and for kindly supporting our work by interpreting between the languages of symbolics and numerics. Christoph Koutschan was supported by the Austrian Science Fund (FWF): SFB F013 and P20162-N18, and partially by NFS-DMS 0070567 as a postdoctoral fellow.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag/Wien

About this chapter

Cite this chapter

Koutschan, C., Lehrenfeld, C., Schöberl, J. (2012). Computer Algebra Meets Finite Elements: An Efficient Implementation for Maxwell’s Equations. In: Langer, U., Paule, P. (eds) Numerical and Symbolic Scientific Computing. Texts & Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0794-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-0794-2_6

  • Published:

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-7091-0793-5

  • Online ISBN: 978-3-7091-0794-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics