Semi-Discrete Formulations for 1D Burgers Equation
Abstract
In this work we compare semi-discrete formulations to obtain numerical solutions for the 1D Burgers equation. The formulations consist in the discretization of the time-domain via multi-stage methods of second and fourth order: R11 and R22 Pad\'e approximants, and of the spatial-domain via finite element methods: least-squares (MEFMQ), Galerkin (MEFG) and Streamline-Upwind Petrov-Galerkin (SUPG). Knowing the analytical solutions of the 1D Burgues equation, for different initial and boundary conditions, analyzes were performed for numerical errors from L2 and L∈finity norm. We found that the R22 Pad\'e approximants, added to the MEFMQ, MEFG, and SUPG formulations, increased the region of convergence of the numerical solutions, and showed greater accuracy when compared to the solutions obtained by the R11 Pad\'e approximants. We note that the R22 Pad\'e approximants softened the oscillations of the numerical solutions associated to the MEFG and SUPG formulations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.