Related papers: Algorithms and Data Structures for Multi-Adaptive …
This paper reviews the adaptive sparse grid discontinuous Galerkin (aSG-DG) method for computing high dimensional partial differential equations (PDEs) and its software implementation. The C\texttt{++} software package called AdaM-DG,…
We apply the Postprocessing Galerkin method to a recently introduced continuous data assimilation (downscaling) algorithm for obtaining a numerical approximation of the solution of the two-dimensional Navier-Stokes equations corresponding…
A wide variety of different (fixed-point) iterative methods for the solution of nonlinear equations exists. In this work we will revisit a unified iteration scheme in Hilbert spaces from our previous work that covers some prominent…
We apply a space adaptive interior penalty discontinuous Galerkin method for solving advective Allen-Cahn equation with expanding and contracting velocity fields. The advective Allen-Cahn equation is first discretized in time and the…
The goal of this paper is to create a fruitful bridge between the numerical methods for approximating partial differential equations (PDEs) in fluid dynamics and the (iterative) numerical methods for dealing with the resulting large linear…
Training neural networks sequentially in time to approximate solution fields of time-dependent partial differential equations can be beneficial for preserving causality and other physics properties; however, the sequential-in-time training…
We present an adaptive methodology for the solution of (linear and) non-linear time dependent problems that is especially tailored for massively parallel computations. The basic concept is to solve for large blocks of space-time unknowns…
Locally refined meshes impose severe stability constraints on explicit time-stepping methods for the numerical simulation of time dependent wave phenomena. Local time-stepping methods overcome that bottleneck by using smaller time-steps…
We study dynamical Galerkin schemes for evolutionary partial differential equations (PDEs), where the projection operator changes over time. When selecting a subset of basis functions, the projection operator is non-differentiable in time…
We present a unified analysis for a family of variational time discretization methods, including discontinuous Galerkin methods and continuous Galerkin-Petrov methods, applied to non-stiff initial value problems. Besides the…
We propose a time-adaptive predictor/multi-corrector method to solve hyperbolic partial differential equations, based on the generalized-$\alpha$ scheme that provides user-control on the numerical dissipation and second-order accuracy in…
In this note we shall devise a variable-order continuous Galerkin time stepping method which is especially geared towards norm-preserving dynamical systems. In addition, we will provide an a posteriori estimate for the $L^\infty$-error.
We present a novel spatial discretization for the Cahn-Hilliard equation including transport. The method is given by a mixed discretization for the two elliptic operators, with the phase field and chemical potential discretized in…
In this paper, we propose a class of adaptive multiresolution (also called adaptive sparse grid) discontinuous Galerkin (DG) methods for simulating scalar wave equations in second order form in space. The two key ingredients of the schemes…
We propose a robust, adaptive coarse-grid correction scheme for matrix-free geometric multigrid targeting PDEs with strongly varying coefficients. The method combines uniform geometric coarsening of the underlying grid with heterogeneous…
The nonlocality of the fractional operator causes numerical difficulties for long time computation of the time-fractional evolution equations. This paper develops a high-order fast time-stepping discontinuous Galerkin finite element method…
We develop a general convergence theory for adaptive discontinuous Galerkin methods for elliptic PDEs covering the popular SIPG, NIPG and LDG schemes as well as all practically relevant marking strategies. Another key feature of the…
High-order Discontinuous Galerkin (DG) methods promise to be an excellent discretisation paradigm for partial differential equation solvers by combining high arithmetic intensity with localised data access. They also facilitate dynamic…
In this paper, we derive a practical, general framework for creating adaptive iterative (linearization or splitting) algorithms to solve multi-physics problems. This means that, given an iterative method, we derive \textit{a posteriori}…
This paper focuses on the adaptive discontinuous Galerkin (DG) methods for the tempered fractional (convection) diffusion equations. The DG schemes with interior penalty for the diffusion term and numerical flux for the convection term are…