Mahboub Baccouch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mahboub Baccouch has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Helmi Temimi
5 shared publications- Mohamed Ben-Romdhane
College of Integrative Studies, Abdullah Al Salem University, Khaldiya, Kuwait
4 shared publications Slimane Adjerid
Virginia Tech
3 shared publications- Slimane Adjerid
Department of Mathematics, Virginia Tech, Blacksburg, USA
3 shared publications Bryan Johnson
Department of Mathematics, University of Nebraska at Omaha, Omaha, NE 68182, United States
1 shared publicationH. Temimi
Department of Mathematics & Natural Sciences, Gulf University for Science & Technology, P.O. Box 7207, Hawally 32093, Kuwait
1 shared publication
Latest Publications
- Open Access
- 28 July 2026
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- p. 1-29
A Posteriori Error Estimation for the Discontinuous Galerkin Method Applied to Nonlinear Volterra Integro-differential Equations
In this paper, we present and rigorously analyze a novel residual-based a posteriori error estimator for the discontinuous Galerkin (DG) method applied to nonlinear Volterra integro-differential equations. We first prove that the DG solution using piecewise polynomials of degree $$p \geqslant 1$$ achieves the optimal convergence rate of $$\mathcal {O}(h^{p+1})$$ in the $$L^2$$ -norm. Moreover, we show that the DG solution exhibits $$\mathcal {O}(h^{2p+1})$$ superconvergence at downwind points. These results are used to show that the DG solution is $$\mathcal {O}(h^{p+2})$$ superconvergent towards a specific Gauss-Radau projection of the exact solution. This superconvergence result enables a decomposition of the discretization error into two components: a dominant term proportional to a right Radau polynomial of degree $$(p+1)$$ and a remainder that converges at a rate of $$\mathcal {O}(h^{p+2})$$ in the $$L^2$$ -norm. The global superconvergence properties are used to construct a residual-based a posteriori error estimator. The proposed estimator is computationally efficient, easy to implement, and asymptotically exact. It is constructed by solving local residual problems without imposing initial conditions on each element. We establish convergence of the a posteriori error estimator to the true error at the optimal rate of $$\mathcal {O}(h^{p+2})$$ under mesh refinement. Finally, we prove that the global effectivity index of the estimator approaches unity at a rate of $$\mathcal {O}(h)$$ . Several numerical examples are provided to validate the theoretical results and to illustrate the accuracy and reliability of the proposed estimator.- 28 July 2026
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- p. 1-29
Open AccessA Posteriori Error Estimation for the Discontinuous Galerkin Method Applied to Nonlinear Volterra Integro-differential Equations
In this paper, we present and rigorously analyze a novel residual-based a posteriori error estimator for the discontinuous Galerkin (DG) method applied to nonlinear Volterra integro-differential equations. We first prove that the DG solution using piecewise polynomials of degree $$p \geqslant 1$$ achieves the optimal convergence rate of $$\mathcal {O}(h^{p+1})$$ in the $$L^2$$ -norm. Moreover, we show that the DG solution exhibits $$\mathcal {O}(h^{2p+1})$$ superconvergence at downwind points. These results are used to show that the DG solution is $$\mathcal {O}(h^{p+2})$$ superconvergent towards a specific Gauss-Radau projection of the exact solution. This superconvergence result enables a decomposition of the discretization error into two components: a dominant term proportional to a right Radau polynomial of degree $$(p+1)$$ and a remainder that converges at a rate of $$\mathcal {O}(h^{p+2})$$ in the $$L^2$$ -norm. The global superconvergence properties are used to construct a residual-based a posteriori error estimator. The proposed estimator is computationally efficient, easy to implement, and asymptotically exact. It is constructed by solving local residual problems without imposing initial conditions on each element. We establish convergence of the a posteriori error estimator to the true error at the optimal rate of $$\mathcal {O}(h^{p+2})$$ under mesh refinement. Finally, we prove that the global effectivity index of the estimator approaches unity at a rate of $$\mathcal {O}(h)$$ . Several numerical examples are provided to validate the theoretical results and to illustrate the accuracy and reliability of the proposed estimator. - Open Access
- 27 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 805
A Posteriori Error Estimation and Adaptive Taylor Series Methods for Nonlinear Function Approximation
The Taylor approximation theorem is a fundamental tool in numerical analysis, providing a local polynomial representation of smooth functions. In practical computations, a function f is approximated by a finite Taylor polynomial , and controlling the resulting truncation error is of central importance. In this paper, we introduce two novel a posteriori error estimation techniques for Taylor polynomial approximations. The proposed estimators are fully computable and do not require prior bounds on the st derivatives of f. We prove that the estimators converge to the exact error both pointwise and in the -norm as , and we establish their asymptotic sharpness through effectivity analysis. Based on these results, we develop two adaptive algorithms that automatically determine the minimal degree n required to achieve a prescribed tolerance, either at a specific point or over a domain. We further extend the analysis to multivariate functions and show that analogous estimators and effectivity properties hold in higher dimensions. Numerical experiments are presented to validate the theoretical results and demonstrate the practical performance of the proposed methods.- 27 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 805
Open AccessA Posteriori Error Estimation and Adaptive Taylor Series Methods for Nonlinear Function Approximation
The Taylor approximation theorem is a fundamental tool in numerical analysis, providing a local polynomial representation of smooth functions. In practical computations, a function f is approximated by a finite Taylor polynomial , and controlling the resulting truncation error is of central importance. In this paper, we introduce two novel a posteriori error estimation techniques for Taylor polynomial approximations. The proposed estimators are fully computable and do not require prior bounds on the st derivatives of f. We prove that the estimators converge to the exact error both pointwise and in the -norm as , and we establish their asymptotic sharpness through effectivity analysis. Based on these results, we develop two adaptive algorithms that automatically determine the minimal degree n required to achieve a prescribed tolerance, either at a specific point or over a domain. We further extend the analysis to multivariate functions and show that analogous estimators and effectivity properties hold in higher dimensions. Numerical experiments are presented to validate the theoretical results and demonstrate the practical performance of the proposed methods. - Open Access
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Electronic Research Archive
- Vol. 33 (11) , 6971-6997
Optimal error estimates and superconvergence analysis of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems for ODEs
The primary focus of this study was to analyze the convergence and superconvergence properties of an ultra-weak discontinuous Galerkin (UWDG) method for nonlinear second-order initial-value problems (IVPs) for ordinary differential equations (ODEs) of the form $ u''+(g(x, u))' = f(x, u), \ x\in [a, b], $ subject to $ u(a) = \alpha $ and $ u'(a) = \beta $. By carefully choosing suitable numerical fluxes and employing a special projection, we established optimal error estimates in the $ L^2 $-norm. The order of convergence was proved to be $ p+1 $, when utilizing piecewise polynomials of degree at most $ p $. We further proved that the UWDG solution was superconvergent of order $ p+2 $ for $ p\geq 2 $ toward a special projection of the exact solution. Additionally, we proved that the $ p $-degree UWDG solution and its derivative were $ \mathcal{O}(h^{2p}) $ superconvergent at the end of each step. Our proofs were valid for arbitrary uniform or non-uniform partitions of the domain using piecewise polynomials with degree $ p\geq 2 $. Finally, several numerical examples were provided to validate all theoretical results. It is worth noting that the proposed UWDG method offers a significant advantage for second-order differential equations, as it can be applied directly without introducing auxiliary variables or reformulating the equation as a first-order system. This advantage reduces memory and computational costs.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Electronic Research Archive
- Vol. 33 (11) , 6971-6997
Open AccessOptimal error estimates and superconvergence analysis of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems for ODEs
The primary focus of this study was to analyze the convergence and superconvergence properties of an ultra-weak discontinuous Galerkin (UWDG) method for nonlinear second-order initial-value problems (IVPs) for ordinary differential equations (ODEs) of the form $ u''+(g(x, u))' = f(x, u), \ x\in [a, b], $ subject to $ u(a) = \alpha $ and $ u'(a) = \beta $. By carefully choosing suitable numerical fluxes and employing a special projection, we established optimal error estimates in the $ L^2 $-norm. The order of convergence was proved to be $ p+1 $, when utilizing piecewise polynomials of degree at most $ p $. We further proved that the UWDG solution was superconvergent of order $ p+2 $ for $ p\geq 2 $ toward a special projection of the exact solution. Additionally, we proved that the $ p $-degree UWDG solution and its derivative were $ \mathcal{O}(h^{2p}) $ superconvergent at the end of each step. Our proofs were valid for arbitrary uniform or non-uniform partitions of the domain using piecewise polynomials with degree $ p\geq 2 $. Finally, several numerical examples were provided to validate all theoretical results. It is worth noting that the proposed UWDG method offers a significant advantage for second-order differential equations, as it can be applied directly without introducing auxiliary variables or reformulating the equation as a first-order system. This advantage reduces memory and computational costs. - Open Access
- 23 October 2024
- Published by IntechOpen
Numerical Methods for the Viscid and Inviscid Burgers Equations
The Burgers equation is the simplest equation combining both nonlinear propagation effects and diffusive effects. It describes a weak shock phenomena in gas dynamics. This equation has been a center of interest for researchers studying various physical phenomena such as theory of shock waves, fluid dynamics, turbulent flow and gas dynamics. In this chapter, the viscid and inviscid Burgers equations are studied. Two important mathematical models described by the Burgers equations are presented. Then a very brief review of theoretical results for conservation laws are provided. In particular, the characteristic method is used to demonstrate the development of shocks. Furthermore, the notion of weak solutions, state the Rankine-Hugoniot jump condition, and introduce the notion of an entropy condition are introduced. Finally, several important numerical methods to approximate the solution to the viscid and inviscid Burgers equations are developed. For the inviscid Burgers equation, the classical finite difference and finite volume methods are presented in details including Up-wind nonconservative, Up-wind conservative, Lax-Friedrichs, Lax-Wendroff, MacCormack, Godunov methods. In addition, the discontinuous Galerkin method is described in details. For the viscid Burgers equation, a finite difference method, a Chebyshev collocation method, an ultra-weak discontinuous Galerkin method, and a local discontinuous Galerkin method are presented.
- 23 October 2024
- Published by IntechOpen
Open AccessNumerical Methods for the Viscid and Inviscid Burgers Equations
The Burgers equation is the simplest equation combining both nonlinear propagation effects and diffusive effects. It describes a weak shock phenomena in gas dynamics. This equation has been a center of interest for researchers studying various physical phenomena such as theory of shock waves, fluid dynamics, turbulent flow and gas dynamics. In this chapter, the viscid and inviscid Burgers equations are studied. Two important mathematical models described by the Burgers equations are presented. Then a very brief review of theoretical results for conservation laws are provided. In particular, the characteristic method is used to demonstrate the development of shocks. Furthermore, the notion of weak solutions, state the Rankine-Hugoniot jump condition, and introduce the notion of an entropy condition are introduced. Finally, several important numerical methods to approximate the solution to the viscid and inviscid Burgers equations are developed. For the inviscid Burgers equation, the classical finite difference and finite volume methods are presented in details including Up-wind nonconservative, Up-wind conservative, Lax-Friedrichs, Lax-Wendroff, MacCormack, Godunov methods. In addition, the discontinuous Galerkin method is described in details. For the viscid Burgers equation, a finite difference method, a Chebyshev collocation method, an ultra-weak discontinuous Galerkin method, and a local discontinuous Galerkin method are presented.
- 1 June 2024
- Published by Global Science Press in Journal of Computational Mathematics
- Vol. 42 (2) , 432-453
An Efficient Finite Difference Method for Stochastic Linear Second-Order Boundary-Value Problems Driven by Additive White Noises
In this paper, we develop and analyze a finite difference method for linear second-order stochastic boundary-value problems (SBVPs) driven by additive white noises. First we regularize the noise by the Wong-Zakai approximation and introduce a sequence of linear second-order SBVPs. We prove that the solution of the SBVP with regularized noise converges to the solution of the original SBVP with convergence order $\mathcal{O}(h)$ in the mean-square sense. To obtain a numerical solution, we apply the finite difference method to the stochastic BVP whose noise is piecewise constant approximation of the original noise. The approximate SBVP with regularized noise is shown to have better regularity than the original problem, which facilitates the convergence proof for the proposed scheme. Convergence analysis is presented based on the standard finite difference method for deterministic problems. More specifically, we prove that the finite difference solution converges at $\mathcal{O}(h)$ in the mean-square sense, when the second-order accurate three-point formulas to approximate the first and second derivatives are used. Finally, we present several numerical examples to validate the efficiency and accuracy of the proposed scheme. COPYRIGHT: © Global Science Press- 1 June 2024
- Published by Global Science Press in Journal of Computational Mathematics
- Vol. 42 (2) , 432-453
An Efficient Finite Difference Method for Stochastic Linear Second-Order Boundary-Value Problems Driven by Additive White Noises
In this paper, we develop and analyze a finite difference method for linear second-order stochastic boundary-value problems (SBVPs) driven by additive white noises. First we regularize the noise by the Wong-Zakai approximation and introduce a sequence of linear second-order SBVPs. We prove that the solution of the SBVP with regularized noise converges to the solution of the original SBVP with convergence order $\mathcal{O}(h)$ in the mean-square sense. To obtain a numerical solution, we apply the finite difference method to the stochastic BVP whose noise is piecewise constant approximation of the original noise. The approximate SBVP with regularized noise is shown to have better regularity than the original problem, which facilitates the convergence proof for the proposed scheme. Convergence analysis is presented based on the standard finite difference method for deterministic problems. More specifically, we prove that the finite difference solution converges at $\mathcal{O}(h)$ in the mean-square sense, when the second-order accurate three-point formulas to approximate the first and second derivatives are used. Finally, we present several numerical examples to validate the efficiency and accuracy of the proposed scheme. COPYRIGHT: © Global Science Press- 22 March 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 98 (1) , 373-404
Residual-based a posteriori error analysis of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems
- 22 March 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 98 (1) , 373-404
Residual-based a posteriori error analysis of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems
- 12 February 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 97 (4) , 1895-1933
A posteriori error analysis of an ultra-weak local discontinuous Galerkin method for nonlinear fourth-order boundary-value problems
- 12 February 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 97 (4) , 1895-1933
A posteriori error analysis of an ultra-weak local discontinuous Galerkin method for nonlinear fourth-order boundary-value problems
- 1 June 2023
- Published by Global Science Press in International Journal of Numerical Analysis and Modeling
- Vol. 20 (6) , 772-804
A Posteriori Error Estimates for a Local Discontinuous Galerkin Approximation of Semilinear Second-Order Elliptic Problems on Cartesian Grids
In this paper, we design and analyze new residual-type a posteriori error estimators for the local discontinuous Galerkin (LDG) method applied to semilinear second-order elliptic problems in two dimensions of the type $−∆u = f(x, u).$ We use our recent superconvergence results derived in Commun. Appl. Math. Comput. (2021) to prove that the LDG solution is superconvergent with an order $p+2$ towards the $p$-degree right Radau interpolating polynomial of the exact solution, when tensor product polynomials of degree at most $p$ are considered as basis for the LDG method. Moreover, we show that the global discretization error can be decomposed into the sum of two errors. The first error can be expressed as a linear combination of two $(p+1)$-degree Radau polynomials in the $x-$ and $y−$ directions. The second error converges to zero with order $p+2$ in the $L^2$-norm. This new result allows us to construct a posteriori error estimators of residual type. We prove that the proposed a posteriori error estimators converge to the true errors in the $L^2$-norm under mesh refinement at the optimal rate. The order of convergence is proved to be $p+2.$ We further prove that our a posteriori error estimates yield upper and lower bounds for the actual error. Finally, a series of numerical examples are presented to validate the theoretical results and numerically demonstrate the convergence of the proposed a posteriori error estimators. local discontinuous Galerkin method, semilinear elliptic problems, a posteriori error estimators, superconvergence, Radau polynomial. 65N12, 65N15, 65N30, 65N50 COPYRIGHT: © Global Science Press- 1 June 2023
- Published by Global Science Press in International Journal of Numerical Analysis and Modeling
- Vol. 20 (6) , 772-804
A Posteriori Error Estimates for a Local Discontinuous Galerkin Approximation of Semilinear Second-Order Elliptic Problems on Cartesian Grids
In this paper, we design and analyze new residual-type a posteriori error estimators for the local discontinuous Galerkin (LDG) method applied to semilinear second-order elliptic problems in two dimensions of the type $−∆u = f(x, u).$ We use our recent superconvergence results derived in Commun. Appl. Math. Comput. (2021) to prove that the LDG solution is superconvergent with an order $p+2$ towards the $p$-degree right Radau interpolating polynomial of the exact solution, when tensor product polynomials of degree at most $p$ are considered as basis for the LDG method. Moreover, we show that the global discretization error can be decomposed into the sum of two errors. The first error can be expressed as a linear combination of two $(p+1)$-degree Radau polynomials in the $x-$ and $y−$ directions. The second error converges to zero with order $p+2$ in the $L^2$-norm. This new result allows us to construct a posteriori error estimators of residual type. We prove that the proposed a posteriori error estimators converge to the true errors in the $L^2$-norm under mesh refinement at the optimal rate. The order of convergence is proved to be $p+2.$ We further prove that our a posteriori error estimates yield upper and lower bounds for the actual error. Finally, a series of numerical examples are presented to validate the theoretical results and numerically demonstrate the convergence of the proposed a posteriori error estimators. local discontinuous Galerkin method, semilinear elliptic problems, a posteriori error estimators, superconvergence, Radau polynomial. 65N12, 65N15, 65N30, 65N50 COPYRIGHT: © Global Science Press- Open Access
- 4 January 2023
- Published by Springer Nature in Research Square
Residual-based a posteriori error analysis of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems
Note: Please see pdf for full abstract with equations. In this paper, we propose and analyze implicit residual-based a posteriori error estimates for the ultra-weak discontinuous Galerkin (UWDG) method for nonlinear second-order initial-value problems for ordinary differential equations of the form u′′ = ƒ(x, u). We prove that the UWDG error on each element can be split into two parts. The significant part is proportional to the (p + 1)-degree polynomial (1 − ξ)2P2,0p−1(ξ), ξ ∈ [−1, 1], where P2,0p−1(ξ) is the (p − 1)-degree Jacobi polynomial, when piecewise polynomials of degree at most p ≥ 2 are used. The second part of the error converges with order p + 2 in the L2-norm. These results allow us to construct a posteriori UWDG error estimates. The proposed residual-based a posteriori error estimators of this paper are reliable, efficient, and are obtained by solving a local problem with no side conditions on each element. Furthermore, we prove that, for smooth solutions, these a posteriori error estimates converge to the exact errors in the L2-norm under mesh refinement. The order of convergence is proved to be p + 2. Finally, we prove that the global effectivity index converges to unity at O(h) rate. Several numerical experiments are provided to validate the theoretical results. AMS subject classifications (2020)}: 65L05, 65L20, 65L50, 65L60, 65L70.
- 4 January 2023
- Published by Springer Nature in Research Square
Open AccessResidual-based a posteriori error analysis of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems
Note: Please see pdf for full abstract with equations. In this paper, we propose and analyze implicit residual-based a posteriori error estimates for the ultra-weak discontinuous Galerkin (UWDG) method for nonlinear second-order initial-value problems for ordinary differential equations of the form u′′ = ƒ(x, u). We prove that the UWDG error on each element can be split into two parts. The significant part is proportional to the (p + 1)-degree polynomial (1 − ξ)2P2,0p−1(ξ), ξ ∈ [−1, 1], where P2,0p−1(ξ) is the (p − 1)-degree Jacobi polynomial, when piecewise polynomials of degree at most p ≥ 2 are used. The second part of the error converges with order p + 2 in the L2-norm. These results allow us to construct a posteriori UWDG error estimates. The proposed residual-based a posteriori error estimators of this paper are reliable, efficient, and are obtained by solving a local problem with no side conditions on each element. Furthermore, we prove that, for smooth solutions, these a posteriori error estimates converge to the exact errors in the L2-norm under mesh refinement. The order of convergence is proved to be p + 2. Finally, we prove that the global effectivity index converges to unity at O(h) rate. Several numerical experiments are provided to validate the theoretical results. AMS subject classifications (2020)}: 65L05, 65L20, 65L50, 65L60, 65L70.
- 1 January 2023
- Published by Global Science Press in International Journal of Numerical Analysis and Modeling
- Vol. 20 (5) , 618-646
A Posteriori Error Analysis for an Ultra-Weak Discontinuous Galerkin Approximations of Nonlinear Second-Order Two-Point Boundary-Value Problems
In this paper, we present and analyze a posteriori error estimates in the $L^2$-norm of an ultra-weak discontinuous Galerkin (UWDG) method for nonlinear second-order boundary-value problems for ordinary differential equations of the form $u′′=f(x, u).$ We first use the superconvergence results proved in the first part of this paper (J. Appl. Math. Comput. 69, 1507-1539, 2023) to prove that the UWDG solution converges, in the $L^2$-norm, towards a special $p$-degree interpolating polynomial, when piecewise polynomials of degree at most $p ≥ 2$ are used. The order of convergence is proved to be $p + 2.$ We then show that the UWDG error on each element can be divided into two parts. The dominant part is proportional to a special $(p+1)$-degree Baccouch polynomial, which can be written as a linear combination of Legendre polynomials of degrees $p − 1,$ $p,$ and $p + 1.$ The second part converges to zero with order $p + 2$ in the $L^2$-norm. These results allow us to construct a posteriori UWDG error estimates. The proposed error estimates are computationally simple and are obtained by solving a local problem with no boundary conditions on each element. Furthermore, we prove that, for smooth solutions, these a posteriori error estimates converge to the exact errors in the $L^2$-norm under mesh refinement. The order of convergence is proved to be $p + 2.$ Finally, we prove that the global effectivity index converges to unity at $\mathcal{O}(h)$ rate. Numerical results are presented exhibiting the reliability and the efficiency of the proposed error estimator. Second-order boundary-value problems, ultra-weak discontinuous Galerkin method, superconvergence, a posteriori error estimation, Baccouch polynomials. 65L10, 65L60, 65L70 COPYRIGHT: © Global Science Press- 1 January 2023
- Published by Global Science Press in International Journal of Numerical Analysis and Modeling
- Vol. 20 (5) , 618-646
A Posteriori Error Analysis for an Ultra-Weak Discontinuous Galerkin Approximations of Nonlinear Second-Order Two-Point Boundary-Value Problems
In this paper, we present and analyze a posteriori error estimates in the $L^2$-norm of an ultra-weak discontinuous Galerkin (UWDG) method for nonlinear second-order boundary-value problems for ordinary differential equations of the form $u′′=f(x, u).$ We first use the superconvergence results proved in the first part of this paper (J. Appl. Math. Comput. 69, 1507-1539, 2023) to prove that the UWDG solution converges, in the $L^2$-norm, towards a special $p$-degree interpolating polynomial, when piecewise polynomials of degree at most $p ≥ 2$ are used. The order of convergence is proved to be $p + 2.$ We then show that the UWDG error on each element can be divided into two parts. The dominant part is proportional to a special $(p+1)$-degree Baccouch polynomial, which can be written as a linear combination of Legendre polynomials of degrees $p − 1,$ $p,$ and $p + 1.$ The second part converges to zero with order $p + 2$ in the $L^2$-norm. These results allow us to construct a posteriori UWDG error estimates. The proposed error estimates are computationally simple and are obtained by solving a local problem with no boundary conditions on each element. Furthermore, we prove that, for smooth solutions, these a posteriori error estimates converge to the exact errors in the $L^2$-norm under mesh refinement. The order of convergence is proved to be $p + 2.$ Finally, we prove that the global effectivity index converges to unity at $\mathcal{O}(h)$ rate. Numerical results are presented exhibiting the reliability and the efficiency of the proposed error estimator. Second-order boundary-value problems, ultra-weak discontinuous Galerkin method, superconvergence, a posteriori error estimation, Baccouch polynomials. 65L10, 65L60, 65L70 COPYRIGHT: © Global Science Press