Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations
Numerical Analysis
2012-01-10 v2 Symbolic Computation
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
@article{arxiv.1104.4208,
title = {Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations},
author = {Christoph Koutschan and Christoph Lehrenfeld and Joachim Schoeberl},
journal= {arXiv preprint arXiv:1104.4208},
year = {2012}
}
Comments
16 pages, 1 figure, 1 table; Springer Wien, ISBN 978-3-7091-0793-5