Abstract
We present a new class of adaptivity algorithms for time-dependent partial differential equations (PDE) that combine adaptive higher-order finite elements ( hp-FEM) in space with arbitrary (embedded, higher-order, implicit) Runge–Kutta methods in time. Weak formulation is only created for the stationary residual, and the Runge–Kutta methods are specified via their Butcher’s tables. Around 30 Butcher’s tables for various Runge–Kutta methods with numerically verified orders of local and global truncation errors are provided. A time-dependent benchmark problem with known exact solution that contains a sharp moving front is introduced, and it is used to compare the quality of seven embedded implicit higher-order Runge–Kutta methods. Numerical experiments also include a comparison of adaptive low-order FEM and hp-FEM with dynamically changing meshes. All numerical results presented in this paper were obtained using the open source library Hermes ( http://www.hpfem.org/hermes) and they are reproducible in the Networked Computing Laboratory (NCLab) at http://www.nclab.com.
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 callDisclaimer: 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.
