An adaptive local discontinuous Galerkin method for nonlinear two-point boundary-value problems

Research output: Contribution to journalArticle

Abstract

In this paper, we propose an adaptive mesh refinement (AMR) strategy based on a posteriori error estimates for the local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form u′′=f(x,u),x∈[a,b] subject to some suitable boundary conditions at the endpoint of the interval [a, b]. We first use the superconvergence results proved in the first part of this paper as reported by Baccouch (Numer. Algorithm. 79(3), 697–718 2018) to show that the significant parts of the local discretization errors are proportional to (p + 1)-degree Radau polynomials, when polynomials of total degree not exceeding p are used. These new results allow us to construct a residual-based a posteriori error estimators which are obtained by solving a local residual problem with no boundary conditions on each element. The proposed error estimates are efficient, reliable, and asymptotically exact. We prove that, for smooth solutions, the proposed a posteriori error estimates converge to the exact errors in the L2-norm with order of convergence p + 3/2. Finally, we present a local AMR procedure that makes use of our local and global a posteriori error estimates. Our proofs are valid for arbitrary regular meshes and for Pp polynomials with p ≥ 1. Several numerical results are presented to validate the theoretical results and to show the efficiency of the grid refinement strategy.

Original languageEnglish (US)
JournalNumerical Algorithms
DOIs
StateAccepted/In press - Jan 1 2019

Fingerprint

Local Discontinuous Galerkin Method
Nonlinear Boundary Value Problems
Galerkin methods
Two-point Boundary Value Problem
Boundary value problems
A Posteriori Error Estimates
Adaptive Mesh Refinement
Polynomial
Boundary conditions
Grid Refinement
Polynomials
A Posteriori Error Estimators
Superconvergence
Discretization Error
Order of Convergence
Smooth Solution
Error Estimates
Directly proportional
Mesh
Valid

Keywords

  • A posteriori error estimates
  • Adaptive mesh refinement
  • Local discontinuous Galerkin method
  • Nonlinear two-point boundary-value problems
  • Superconvergence

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

@article{2494f90514be496a95fa0069d77e6ca1,
title = "An adaptive local discontinuous Galerkin method for nonlinear two-point boundary-value problems",
abstract = "In this paper, we propose an adaptive mesh refinement (AMR) strategy based on a posteriori error estimates for the local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form u′′=f(x,u),x∈[a,b] subject to some suitable boundary conditions at the endpoint of the interval [a, b]. We first use the superconvergence results proved in the first part of this paper as reported by Baccouch (Numer. Algorithm. 79(3), 697–718 2018) to show that the significant parts of the local discretization errors are proportional to (p + 1)-degree Radau polynomials, when polynomials of total degree not exceeding p are used. These new results allow us to construct a residual-based a posteriori error estimators which are obtained by solving a local residual problem with no boundary conditions on each element. The proposed error estimates are efficient, reliable, and asymptotically exact. We prove that, for smooth solutions, the proposed a posteriori error estimates converge to the exact errors in the L2-norm with order of convergence p + 3/2. Finally, we present a local AMR procedure that makes use of our local and global a posteriori error estimates. Our proofs are valid for arbitrary regular meshes and for Pp polynomials with p ≥ 1. Several numerical results are presented to validate the theoretical results and to show the efficiency of the grid refinement strategy.",
keywords = "A posteriori error estimates, Adaptive mesh refinement, Local discontinuous Galerkin method, Nonlinear two-point boundary-value problems, Superconvergence",
author = "Mahboub Baccouch",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s11075-019-00794-8",
language = "English (US)",
journal = "Numerical Algorithms",
issn = "1017-1398",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - An adaptive local discontinuous Galerkin method for nonlinear two-point boundary-value problems

AU - Baccouch, Mahboub

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In this paper, we propose an adaptive mesh refinement (AMR) strategy based on a posteriori error estimates for the local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form u′′=f(x,u),x∈[a,b] subject to some suitable boundary conditions at the endpoint of the interval [a, b]. We first use the superconvergence results proved in the first part of this paper as reported by Baccouch (Numer. Algorithm. 79(3), 697–718 2018) to show that the significant parts of the local discretization errors are proportional to (p + 1)-degree Radau polynomials, when polynomials of total degree not exceeding p are used. These new results allow us to construct a residual-based a posteriori error estimators which are obtained by solving a local residual problem with no boundary conditions on each element. The proposed error estimates are efficient, reliable, and asymptotically exact. We prove that, for smooth solutions, the proposed a posteriori error estimates converge to the exact errors in the L2-norm with order of convergence p + 3/2. Finally, we present a local AMR procedure that makes use of our local and global a posteriori error estimates. Our proofs are valid for arbitrary regular meshes and for Pp polynomials with p ≥ 1. Several numerical results are presented to validate the theoretical results and to show the efficiency of the grid refinement strategy.

AB - In this paper, we propose an adaptive mesh refinement (AMR) strategy based on a posteriori error estimates for the local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form u′′=f(x,u),x∈[a,b] subject to some suitable boundary conditions at the endpoint of the interval [a, b]. We first use the superconvergence results proved in the first part of this paper as reported by Baccouch (Numer. Algorithm. 79(3), 697–718 2018) to show that the significant parts of the local discretization errors are proportional to (p + 1)-degree Radau polynomials, when polynomials of total degree not exceeding p are used. These new results allow us to construct a residual-based a posteriori error estimators which are obtained by solving a local residual problem with no boundary conditions on each element. The proposed error estimates are efficient, reliable, and asymptotically exact. We prove that, for smooth solutions, the proposed a posteriori error estimates converge to the exact errors in the L2-norm with order of convergence p + 3/2. Finally, we present a local AMR procedure that makes use of our local and global a posteriori error estimates. Our proofs are valid for arbitrary regular meshes and for Pp polynomials with p ≥ 1. Several numerical results are presented to validate the theoretical results and to show the efficiency of the grid refinement strategy.

KW - A posteriori error estimates

KW - Adaptive mesh refinement

KW - Local discontinuous Galerkin method

KW - Nonlinear two-point boundary-value problems

KW - Superconvergence

UR - http://www.scopus.com/inward/record.url?scp=85073939773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073939773&partnerID=8YFLogxK

U2 - 10.1007/s11075-019-00794-8

DO - 10.1007/s11075-019-00794-8

M3 - Article

AN - SCOPUS:85073939773

JO - Numerical Algorithms

JF - Numerical Algorithms

SN - 1017-1398

ER -