arXiv subjects

Philipp Öffner

Publications and source records attributed to Philipp Öffner.

At least 55 records · Page 3Linked to original sources

arXiv2021

Relaxation Deferred Correction Methods and their Applications to Residual Distribution Schemes

In [1] is proposed a simplified DeC method, that, when combined with the residual distribution (RD) framework, allows to construct a high order, explicit FE scheme with continuous approximation avoiding the inversion of the mass matrix for hyperbolic problems. In this paper, we close some open gaps in the context of deferred correction (DeC) and their application within the RD framework. First, we demonstrate the connection between the DeC schemes and the RK methods. With this knowledge, DeC can be rewritten as a convex combination of explicit Euler steps, showing the connection to the strong stability preserving (SSP) framework. Then, we can apply the relaxation approach introduced in [2] and construct entropy conservative/dissipative DeC (RDeC) methods, using the entropy correction function proposed in [3]. [1] R. Abgrall. High order schemes for hyperbolic problems using globally continuous approximation and avoiding mass matrices. Journal of Scientific Computing, 73(2):461--494, Dec 2017. [2] D. Ketcheson. Relaxation Runge--Kutta methods: Conservation and stability for inner-product norms. SIAM Journal on Numerical Analysis, 57(6):2850--2870, 2019. [3] R. Abgrall. A general framework to construct schemes satisfying additional conservation relations. application to entropy conservative and entropy dissipative schemes. Journal of Computational Physics, 372:640--666, 2018.

math.NA↗

arXiv2021

Analysis of the SBP-SAT Stabilization for Finite Element Methods Part I: Linear Problems

In the hyperbolic community, discontinuous Galerkin approaches are mainly applied when finite element methods are considered. As the name suggested, the DG framework allows a discontinuity at the element interfaces, which seems for many researchers a favorable property in case of hyperbolic balance laws. On the contrary, continuous Galerkin method obtained from a straightforward discretisation of the weak form of the PDEs appear to be unsuitable for hyperbolic problems. To remedy this issue, stabilization terms are usually added and various formulations can be found in the literature. There exists still the perception that continuous Galerkin methods are not suited to hyperbolic problems, and the reason of this is the continuity of the approximation. However, this perception is not true and the stabilization terms can be removed, in general, provided the boundary conditions are suitable. In this paper, we deal with this problem, and present a different approach. We use the boundary conditions to stabilize the scheme following a procedure that are frequently used in the finite difference community. Here, the main idea is to impose the boundary conditions weakly and specific boundary operators are constructed such that they guarantee stability. This approach has already been used in the DG framework, but here we apply it with a continuous Galerkin scheme. No internal dissipation is needed even if unstructured grids are used. Further, we point out that we do not need exact integration, it suffices if the quadrature rule and the norm in the differential operator are the same, such that the summation-by-parts (SBP) property is fulfilled meaning that a discrete Gauss Th. is valid. This contradicts the perception in the hyperbolic community that stability issues for pure Galerkin scheme exist. In numerical simulations, we verify our theoretical analysis.

math.NA↗

arXiv2021

Towards Stable Radial Basis Function Methods for Linear Advection Problems

In this work, we investigate (energy) stability of global radial basis function (RBF) methods for linear advection problems. Classically, boundary conditions (BC) are enforced strongly in RBF methods. By now it is well-known that this can lead to stability problems, however. Here, we follow a different path and propose two novel RBF approaches which are based on a weak enforcement of BCs. By using the concept of flux reconstruction and simultaneous approximation terms (SATs), respectively, we are able to prove that both new RBF schemes are strongly (energy) stable. Numerical results in one and two spatial dimensions for both scalar equations and systems are presented, supporting our theoretical analysis.

math.NA↗

arXiv2021

DeC and ADER: Similarities, Differences and a Unified Framework

In this paper, we demonstrate that the explicit ADER approach as it is used inter alia in [1] can be seen as a special interpretation of the deferred correction (DeC) method as introduced in [2]. By using this fact, we are able to embed ADER in a theoretical background of time integration schemes and prove the relation between the accuracy order and the number of iterations which are needed to reach the desired order. Next, we extend our investigation to stiff ODEs, treating these source terms implicitly. Some differences in the interpretation and implementation can be found. Using DeC yields typically a much simpler implementation, while ADER benefits from a higher accuracy, at least for our numerical simulations. Then, we also focus on the PDE case and present common space-time discretizations using DeC and ADER in closed forms. Finally, in the numerical section we investigate A-stability for the ADER approach - this is done for the first time up to our knowledge - for different order using several basis functions and compare them with the DeC ansatz. Then, we compare the performance of ADER and DeC for stiff and non-stiff ODEs and verify our analysis focusing on two basic hyperbolic problems. [1] O. Zanotti, F. Fambri, M. Dumbser, and A. Hidalgo. Space-time adaptive ader discontinuous galerkin finite element schemes with a posteriori sub-cell finite volume limiting. Computers & Fluids, 118:204-224, 2015. [2] A. Dutt, L. Greengard, and V. Rokhlin. Spectral Deferred Correction Methods for Ordinary Differential Equations. BIT Numerical Mathematics, 40(2):241-266, 2000.

math.NA↗

arXiv2020

General polytopal H(div) conformal finite elements and their discretisation spaces

We present a class of discretisation spaces and H(div)-conformal elements that can be built on any polytope. Bridging the flexibility of the Virtual Element spaces towards the element's shape with the divergence properties of the Raviart-Thomas elements on the boundaries, the designed frameworks offer a wide range of H(div)-conformal discretisations. As those elements are set up through degrees of freedom, their definitions are easily amenable to the properties the approximated quantities are wished to fulfill. Furthermore, we show that one straightforward restriction of this general setting share its properties with the classical Raviart-Thomas elements at each interface, for any order and any polytopial shape. Then, to close the introduction of those new elements by an example, we investigate the shape of the basis functions corresponding to particular elements in the two dimensional case.

math.NA↗

arXiv2019

Error boundedness of Correction Procedure via Reconstruction / Flux Reconstruction

We study the long-time error behavior of correction procedure via reconstruction / flux reconstruction (CPR/FR) methods for linear hyperbolic conservation laws. We show that not only the choice of the numerical flux (upwind or central) affects the growth rate and asymptotic value of the error, but that the selection of bases (Gauß-Lobatto or Gauß-Legendre) is even more important. Using a Gauß-Legendre basis, the error reaches the asymptotic value faster and to a lower value than when using a Gauß-Lobatto basis. Also, the differences in the error caused by the numerical flux are not essential for low resolution computations in the Gauß-Legendre case. This behavior is better seen on a particular FR scheme which has a strong connection with the discontinuous Galerkin framework but holds also for other flux reconstruction schemes with low order resolution computations.

math.NA↗

arXiv2019

Analysis of the SBP-SAT Stabilization for Finite Element Methods Part II: Entropy Stability

In the research community, there exists the strong belief that a continuous Galerkin scheme is notoriously unstable and additional stabilization terms have to be added to guarantee stability. In the first part of the series [6], the application of simultaneous approximation terms for linear problems is investigated where the boundary conditions are imposed weakly. By applying this technique, the authors demonstrate that a pure continuous Galerkin scheme is indeed linear stable if the boundary conditions are done in the correct way. In this work, we extend this investigation to the non-linear case and focusing on entropy conservation. Switching to entropy variables, we will provide an estimation on the boundary operators also for non-linear problems to guarantee conservation. In numerical simulations, we verify our theoretical analysis.

math.NA↗

arXiv2019

Analysis of Artificial Dissipation of Explicit and Implicit Time-Integration Methods

Stability is an important aspect of numerical methods for hyperbolic conservation laws and has received much interest. However, continuity in time is often assumed and only semidiscrete stability is studied. Thus, it is interesting to investigate the influence of explicit and implicit time integration methods on the stability of numerical schemes. If an explicit time integration method is applied, spacially stable numerical schemes for hyperbolic conservation laws can result in unstable fully discrete schemes. Focusing on the explicit Euler method (and convex combinations thereof), undesired terms in the energy balance trigger this phenomenon and introduce an erroneous growth of the energy over time. In this work, we study the influence of artificial dissipation and modal filtering in the context of discontinuous spectral element methods to remedy these issues. In particular, lower bounds on the strength of both artificial dissipation and modal filtering operators are given and an adaptive procedure to conserve the (discrete) $\mathbf{L}_2$ norm of the numerical solution in time is derived. This might be beneficial in regions where the solution is smooth and for long time simulations. Moreover, this approach is used to study the connections between explicit and implicit time integration methods and the associated energy production. By adjusting the adaptive procedure, we demonstrate that filtering in explicit time integration methods is able to mimic the dissipative behavior inherent in implicit time integration methods. This contribution leads to a better understanding of existing algorithms and numerical techniques, in particular the application of artificial dissipation as well as modal filtering in the context of numerical methods for hyperbolic conservation laws together with the selection of explicit or implicit time integration methods.

math.NA↗

arXiv2019

Arbitrary high-order, conservative and positive preserving Patankar-type deferred correction schemes

Production-destruction systems (PDS) of ordinary differential equations (ODEs) are used to describe physical and biological reactions in nature. The considered quantities are subject to natural laws. Therefore, they preserve positivity and conservation of mass at the analytical level. In order to maintain these properties at the discrete level, the so-called modified Patankar-Runge-Kutta (MPRK) schemes are often used in this context. However, up to our knowledge, the family of MPRK has been only developed up to third order of accuracy. In this work, we propose a method to solve PDS problems, but using the Deferred Correction (DeC) process as a time integration method. Applying the modified Patankar approach to the DeC scheme results in provable conservative and positivity preserving methods. Furthermore, we demonstrate that these modified Patankar DeC schemes can be constructed up to arbitrarily high order. Finally, we validate our theoretical analysis through numerical simulations.

math.NA↗

arXiv2019

A class of finite dimensional spaces and H(div) conformal elements on general polytopes

We present a class of discretisation spaces and H(div)-conformal elements that can be built on any polytope. Bridging the flexibility of the Virtual Element spaces towards the element's shape with the divergence properties of the Raviart-Thomas elements on the boundaries, the designed frameworks offer a wide range of H(div)-conformal discretisations. As those elements are set up through degrees of freedom, their definitions are easily amenable to the properties the approximated quantities are wished to fulfil. Furthermore, we show that one straightforward restriction of this general setting share its properties with the classical Raviart-Thomas elements at each interface, for any order and any polytopial shape. Then, we investigate the shape of the basis functions corresponding to particular elements in the two dimensional case.

math.NA↗

arXiv2018

Error Boundedness of Discontinuous Galerkin Methods with Variable Coefficients

For practical applications, the long time behaviour of the error of numerical solutions to time-dependent partial differential equations is very important. Here, we investigate this topic in the context of hyperbolic conservation laws and flux reconstruction schemes, focusing on the schemes in the discontinuous Galerkin spectral element framework. For linear problems with constant coefficients, it is well-known in the literature that the choice of the numerical flux (e.g. central or upwind) and the selection of the polynomial basis (e.g. Gauß-Legendre or Gauß-Lobatto-Legendre) affects both the growth rate and the asymptotic value of the error. Here, we extend these investigations of the long time error to variable coefficients using both Gauß-Lobatto-Legendre and Gauß-Legendre nodes as well as several numerical fluxes. We derive conditions guaranteeing that the errors are still bounded in time. Furthermore, we analyse the error behaviour under these conditions and demonstrate in several numerical tests similarities to the case of constant coefficients. However, if these conditions are violated, the error shows a completely different behaviour. Indeed, by applying central numerical fluxes, the error increases without upper bound while upwind numerical fluxes can still result in uniformly bounded numerical errors. An explanation for this phenomenon is given, confirming our analytical investigations.

math.NA↗

arXiv2018

Stability of Correction Procedure via Reconstruction With Summation-by-Parts Operators for Burgers' Equation Using a Polynomial Chaos Approach

In this paper, we consider Burgers' equation with uncertain boundary and initial conditions. The polynomial chaos (PC) approach yields a hyperbolic system of deterministic equations, which can be solved by several numerical methods. Here, we apply the correction procedure via reconstruction (CPR) using summation-by-parts operators. We focus especially on stability, which is proven for CPR methods and the systems arising from the PC approach. Due to the usage of split-forms, the major challenge is to construct entropy stable numerical fluxes. For the first time, such numerical fluxes are constructed for all systems resulting from the PC approach for Burgers' equation. In numerical tests, we verify our results and show also the advantage of the given ansatz using CPR methods. Moreover, one of the simulations, i.e. Burgers' equation equipped with an initial shock, demonstrates quite fascinating observations. The behaviour of the numerical solutions from several methods (finite volume, finite difference, CPR) differ significantly from each other. Through careful investigations, we conclude that the reason for this is the high sensitivity of the system to varying dissipation. Furthermore, it should be stressed that the system is not strictly hyperbolic with genuinely nonlinear or linearly degenerate fields.

math.NA↗

arXiv2018

Application of Modal Filtering to a Spectral Difference Method

We adapt the spectral viscosity (SV) formulation implemented as a modal filter to a Spectral Difference Method (SD) solving hyperbolic conservation laws. In the SD Method we use selections of different orthogonal polynomials (APK polynomials). Furthermore we obtain new error bounds for filtered APK extensions of smooth functions. We demonstrate that the modal filter also depends on the chosen polynomial basis in the SD Method. Spectral filtering stabilizes the scheme and leaves weaker oscillations. Hence, the selection of the family of orthogonal polynomials on triangles and their specific modal filter possesses a positive influence on the stability and accuracy of the SD Method. In the second part, we initiate a stability analysis for a linear scalar test case with periodic initial condition to find the best selection of APK polynomials and their specific modal filter. To the best of our knowledge, this work is the first that gives a stability analysis for a scheme with spectral filtering. Finally, we demonstrate the influence of the underlying basis of APK polynomials in a well-known test case.

math.NA↗

arXiv2017

Extended Skew-Symmetric Form for Summation-by-Parts Operators and Varying Jacobians

A generalised analytical notion of summation-by-parts (SBP) methods is proposed, extending the concept of SBP operators in the correction procedure via reconstruction (CPR), a framework of high-order methods for conservation laws. For the first time, SBP operators with dense norms and not including boundary points are used to get an entropy stable split-form of Burgers' equation. Moreover, overcoming limitations of the finite difference framework, stability for curvilinear grids and dense norms is obtained for SBP CPR methods by using a suitable way to compute the Jacobian.

math.NA↗

arXiv2016

On Hahn polynomial expansion of a continuous function of bounded variation

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$. We investigate the following problem: For which ratio $N/n$ and which functions, do we have pointwise convergence of the least square operator ${LS}_n^N:\mathcal{C}\left[-1,1\right]\rightarrow\mathcal{P}_n$? To solve this problem we investigate the relation between the Jacobi polynomials $P_k^{α,β}$ and the Hahn polynomials $Q_k\left(\cdot;α,β,N\right)$. Thereby we describe the least square operator ${LS}_n^N$ by the expansion of a function by Hahn polynomials. In particular we present the following result: The series expansion $\sum_{k=0}^n{\hat{f} Q_k}$ of a function $f$ by Hahn polynomials $Q_k$ converges pointwise, if the series expansion $\sum_{k=0}^n{\hat{f} P_k}$ of the function $f$ by Jacobi polynomials $P_k$ converges pointwise and if ${n^4}/N\rightarrow 0$ for $n,N\rightarrow\infty$. Furthermore we obtain the following result: Let $f\in\left\{g\in\mathcal{C}^1\left[-1,1\right]:g^\prime\in\mathcal{BV}\left[-1,1\right]\right\}$ and let $(N_n)_{n}$ be a sequence of natural numbers with ${n^4}/{N_n}\rightarrow 0$. Then the least square method ${LS}_n^{N_n}[f]$ converges for each $x\in[-1,1]$.

math.NA↗

arXiv2016

Spectral accuracy for the Hahn polynomials

We consider in this paper the Hahn polynomials and their application in numerical methods. The Hahn polynomials are classical discrete orthogonal polynomials. We analyse the behaviour of these polynomials in the context of spectral approximation of partial differential equations. We study series expansions $u=\sum_{n=0}^\infty \hat{u}_n ϕ_n$, where the $ϕ_n$ are the Hahn polynomials. We examine the Hahn coefficients and proof spectral accuracy in some sense. We substantiate our results by numericals tests. Furthermore we discuss a problem which arise by using the Hahn polynomials in the approximation of a function $u$, which is linked to the Runge phenomenon. We suggest two approaches to avoid this problem. These will also be the motivation and the outlook of further research in the application of discrete orthogonal polynomials in a spectral method for the numerical solution of hyperbolic conservation laws.

math.NA↗

arXiv2016

Enhancing stability of correction procedure via reconstruction using summation-by-parts operators I: Artificial dissipation

The correction procedure via reconstruction (CPR, also known as flux reconstruction) is a framework of high order semidiscretisations used for the numerical solution of hyperbolic conservation laws. Using a reformulation of these schemes relying on summation-by-parts (SBP) operators and simultaneous approximation terms (SATs), artificial dissipation / spectral viscosity operators are investigated in this first part of a series. Semidiscrete stability results for linear advection and Burgers' equation as model problems are extended to fully discrete stability by an explicit Euler method. As second part of this series, Glaubitz, Ranocha, Öffner, and Sonar (Enhancing stability of correction procedure via reconstruction using summation-by-parts operators II: Modal filtering, 2016) investigate connections to modal filters and their application instead of artificial dissipation.

math.NA↗

arXiv2016

Enhancing stability of correction procedure via reconstruction using summation-by-parts operators II: Modal filtering

A recently introduced framework of semidiscretisations for hyperbolic conservation laws known as correction procedure via reconstruction (CPR, also known as flux reconstruction) is considered in the extended setting of summation-by-parts (SBP) operators using simultaneous approximation terms (SATs). This reformulation can yield stable semidiscretisations for linear advection and Burgers' equation as model problems. In order to enhance these properties, modal filters are introduced to this framework. As a second part of a series, the results of Ranocha, Glaubitz, Öffner, and Sonar ("Enhancing stability of correction procedure via reconstruction using summation-by-parts operators I: Artificial dissipation", 2016) concerning artificial dissipation / spectral viscosity are extended, yielding fully discrete stable schemes. Additionally, a new adaptive strategy to compute the filter strength is introduced and different possible applications of modal filters are compared both theoretically and numerically.

math.NA↗