Efficient Adaptive Mesh Refinement Using Superposition for Discontinuous Galerkin Methods
The Julia Programming Language via YouTube
Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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