Arbitrary High-Order Finite Element Schemes and High-Order Mass Lumping
- 1 October 2007
- journal article
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 17 (3) , 375-393
Abstract
International audienceComputers are becoming sufficiently powerful to permit to numerically solve problems such as the wave equation with high-order methods. In this article we will consider Lagrange finite elements of order k and show how it is possible to automatically generate the mass and stiffness matrices of any order with the help of symbolic computation software. We compare two high-order time discretizations: an explicit one using a Taylor expansion in time (a Cauchy-Kowalewski procedure) and an implicit Runge-Kutta scheme. We also construct in a systematic way a high-order quadrature which is optimal in terms of the number of points, which enables the use of mass lumping, up to P5 elements. We compare computational time and effort for several codes which are of high order in time and space and study their respective propertiesKeywords
This publication has 7 references indexed in Scilit:
- Numerical Methods for Ordinary Differential Equations2003
- ADER: Arbitrary High Order Godunov ApproachJournal of Scientific Computing, 2002
- Higher-Order Numerical Methods for Transient Wave Equations2002
- Higher Order Triangular Finite Elements with Mass Lumping for the Wave EquationSIAM Journal on Numerical Analysis, 2001
- Higher-order triangular and tetrahedral finite elements with mass lumping for solving the wave equationJournal of Engineering Mathematics, 1999
- Higher-order finite elements with mass-lumping for the 1D wave equationFinite Elements in Analysis and Design, 1994
- Systems of conservation lawsCommunications on Pure and Applied Mathematics, 1960