Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations

Details Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations

2011-04-21

arxiv.org/abs/1104.4208v2

Numerical and Symbolic Scientific Computing: Progress and Prospects (Texts & Monographs in Symbolic Computation, Volume 1) pp.

Mathematics

Numerical Analysis

16 pages, 1 figure, 1 table; Springer Wien, ISBN 978-3-7091-0793-5

Scientific paper

10.1007/978-3-7091-0794-2_6

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.

Affiliated with

Also associated with

No associations

Rating

Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer Algebra meets Finite Elements: an Efficient Implementation for Maxwell's Equations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178021