Abstract
Arbitrary High-Order Finite Element Schemes and High-Order Mass LumpingComputers 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 orderkand 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 toP5elements. We compare computational time and effort for several codes which are of high order in time and space and study their respective properties.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Mathematics and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
