Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1806.02018

Error Boundedness of Discontinuous Galerkin Methods with Variable Coefficients

Philipp Öffner·Hendrik Ranocha
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philipp Öffner, Hendrik Ranocha. 2018-11-22. Error Boundedness of Discontinuous Galerkin Methods with Variable Coefficients. https://doi.org/10.1007/s10915-018-00902-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA↗
arXiv2026

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA↗
arXiv2026

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA↗