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

  • Koutschan C
  • Lehrenfeld C
  • Schöberl J
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Koutschan, C., Lehrenfeld, C., & Schöberl, J. (2012). Computer Algebra Meets Finite Elements: An Efficient Implementation for Maxwell’s Equations (pp. 105–121). https://doi.org/10.1007/978-3-7091-0794-2_6

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