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

From MaRDI portal
Publication:2912117

DOI10.1007/978-3-7091-0794-2_6zbMATH Open1250.78042arXiv1104.4208OpenAlexW1857817569MaRDI QIDQ2912117FDOQ2912117

Christoph Koutschan, Christoph Lehrenfeld, Joachim Schöberl

Publication date: 14 September 2012

Published in: Texts & Monographs in Symbolic Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1104.4208






Cited In (6)

Uses Software






This page was built for publication: Computer Algebra Meets Finite Elements: An Efficient Implementation for Maxwell’s Equations

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