Efficient Adaptive Mesh Refinement Using Superposition for Discontinuous Galerkin Methods
The Julia Programming Language via YouTube
Python, Prompt Engineering, Data Science — Build the Skills Employers Want Now
The Fastest Way to Become a Backend Developer Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the implementation of data structures and algorithms for adaptive mesh refinement (AMR) in this 18-minute conference talk from FerriteCon 2024. Learn about an innovative approach using superposition rather than substitution, specifically designed for problems utilizing discontinuous Galerkin methods for local timestepping. Discover how this optimization technique enhances the refinement process by recalculating local matrices only for updated cells, effectively minimizing computational overhead and improving efficiency in numerical simulations.
Syllabus
Welcome!
Help us add time stamps or captions to this video! See the description for details.
Taught by
The Julia Programming Language