pith. sign in

arxiv: 2601.13908 · v2 · submitted 2026-01-20 · 🧮 math.NA · cs.NA· math.FA· physics.app-ph· physics.comp-ph

Improving the local solution of the DG predictor of the ADER-DG method for solving systems of ordinary differential equations and its applicability to systems of differential-algebraic equations

Pith reviewed 2026-05-16 12:40 UTC · model grok-4.3

classification 🧮 math.NA cs.NAmath.FAphysics.app-phphysics.comp-ph
keywords ADER-DG methodlocal DG predictorconvergence ordersdifferential-algebraic equationsODE systemsinitial value problemsnumerical approximation
0
0 comments X

The pith

Improved local solution for ADER-DG achieves one higher convergence order and continuity at grid nodes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes an improved local numerical solution for the ADER-DG method with local DG predictor applied to initial value problems for systems of ordinary differential equations. This version converges at an order one higher than the original local solution while remaining continuous at grid nodes. Rigorous proofs establish the approximation orders of both the original and improved solutions. The minimal structural change preserves all prior conclusions on convergence at nodes, superconvergence, and stability of the overall method. The same framework extends to differential-algebraic equations through an epsilon-embedding technique, with numerical tests across polynomial degrees confirming the higher accuracy and smoothness.

Core claim

The author establishes that the improved local numerical solution for the ADER-DG predictor demonstrates convergence orders one higher than the original local numerical solution and possesses continuity at grid nodes. Rigorous analysis confirms the approximation orders, and the epsilon-embedding method proves applicability to DAE systems. Numerical experiments for a wide range of ODE initial value problems validate the theoretical orders in multiple error norms while showing improved point-wise accuracy and smoothness.

What carries the argument

The improved local numerical solution obtained by post-processing the output of the local DG predictor.

If this is right

  • Convergence orders at grid nodes and superconvergence properties of the ADER-DG method remain unchanged.
  • High stability of the overall ADER-DG method is preserved for ODE systems.
  • The approach applies to DAE systems with the same convergence and continuity properties.
  • Empirical orders match theory across a range of error norms and polynomial degrees.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The added continuity at nodes could simplify coupling to other time-stepping schemes in multi-scale simulations.
  • Higher local accuracy might reduce the need for frequent adaptive mesh refinement in long integrations.
  • The epsilon-embedding technique opens a path to test the method on higher-index DAEs without reformulating the predictor.

Load-bearing premise

The epsilon-embedding argument assumes the embedded ODE system inherits the stability and approximation properties of the original ADER-DG predictor without introducing new singularities or order reductions.

What would settle it

A numerical test on a DAE system using epsilon-embedding that shows the observed convergence order of the improved local solution dropping below the predicted value due to an introduced singularity.

read the original abstract

Improved local numerical solution for the ADER-DG numerical method with a local DG predictor for solving the initial value problem for a first-order ODE system is proposed. The improved local numerical solution demonstrates convergence orders of one higher than the convergence order of the local numerical solution of the original ADER-DG numerical method and has the property of continuity at grid nodes. Rigorous proofs of the approximation orders of the local numerical solution and the improved local numerical solution are presented. Obtaining the proposed improved local numerical solution does not require significant changes to the structure of the ADER-DG numerical method. Therefore, all conclusions regarding the convergence orders of the numerical solution at grid nodes, the resulting superconvergence, and the high stability of the ADER-DG numerical method remain unchanged. A wide range of applications of the ADER-DG numerical method is presented for solving specific initial value problems for ODE systems for a wide range of polynomial degrees. The obtained results provide strong confirmation for the developed rigorous theory. The improved local numerical solution is shown to exhibit both higher accuracy and improved smoothness and point-wise comparability. Empirical convergence orders of all individual numerical solutions were calculated for a wide range of error norms, which well agree with the expected convergence orders. The rigorous proof, based on the $\epsilon$-embedding method, of the applicability of the ADER-DG numerical method with a local DG predictor to solving DAE systems is presents.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript proposes an improved local numerical solution for the DG predictor in the ADER-DG method applied to first-order ODE initial-value problems. The improved solution is claimed to achieve convergence order one higher than the original local DG solution while also being continuous at grid nodes. Rigorous proofs of the approximation orders for both the original and improved local solutions are presented, with the improvement requiring only minor structural changes that preserve the method's superconvergence and stability properties. The work further claims applicability to DAE systems via an ε-embedding regularization that converts the DAE into a nearby ODE treated by the same predictor. Numerical experiments across multiple polynomial degrees, error norms, and specific ODE/DAE problems are reported to confirm the predicted orders and improved smoothness.

Significance. If the proofs and DAE extension hold, the result supplies a low-cost route to higher local accuracy and nodal continuity inside an existing high-order ADER-DG framework, without disturbing its global convergence or stability conclusions. The numerical confirmation across norms and degrees strengthens the practical utility for stiff or constrained evolution problems.

major comments (1)
  1. The section presenting the rigorous proof based on the ε-embedding method: the argument that the embedded ODE inherits the full stability and approximation properties of the improved DG predictor (including the claimed order gain and nodal continuity) without order reduction or new singularities is load-bearing for the DAE applicability claim, yet no explicit bounds relating the embedding parameter ε to the time step or DAE index are supplied. This omission leaves open the possibility of mild order loss when the algebraic constraints interact with the implicit predictor solve.
minor comments (1)
  1. Abstract, final sentence: the phrase 'is presents' is grammatically incorrect and should read 'is presented'.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback. We address the single major comment below and have revised the manuscript to strengthen the presentation of the ε-embedding argument.

read point-by-point responses
  1. Referee: The section presenting the rigorous proof based on the ε-embedding method: the argument that the embedded ODE inherits the full stability and approximation properties of the improved DG predictor (including the claimed order gain and nodal continuity) without order reduction or new singularities is load-bearing for the DAE applicability claim, yet no explicit bounds relating the embedding parameter ε to the time step or DAE index are supplied. This omission leaves open the possibility of mild order loss when the algebraic constraints interact with the implicit predictor solve.

    Authors: We agree that explicit quantitative bounds relating ε to Δt and the DAE index are not supplied in the current manuscript. The proof shows that for any fixed ε > 0 the ε-embedding produces a regular, non-singular first-order ODE system to which the improved DG predictor applies directly; hence the order gain, nodal continuity, stability, and superconvergence properties are inherited without reduction or new singularities. The constant in the error estimate may depend on ε (typically growing as 1/ε), but the convergence order itself remains independent of ε. In the revised version we will add a short paragraph clarifying this dependence, noting that ε is chosen small enough relative to the desired tolerance and the time step to keep the implicit predictor well-conditioned, and referencing standard estimates for the regularization error of index-1 DAEs. Numerical experiments already confirm that the predicted orders are observed for the small ε values used in practice. revision: yes

Circularity Check

0 steps flagged

No significant circularity: claims rest on newly presented rigorous proofs and direct numerical verification

full rationale

The paper states new approximation proofs for the improved local solution (higher order and nodal continuity) and applies the ε-embedding method for DAE extension. These steps are presented as independent derivations with explicit numerical confirmation across polynomial degrees and error norms; no quantities are defined in terms of themselves, no fitted parameters are relabeled as predictions, and no load-bearing uniqueness theorems or ansatzes are imported solely via self-citation. The central ODE results remain self-contained, and the DAE applicability is framed as a proof rather than a reduction to prior fitted data.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work relies on the standard polynomial approximation spaces and stability properties of the existing ADER-DG framework; no new free parameters or invented entities are introduced.

axioms (2)
  • domain assumption The local DG predictor is based on polynomial approximations of fixed degree N inside each time interval.
    Standard setup of the ADER-DG method referenced throughout the abstract.
  • domain assumption The ε-embedding of a DAE into an ODE preserves the approximation order of the DG predictor in the limit ε→0.
    Invoked for the DAE applicability proof.

pith-pipeline@v0.9.0 · 5581 in / 1279 out tokens · 26414 ms · 2026-05-16T12:40:25.430697+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

89 extracted references · 89 canonical work pages · 1 internal anchor

  1. [1]

    Wiley, United Kingdom (2016)

    Butcher, J.C.: Numerical Methods for Ordinary Differential Equations. Wiley, United Kingdom (2016)

  2. [2]

    Springer, Berlin, Heidelberg (1993)

    Hairer, E., Nørsett, S.P., Wanner, G.: Solving Ordinary Differential Equations I: Nonstiff Problems. Springer, Berlin, Heidelberg (1993)

  3. [3]

    Springer, Berlin, Heidelberg (1996)

    Hairer, E., Wanner, G.: Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems. Springer, Berlin, Heidelberg (1996)

  4. [4]

    Clarendon Press, Oxford (2001)

    Babuˇ ska, I., Strouboulis, T.: The Finite Element Method and Its Reliability, Numerical Mathematics and Scientific Computation. Clarendon Press, Oxford (2001)

  5. [5]

    Springer, Verlag Berlin Heidelberg (1995)

    Wahlbin, L.: Superconvergence in Galerkin Finite Element Methods. Springer, Verlag Berlin Heidelberg (1995)

  6. [6]

    Numerical Algorithms 86, 1615–1650 (2021)

    Baccouch, M.: Analysis of optimal superconvergence of the local discontinuous Galerkin method for nonlinear fourth-order boundary value problems. Numerical Algorithms 86, 1615–1650 (2021)

  7. [7]

    Applied Numerical Mathematics 162, 331–350 (2021)

    Baccouch, M.: The discontinuous Galerkin method for general nonlinear third-order ordinary differential equations. Applied Numerical Mathematics 162, 331–350 (2021)

  8. [8]

    International Journal of Computational Methods 20(2), 2250042 (2023)

    Baccouch, M.: Superconvergence of an ultra-weak discontinuous Galerkin method for nonlinear second-order initial-value problems. International Journal of Computational Methods 20(2), 2250042 (2023)

  9. [9]

    Technical Report LA- UR-73-479, Los Alamos Scientific Laboratory (1973)

    Reed, W.H., Hill, T.R.: Triangular mesh methods for the neutron transport equation. Technical Report LA- UR-73-479, Los Alamos Scientific Laboratory (1973)

  10. [10]

    Delfour, M., Hager, W., Trochu, F.: Discontinuous Galerkin methods for ordinary differential equations. Math. Comp. 36, 455–473 (1981)

  11. [11]

    Delfour, M., Dubeau, F.: Discontinuous polynomial approximations in the theory of one-step, hybrid and multistep methods for nonlinear ordinary differential equations. Math. Comp. 47, 169 (1986)

  12. [12]

    Cockburn, B., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. II. General framework. Math. Comp. 52, 411–435 (1989)

  13. [13]

    Cockburn, B., Lin, S.-.Y., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws III: One-dimensional systems. J. Comput. Phys. 84, 90–113 (1989)

  14. [14]

    Cockburn, B., Hou, S., , Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. IV. The multidimensional case. Math. Comp. 54, 545–581 (1990)

  15. [15]

    Cockburn, B., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin Method for Conservation Laws V: Multidimensional Systems. J. Comput. Phys. 141, 199–224 (1998)

  16. [16]

    ESAIM: M2AN 25, 337–361 (1991)

    Cockburn, B., Shu, C.-W.: The Runge-Kutta local projection P 1-discontinuous-Galerkin finite element method for scalar conservation laws. ESAIM: M2AN 25, 337–361 (1991)

  17. [17]

    Popov, I.S.: Arbitrary high order ADER-DG method with local DG predictor for solutions of initial value problems for systems of first-order ordinary differential equations. J. Sci. Comput. 100, 22 (2024)

  18. [18]

    Applied Numerical Mathematics 106, 129–153 (2016)

    Baccouch, M.: Analysis of a posteriori error estimates of the discontinuous Galerkin method for nonlinear ordinary differential equations. Applied Numerical Mathematics 106, 129–153 (2016)

  19. [19]

    Applied Numerical Mathematics 121, 18–37 (2017)

    Baccouch, M.: A posteriori error estimates and adaptivity for the discontinuous Galerkin solutions of nonlinear second-order initial-value problems. Applied Numerical Mathematics 121, 18–37 (2017)

  20. [20]

    Applied Numerical Mathematics 115, 160–179 (2017) 35

    Baccouch, M.: Superconvergence of the discontinuous Galerkin method for nonlinear second-order initial-value problems for ordinary differential equations. Applied Numerical Mathematics 115, 160–179 (2017) 35

  21. [21]

    Numerical Algorithms 92(4), 1983–2023 (2023)

    Baccouch, M.: A superconvergent ultra-weak local discontinuous Galerkin method for nonlinear fourth-order boundary-value problems. Numerical Algorithms 92(4), 1983–2023 (2023)

  22. [22]

    Journal of Applied Mathematics and Computing 69(2), 1507–1539 (2023)

    Baccouch, M.: A superconvergent ultra-weak discontinuous Galerkin method for nonlinear second-order two- point boundary-value problems. Journal of Applied Mathematics and Computing 69(2), 1507–1539 (2023)

  23. [23]

    Popov, I.S.: High order ADER-DG method with local DG predictor for solutions of differential-algebraic systems of equations. J. Sci. Comput. 102, 48 (2025)

  24. [24]

    Journal of Computational and Applied Mathematics 308, 138–165 (2016)

    Baccouch, M., Johnson, B.: A high-order discontinuous Galerkin method for Ito stochastic ordinary differential equations. Journal of Computational and Applied Mathematics 308, 138–165 (2016)

  25. [25]

    Journal of Computational and Applied Mathematics 388, 113297 (2021)

    Baccouch, M., Temimi, H., Ben-Romdhane, M.: A discontinuous Galerkin method for systems of stochastic differential equations with applications to population biology, finance, and physics. Journal of Computational and Applied Mathematics 388, 113297 (2021)

  26. [26]

    Computers & Fluids 118, 204 (2015)

    Zanotti, O., Fambri, F., Dumbser, M., Hidalgo, A.: Space-time adaptive ADER discontinuous Galerkin finite element schemes with a posteriori sub-cell finite volume limiting. Computers & Fluids 118, 204 (2015)

  27. [27]

    Computer Physics Communications220, 297 (2017)

    Fambri, F., Dumbser, M., Zanotti, O.: Space-time adaptive ADER-DG schemes for dissipative flows: Compressible Navier-Stokes and resistive MHD equations. Computer Physics Communications220, 297 (2017)

  28. [28]

    Boscheri, W., Dumbser, M.: Arbitrary-Lagrangian-Eulerian discontinuous Galerkin schemes with a posteriori subcell finite volume limiting on moving unstructured meshes. J. Comput. Phys. 346, 449 (2017)

  29. [29]

    MNRAS 477, 4543 (2018)

    Fambri, F., Dumbser, M., Koppel, S., Rezzolla, L., Zanotti, O.: ADER discontinuous Galerkin schemes for general-relativistic ideal magnetohydrodynamics. MNRAS 477, 4543 (2018)

  30. [30]

    Dumbser, M., Guercilena, F., Koppel, S., Rezzolla, L., Zanotti, O.: Conformal and covariant Z4 formulation of the Einstein equations: Strongly hyperbolic first-order reduction and solution with discontinuous galerkin schemes. Phys. Rev. D 97, 084053 (2018)

  31. [31]

    Dumbser, M., Zanotti, O., Gaburro, E., Peshkov, I.: A well-balanced discontinuous Galerkin method for the first-order Z4 formulation of the Einstein-Euler system. J. Comp. Phys. 504, 112875 (2024)

  32. [32]

    Dumbser, M., Loub` ere, R.: A simple robust and accurate a posteriori sub-cell finite volume limiter for the discontinuous Galerkin method on unstructured meshes. J. Comput. Phys. 319, 163 (2016)

  33. [33]

    Gaburro, E., Dumbser, M.: A posteriori subcell finite volume limiter for general PN PM schemes: Applications from gasdynamics to relativistic magnetohydrodynamics. J. Sci. Comput. 86, 37 (2021)

  34. [34]

    Busto, S., Chiocchetti, S., Dumbser, M., Gaburro, E., Peshkov, I.: High order ADER schemes for continuum mechanics. Front. Phys. 32, 8 (2020)

  35. [35]

    Axioms 7(3), 63 (2018)

    Dumbser, M., Fambri, F., Tavelli, M., Bader, M., Weinzierl, T.: Efficient implementation of ADER discontinuous Galerkin schemes for a scalable hyperbolic PDE engine. Axioms 7(3), 63 (2018)

  36. [36]

    Computer Physics Communications 254, 107251 (2020)

    Reinarz, A., Charrier, D.E., Bader, M., Bovard, L., Dumbser, M., Duru, K., Fambri, F., Gabriel, A.-A., Gallard, G.-M., Koppel, S., Krenz, L., Rannabauer, L., Rezzolla, L., Samfass, P., Tavelli, M., Weinzierl, T.: ExaHyPE: An engine for parallel dynamically adaptive simulations of wave problems. Computer Physics Communications 254, 107251 (2020)

  37. [37]

    Dumbser, M., Zanotti, O.: Very high order PNPM schemes on unstructured meshes for the resistive relativistic mhd equations. J. Comput. Phys. 228, 6991 (2009)

  38. [38]

    Applied Mathematics and Computation 402, 126117 (2021)

    Busto, A., Rio-Martin, L., Vazquez-Cendon, M.E., Dumbser, M.: A semi-implicit hybrid finite volume/finite element scheme for all Mach number flows on staggered unstructured meshes. Applied Mathematics and Computation 402, 126117 (2021)

  39. [39]

    Tavelli, M., Chiocchetti, S., Romenski, E., Gabriel, A.A., Dumbser, M.: Space-time adaptive ADER discon- tinuous Galerkin schemes for nonlinear hyperelasticity with material failure. J. Comp. Phys. 422, 109758 (2020)

  40. [40]

    Wolf, S., Galis, M., Uphoff, C., Gabriel, A.-A., P., M., Gregor, D., Bader, M.: An efficient ADER-DG local time stepping scheme for 3D HPC simulation of seismic waves in poroelastic media. J. Comp. Phys. 455, 110886 (2022)

  41. [41]

    Applied Numerical Mathematics 158, 236 (2020)

    Bassi, C., Busto, S., Dumbser, M.: High order ADER-DG schemes for the simulation of linear seismic waves induced by nonlinear dispersive free-surface water waves. Applied Numerical Mathematics 158, 236 (2020)

  42. [42]

    application to blood flow

    Montecinos, G.I., Santaca, A., Celant, M., Muller, L.O., Toro, E.F.: ADER scheme with a simplified solver for 36 the generalized Riemann problem and an average ENO reconstruction procedure. application to blood flow. Computers & Fluids 248, 105685 (2022)

  43. [43]

    Fernandez, E.G., Diaz, M.J.C., Dumbser, M., Luna, T.M.: An arbitrary high order well-balanced ADER-DG numerical scheme for the multilayer shallow-water model with variable density. J. Sci. Comput. 90, 52 (2022)

  44. [44]

    Applied Mathematics and Computation 466, 128426 (2024)

    Veiga, M.H., Micalizzi, L., Torlo, D.: On improving the efficiency of ADER methods. Applied Mathematics and Computation 466, 128426 (2024)

  45. [45]

    Popov, I.S.: The effective use of BLAS interface for implementation of finite-element ADER-DG and finite- volume ADER-WENO methods. Commun. Comput. Phys. 38, 1237–1330 (2025)

  46. [46]

    Applied Mathematics and Computation 440, 127644 (2023)

    Gaburro, E., Offner, P., Ricchiuto, M., Torlo, D.: High order entropy preserving ADER-DG schemes. Applied Mathematics and Computation 440, 127644 (2023)

  47. [47]

    Klein, S.-C.: Stabilizing discontinuous Galerkin methods using Dafermos’ entropy rate criterion: I — one- dimensional conservation laws. J. Sci. Comput. 95, 55 (2023)

  48. [48]

    Avesania, D., Dumbser, M., Vacondio, R., Maurizio, R.: An alternative SPH formulation: ADER-WENO-SPH. Comput. Methods Appl. Mech. Engrg. 382, 113871 (2021)

  49. [49]

    Gaburro, E., Boscheri, W., Chiocchetti, S., Klingenberg, C., Springel, V., Dumbser, M.: High order direct Arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes. J. Comput. Phys. 407, 109167 (2020)

  50. [50]

    Archives of Computational Methods in Engineering 28, 1249 (2021)

    Gaburro, E.: A unified framework for the solution of hyperbolic PDE systems using high order direct arbitrary- lagrangian-eulerian schemes on moving unstructured meshes with topology change. Archives of Computational Methods in Engineering 28, 1249 (2021)

  51. [51]

    In: Pares, C., Castro, M.J., Luna, T.M., Mu˜ noz-Ruiz, M.L

    Toro, E.F., Titarev, V.A., Dumbser, M., Iske, A., Goetz, C.R., Castro, C.E., Montecinos, G.I., R., D.: The ADER approach for approximating hyperbolic equations to very high accuracy. In: Pares, C., Castro, M.J., Luna, T.M., Mu˜ noz-Ruiz, M.L. (eds.) Hyperbolic Problems: Theory, Numerics, Applications. Volume I. HYP

  52. [52]

    Springer, Cham (2024)

    SEMA SIMAI Springer Series, Vol 34. Springer, Cham (2024)

  53. [53]

    Titarev, V.A., Toro, E.F.: ADER: arbitrary high order Godunov approach. J. Sci. Comput. 17, 609 (2002)

  54. [54]

    Titarev, V.A., Toro, E.F.: ADER schemes for three-dimensional nonlinear hyperbolic systems. J. Comput. Phys. 204, 715 (2005)

  55. [55]

    Computers and Fluids 159, 156–166 (2017)

    Baeza, A., Boscarino, S., Mulet, P., Russo, G., Zorio, D.: Approximate Taylor methods for ODEs. Computers and Fluids 159, 156–166 (2017)

  56. [56]

    Experiment

    Jorba, A., Zou, M.: A software package for the numerical integration of ODEs by means of high-order Taylor methods. Experiment. Math. 14, 99–117 (2005)

  57. [57]

    Dumbser, M., Enaux, C., Toro, E.F.: Finite volume schemes of very high order of accuracy for stiff hyperbolic balance laws. J. Comput. Phys. 227, 3971 (2008)

  58. [58]

    Hidalgo, A., Dumbser, M.: ADER schemes for nonlinear systems of stiff advection-diffusion-reaction equations. J. Sci. Comput. 48, 173 (2011)

  59. [59]

    Popov, I.S.: Space-time adaptive ADER-DG finite element method with LST-DG predictor and a posteriori sub-cell WENO finite-volume limiting for simulation of non-stationary compressible multicomponent reactive flows. J. Sci. Comput. 95, 44 (2023)

  60. [60]

    Computers & Fluids 284, 106425 (2024)

    Popov, I.S.: Space-time adaptive ADER-DG finite element method with LST-DG predictor and a posteriori sub-cell ADER-WENO finite-volume limiting for multidimensional detonation waves simulation. Computers & Fluids 284, 106425 (2024)

  61. [61]

    Journal of Scientific Computing 87, 2 (2021)

    Han Veiga, M., Offner, P., Torlo, D.: Dec and ader: Similarities, differences and a unified framework. Journal of Scientific Computing 87, 2 (2021)

  62. [62]

    Micalizzi, L., Torlo, D., Boscheri, W.: Efficient iterative arbitrary high-order methods: an adaptive bridge between low and high order. Commun. Appl. Math. Comput. (2023)

  63. [63]

    Daniel, J.W., Pereyra, V., Schumaker, L.L.: Iterated deferred corrections for initial value problems. Acta Ci. Venezolana 19, 128–135 (1968)

  64. [64]

    BIT 40, 241–266 (2000) 37

    Dutt, A., Greengard, L., V., R.: Spectral deferred correction methods for ordinary differential equations. BIT 40, 241–266 (2000) 37

  65. [65]

    Abgrall, R., Bacigaluppi, P., Tokareva, S.: Semi-implicit spectral deferred correction methods for ordinary differential equations. Commun. Math. Sci. 1, 471–500 (2003)

  66. [66]

    Liu, Y., Shu, C.-W., Zhang, M.: Strong stability preserving property of the deferred correction time discretization. J. Comput. Math. 26, 633–656 (2008)

  67. [67]

    Abgrall, R.: High order schemes for hyperbolic problems using globally continuous approximation and avoiding mass matrices. J. Sci. Comput. 73, 461–494 (2017)

  68. [68]

    Abgrall, R., Bacigaluppi, P., Tokareva, S.: High-order residual distribution scheme for the time-dependent Euler equations of fluid dynamics. Comput. Math. Appl. 78, 274–297 (2019)

  69. [69]

    Li, X., Ryan, J.K., Kirby, R.M., Vuik, K.: Smoothness-increasing accuracy-conserving (SIAC) filtering for discontinuous Galerkin solutions over nonuniform meshes: Superconvergence and optimal accuracy. J. Sci. Comput. 81, 1150 (2019)

  70. [70]

    Bramble, J.H., Schatz, A.H.: Higher order local accuracy by averaging in the finite element method. Math. Comput. 31, 94 (1977)

  71. [71]

    Cockburn, B., Luskin, M., Shu, C.-W., Suli, E.: Enhanced accuracy by post-processing for finite element methods for hyperbolic equations. Math. Comput. 72, 577 (2003)

  72. [72]

    Curtis, S., Kirby, R.M., Ryan, J.K., Shu, C.-W.: Postprocessing for the discontinuous Galerkin method over nonuniform meshes. SIAM J. Sci. Comput. 30, 272 (2007)

  73. [73]

    2016 294, 275 (J

    Li, X., Ryan, J.K., Kirby, R.M., Vuik, C.: Smoothness-increasing accuracy-conserving (SIAC) filters for deriva- tive approximations of discontinuous Galerkin (DG) solutions over nonuniform meshes and near boundaries. 2016 294, 275 (J. Comput. Appl. Math.)

  74. [74]

    Ryan, J.K., Li, X., Kirby, R.M., Vuik, K.: One-sided position-dependent smoothness-increasing accuracy- conserving (SIAC) over uniform and non-uniform meshes. J. Sci. Comput. 64, 773 (2015)

  75. [75]

    Mirzaee, H., King, J., Ryan, J.K., Kirby, R.M.: Smoothness-increasing accuracy-conserving filters for discontinuous Galerkin solutions over unstructured triangular meshes. SIAM J. Sci. Comput. 35, 212 (2013)

  76. [76]

    Nguyen, D., Peters, J.: Nonuniform discontinuous Galerkin filters via shift and scale. SIAM J. Numer. Anal. 54, 1401 (2016)

  77. [77]

    Peters, J.: General spline filters for discontinuous Galerkin solutions. Comput. Math. Appl. 70, 1046 (2015)

  78. [78]

    Theory and internal structure of ADER-DG method for ordinary differential equations

    Popov, I.S.: Theory and internal structure of ADER-DG method for ordinary differential equations (2025). https://arxiv.org/abs/2508.13824

  79. [79]

    Academic Press, USA (1970)

    Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, USA (1970)

  80. [80]

    MIR Publisher, Moscow (1981)

    Demidovich, B.P., Maron, I.A.: Computational Mathematics. MIR Publisher, Moscow (1981)

Showing first 80 references.