pith. machine review for the scientific record. sign in

arxiv: 2604.03013 · v1 · submitted 2026-04-03 · 🧮 math.NA · cs.NA

Recognition: 2 theorem links

· Lean Theorem

Spectral Deferred Corrections in the framework of Runge-Kutta methods

Eugen Bronasco , Joscha Fregin , Daniel Ruprecht , Gilles Vilmart
Authors on Pith no claims yet

Pith reviewed 2026-05-13 18:05 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords spectral deferred correctionsRunge-Kutta methodsButcher seriesorder of accuracystability analysiscollocation methodsquadratic invariantsnumerical ODE solvers
0
0 comments X

The pith

By embedding spectral deferred correction methods into the Runge-Kutta framework, p iterations yield at least order p accuracy independently of nodes and error discretization.

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

The paper interprets a broad class of spectral deferred correction methods as Runge-Kutta methods. It applies Butcher series to prove that p iterations produce a scheme whose order is at least p higher than that of the underlying Runge-Kutta method. The result holds regardless of the nodes chosen or the particular error discretization. Special inconsistent error discretizations are shown to create order jumps of two per iteration for collocation-based base methods while keeping the scheme parallelizable. Stability is analyzed and can match explicit Runge-Kutta behavior, yet can be strengthened by suitable combinations of discretizations; relaxation techniques are used to obtain variants that conserve quadratic invariants.

Core claim

We interpret a wide range of flavors of Spectral Deferred Corrections as Runge-Kutta methods. Using Butcher series, we show that the considered class of SDC methods achieve at least order p after p iterations compared to the underlying RKM, independently of the error discretisation chosen and the choice of nodes. For all collocation RKM, we analyse the phenomenon of order jumps in SDC iterations, where the order is increased by two at each iteration. We prove that it can be obtained by using appropriate inconsistent, implicit, parallelisable error discretisations.

What carries the argument

Embedding of the SDC iteration into the Butcher series of an underlying Runge-Kutta method to track order and stability.

If this is right

  • After p iterations the SDC scheme attains accuracy order at least one greater than the base Runge-Kutta method for each iteration performed.
  • Order increases by two per iteration become possible for collocation Runge-Kutta methods when inconsistent implicit error discretizations are used.
  • The stability region of the resulting SDC method can coincide with that of an explicit Runge-Kutta method yet can be enlarged by combining different error discretizations.
  • Relaxation Runge-Kutta methods applied inside the SDC framework produce time-stepping schemes that conserve quadratic invariants.
  • Numerical experiments verify that the observed convergence rates match the orders predicted by the Butcher-series analysis.

Where Pith is reading between the lines

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

  • The same Butcher-series embedding may let existing Runge-Kutta stability theory be reused directly to construct SDC schemes with prescribed stability for stiff problems.
  • Varying the base Runge-Kutta method inside the framework offers a systematic route to new parallel-in-time integrators.
  • The approach may extend beyond ordinary differential equations to other deferred-correction families for higher-order time integration.

Load-bearing premise

The SDC iteration process can be exactly represented inside the Runge-Kutta framework without extra constraints imposed by the error discretization or node choice.

What would settle it

Explicit computation of the Butcher coefficients of an SDC method after exactly p iterations that produces an order strictly less than the base order plus p, for any nodes and error discretization.

read the original abstract

We interpret a wide range of flavors of Spectral Deferred Corrections (SDC) as Runge-Kutta methods (RKM). Using Butcher series, we show that the considered class of SDC methods achieve at least order p after p iterations compared to the underlying RKM, independently of the error discretisation chosen and the choice of nodes. For all collocation RKM, we analyse the phenomenon of order jumps in SDC iterations, where the order is increased by two at each iteration. We prove that it can be obtained by using appropriate inconsistent, implicit, parallelisable error discretisations. We also investigate the stability properties of the new SDC methods which can in general reduce to that of explicit RKM, but it can be improved by suitable combinations of error discretisations. We confirm the convergence analysis with numerical experiments and we apply relaxation RKM to derive SDC variants that conserve quadratic invariants.

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 / 3 minor

Summary. The manuscript interprets a wide range of Spectral Deferred Correction (SDC) methods as Runge-Kutta methods (RKM) via Butcher series. It proves that the SDC class attains at least order p after exactly p iterations relative to the base RKM, independently of the chosen error discretization and nodes. For collocation RKMs it analyzes order jumps of two per iteration obtained from inconsistent implicit parallelizable error discretizations. Stability properties are examined (showing reduction to explicit RKM behavior or improvement via discretization combinations), and relaxation RKMs are applied to obtain SDC variants that conserve quadratic invariants. Numerical experiments confirm the convergence claims.

Significance. If the embedding and order analysis hold, the work supplies a unified theoretical framework that brings SDC methods under the standard tools of RKM theory, enabling systematic derivation of order conditions and stability results without dependence on particular discretizations. The independence result and the order-jump construction for collocation methods are potentially useful for designing flexible high-order integrators. The relaxation extension for quadratic invariants adds direct applicability to structure-preserving simulations.

major comments (1)
  1. [§3] §3 (main order theorem): the claim that order at least p is reached after p iterations independently of error discretization requires that the Butcher series expansion absorbs all discretization-specific terms without residual order reduction; an explicit verification for at least one non-collocation discretization (beyond the collocation case treated in §4) would confirm the independence statement.
minor comments (3)
  1. [§2] Notation for the error discretization operator and the iteration index should be introduced more explicitly in §2 to avoid ambiguity when the same symbols are reused for different SDC flavors.
  2. [§5] Figure 2 (stability regions) would benefit from an overlay of the underlying explicit RKM stability region for direct visual comparison.
  3. [§6] The numerical experiments in §6 report convergence rates but do not tabulate the observed orders against the predicted p; adding a summary table would strengthen the confirmation of the theoretical results.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive evaluation and the recommendation for minor revision. The comment on the main order theorem is addressed below; we agree that an explicit non-collocation illustration will strengthen the presentation of the independence result.

read point-by-point responses

  1. Referee: [§3] §3 (main order theorem): the claim that order at least p is reached after p iterations independently of error discretization requires that the Butcher series expansion absorbs all discretization-specific terms without residual order reduction; an explicit verification for at least one non-collocation discretization (beyond the collocation case treated in §4) would confirm the independence statement.

    Authors: The proof in §3 is deliberately formulated for arbitrary consistent error discretizations: the Butcher-series expansion shows that any local truncation terms arising from the chosen discretization enter at order higher than p and are absorbed without reducing the guaranteed order p after p iterations. This algebraic argument does not rely on collocation properties and therefore already establishes the claimed independence. Nevertheless, to make the absorption explicit for readers, we will add a short illustrative calculation in the revised §3 using a non-collocation base method (e.g., the trapezoidal rule with a simple forward-Euler error discretization) that confirms the order-p result without order reduction. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The derivation embeds SDC iterations into the Runge-Kutta framework via explicit Butcher series expansions, which are standard external tools in numerical analysis. The central result—that order at least p is achieved after p iterations independently of error discretization and nodes—follows directly from the series coefficients and collocation properties without any reduction to fitted parameters, self-definitions, or load-bearing self-citations. Order-jump analysis for collocation methods uses explicit inconsistent implicit discretizations, and stability discussion relies on known RKM properties. No step in the provided chain reduces by construction to the paper's own inputs; the analysis is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard mathematical theory of Butcher series and collocation methods with no free parameters fitted to data and no new entities postulated.

axioms (1)
  • standard math Butcher series theory accurately tracks the order conditions of Runge-Kutta methods
    Invoked to prove the order increase after each SDC iteration.

pith-pipeline@v0.9.0 · 5457 in / 1287 out tokens · 64437 ms · 2026-05-13T18:05:52.267128+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

50 extracted references · 50 canonical work pages

  1. [1]

    BIT Numerical Mathematics40(2), 241–266 (2000) https://doi.org/10.1023/A:1022338906936

    Dutt, A., Greengard, L., Rokhlin, V.: Spectral Deferred Correction methods for ordinary differential equations. BIT Numerical Mathematics40(2), 241–266 (2000) https://doi.org/10.1023/A:1022338906936

    work page doi:10.1023/a:1022338906936 2000

  2. [2]

    Communications in Mathematical Sciences1(3), 471–500 (2003) https://doi.org/10.4310/CMS.2003.v1.n3.a6

    Minion, M.L.: Semi-implicit spectral deferred correction methods for ordinary differential equations. Communications in Mathematical Sciences1(3), 471–500 (2003) https://doi.org/10.4310/CMS.2003.v1.n3.a6

    work page doi:10.4310/cms.2003.v1.n3.a6 2003

  3. [3]

    SIAM Journal on Scientific Computing38(4), 2535–2557 (2016) https: //doi.org/10.1137/16M1060078

    Ruprecht, D., Speck, R.: Spectral Deferred Corrections with fast-wave slow-wave splitting. SIAM Journal on Scientific Computing38(4), 2535–2557 (2016) https: //doi.org/10.1137/16M1060078

    work page doi:10.1137/16m1060078 2016

  4. [4]

    Journal of Computational Physics214(2), 633–656 (2006)

    Huang, J., Jia, J., Minion, M.: Accelerating the convergence of spectral deferred correction methods. Journal of Computational Physics214(2), 633–656 (2006)

    work page 2006

  5. [5]

    arXiv (2017)

    Speck, R.: Parallelizing Spectral Deferred Corrections across the Method. arXiv (2017). https://doi.org/10.48550/ARXIV.1703.08079

    work page doi:10.48550/arxiv.1703.08079 2017

  6. [6]

    SIAM Journal on Scientific Computing40(5), 2883–2904 (2018) https://doi.org/10.1137/18M117368X

    Crockatt, M.M., Christlieb, A.J.: Low-Storage Integral Deferred Correction Meth- ods for Scientific Computing. SIAM Journal on Scientific Computing40(5), 2883–2904 (2018) https://doi.org/10.1137/18M117368X

    work page doi:10.1137/18m117368x 2018

  7. [7]

    Discrete and Continuous Dynamical Systems – Series B8(3), 677–693 (2007)

    Xia, Y., Xu, Y., Shu, C.-W.: Efficient time discretization for local discontinuous Galerkin methods. Discrete and Continuous Dynamical Systems – Series B8(3), 677–693 (2007)

    work page 2007

  8. [8]

    BIT Numerical Mathematics55(4), 1219–1241 (2014) https://doi.org/10.1007/ s10543-014-0540-y

    Weiser, M.: Faster SDC convergence on non-equidistant grids by DIRK sweeps. BIT Numerical Mathematics55(4), 1219–1241 (2014) https://doi.org/10.1007/ s10543-014-0540-y

    work page 2014

  9. [9]

    Journal of Computational Physics295, 456–474 (2015) https://doi.org/10.1016/j.jcp.2015

    Winkel, M., Speck, R., Ruprecht, D.: A high-order Boris integrator. Journal of Computational Physics295, 456–474 (2015) https://doi.org/10.1016/j.jcp.2015. 04.022

    work page doi:10.1016/j.jcp.2015 2015

  10. [10]

    Communications in Applied Mathematics and Computational Science4(1), 27–56 (2009) https://doi.org/10

    Christlieb, A., Ong, B., Qiu, J.-M.: Comments on high-order integrators embed- ded within integral deferred correction methods. Communications in Applied Mathematics and Computational Science4(1), 27–56 (2009) https://doi.org/10. 2140/camcos.2009.4.27

    work page 2009

  11. [11]

    Journal of Scientific Computing83(60) (2020) https://doi.org/10

    Ong, B.W., Spiteri, R.J.: Deferred correction methods for ordinary differential equations. Journal of Scientific Computing83(60) (2020) https://doi.org/10. 1007/s10915-020-01235-8

    work page 2020

  12. [12]

    SIAM Journal on Scientific 33 Computing47(1), 430–453 (2025) https://doi.org/10.1137/24M1649800

    ˇCaklovi´ c, G., Lunet, T., G¨ otschel, S., Ruprecht, D.: Improving efficiency of paral- lel across the method Spectral Deferred Corrections. SIAM Journal on Scientific 33 Computing47(1), 430–453 (2025) https://doi.org/10.1137/24M1649800

    work page doi:10.1137/24m1649800 2025

  13. [13]

    Numerische Mathematik 29(4), 409–424 (1978) https://doi.org/10.1007/BF01432878

    Hairer, E.: On the order of Iterated Defect Correction. Numerische Mathematik 29(4), 409–424 (1978) https://doi.org/10.1007/BF01432878

    work page doi:10.1007/bf01432878 1978

  14. [14]

    Journal of Scientific Computing38(3), 251–289 (2009)

    Gottlieb, S., Ketcheson, D.I., Shu, C.-W.: High order strong stability preserving time discretizations. Journal of Scientific Computing38(3), 251–289 (2009)

    work page 2009

  15. [15]

    WORLD SCIENTIFIC, Singapore (2011)

    Gottlieb, S., Ketcheson, D., Shu, C.-W.: Strong Stability Preserving Runge-Kutta and Multistep Time Discretizations. WORLD SCIENTIFIC, Singapore (2011). https://doi.org/10.1142/7498

    work page doi:10.1142/7498 2011

  16. [16]

    SIAM Journal on Scientific and Statistical Computing12(5), 1000–1028 (1991) https://doi.org/10.1137/0912054

    Houwen, P.J., Sommeijer, B.P.: Iterated Runge–Kutta methods on parallel com- puters. SIAM Journal on Scientific and Statistical Computing12(5), 1000–1028 (1991) https://doi.org/10.1137/0912054

    work page doi:10.1137/0912054 1991

  17. [17]

    Mathematics of Computation 58(197), 135 (1992) https://doi.org/10.2307/2153025

    Houwen, P.J.V.D., Sommeijer, B.P., Couzy, W.: Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel Computers. Mathematics of Computation 58(197), 135 (1992) https://doi.org/10.2307/2153025

    work page doi:10.2307/2153025 1992

  18. [18]

    Applied Numerical Mathematics11(1–3), 169–188 (1993) https://doi.org/10.1016/0168-9274(93)90047-u

    Houwen, P.J., Sommeijer, B.P.: Analysis of parallel diagonally implicit iteration of Runge-Kutta methods. Applied Numerical Mathematics11(1–3), 169–188 (1993) https://doi.org/10.1016/0168-9274(93)90047-u

    work page doi:10.1016/0168-9274(93)90047-u 1993

  19. [19]

    SIAM Journal on Scientific Computing40(2), 787–816 (2018) https://doi.org/10.1137/16M1105232

    Boscarino, S., Qiu, J.-M., Russo, G.: Implicit-explicit Integral Deferred Correction methods for stiff problems. SIAM Journal on Scientific Computing40(2), 787–816 (2018) https://doi.org/10.1137/16M1105232

    work page doi:10.1137/16m1105232 2018

  20. [20]

    Mathematics and Computers in Simulation 81(12), 2646–2661 (2011) https://doi.org/10.1016/j.matcom.2011.05.007

    Calvo, M., Laburta, M.P., Montijano, J.I., R´ andez, L.: Error growth in the numer- ical integration of periodic orbits. Mathematics and Computers in Simulation 81(12), 2646–2661 (2011) https://doi.org/10.1016/j.matcom.2011.05.007

    work page doi:10.1016/j.matcom.2011.05.007 2011

  21. [21]

    SIAM Jour- nal on Numerical Analysis34(4), 1391–1417 (1997) https://doi.org/10.1137/ S0036142995281152

    Cano, B., Sanz-Serna, J.M.: Error growth in the numerical integration of periodic orbits, with application to hamiltonian and reversible systems. SIAM Jour- nal on Numerical Analysis34(4), 1391–1417 (1997) https://doi.org/10.1137/ S0036142995281152

    work page 1997

  22. [22]

    Journal of Scientific Computing84(1) (2020) https://doi.org/10.1007/ s10915-020-01277-y

    Ranocha, H., Ketcheson, D.I.: Relaxation Runge–Kutta methods for Hamiltonian problems. Journal of Scientific Computing84(1) (2020) https://doi.org/10.1007/ s10915-020-01277-y

    work page 2020

  23. [23]

    University of California at Berkeley (2005)

    Hansen, A.C., Strain, J.: Convergence theory for spectral deferred correction. University of California at Berkeley (2005)

    work page 2005

  24. [24]

    Applied Numerical Mathematics61, 961–973 (2011) https://doi.org/10.1016/j.apnum.2011.04.001

    Hansen, A.C., Strain, J.: On the order of deferred correction. Applied Numerical Mathematics61, 961–973 (2011) https://doi.org/10.1016/j.apnum.2011.04.001

    work page doi:10.1016/j.apnum.2011.04.001 2011

  25. [25]

    Communications in Applied Mathematics and Computational Science 14, 33–64 (2019) https://doi.org/10.2140/camcos.2019.14.33

    Causley, M.F., Seal, D.C.: On the convergence of spectral deferred correction 34 methods. Communications in Applied Mathematics and Computational Science 14, 33–64 (2019) https://doi.org/10.2140/camcos.2019.14.33

    work page doi:10.2140/camcos.2019.14.33 2019

  26. [26]

    Mathematics of Computation 79, 761–783 (2010) https://doi.org/10.1090/S0025-5718-09-02276-5

    Christlieb, A., Ong, B.W., Qiu, J.-M.: Integral deferred correction methods con- structed with high order Runge-Kutta integrators. Mathematics of Computation 79, 761–783 (2010) https://doi.org/10.1090/S0025-5718-09-02276-5

    work page doi:10.1090/s0025-5718-09-02276-5 2010

  27. [27]

    Communications in Applied Mathematics and Com- putational Science1(1), 169–205 (2006) https://doi.org/10.2140/camcos.2006.1

    Hagstrom, T., Zhou, R.: On the spectral deferred correction of splitting methods for initial value problems. Communications in Applied Mathematics and Com- putational Science1(1), 169–205 (2006) https://doi.org/10.2140/camcos.2006.1. 169

    work page doi:10.2140/camcos.2006.1 2006

  28. [28]

    Journal of Scientific Computing56(1), 1–13 (2013)

    Tang, T., Xie, H., Yin, X.: High-order convergence of Spectral Deferred Correction methods on general quadrature nodes. Journal of Scientific Computing56(1), 1–13 (2013)

    work page 2013

  29. [29]

    ACM Trans

    Ketcheson, D.I., Ranocha, H.: Computing with B-series. ACM Trans. Math. Softw.49(2) (2023) https://doi.org/10.1145/3573384

    work page doi:10.1145/3573384 2023

  30. [30]

    Springer, Berlin (2002)

    Hairer, E., Lubich, C., Wanner, G.: Geometric Numerical Integration: Structure- preserving Algorithms for Ordinary Differential Equations. Springer, Berlin (2002). https://doi.org/10.1007/3-540-30666-8

    work page doi:10.1007/3-540-30666-8 2002

  31. [31]

    Journal of the Aus- tralian Mathematical Society4(2), 179–194 (1964) https://doi.org/10.1017/ s1446788700023387

    Butcher, J.C.: On Runge-Kutta processes of high order. Journal of the Aus- tralian Mathematical Society4(2), 179–194 (1964) https://doi.org/10.1017/ s1446788700023387

    work page 1964

  32. [32]

    and Wanner, G

    Hairer, E., Wanner, G.: Solving Ordinary Differential Equations II: Stiff Problems. Springer, Berlin (1996). https://doi.org/10.1007/978-3-642-05221-7

    work page doi:10.1007/978-3-642-05221-7 1996

  33. [33]

    BIT 7(1), 65–70 (1967) https://doi.org/10.1007/bf01934126

    Widlund, O.B.: A note on unconditionally stable linear multistep methods. BIT 7(1), 65–70 (1967) https://doi.org/10.1007/bf01934126

    work page doi:10.1007/bf01934126 1967

  34. [34]

    BIT 3(1), 27–43 (1963) https://doi.org/10.1007/BF01963532

    Dahlquist, G.G.: A special stability problem for linear multistep methods. BIT 3(1), 27–43 (1963) https://doi.org/10.1007/BF01963532

    work page doi:10.1007/bf01963532 1963

  35. [35]

    PhD thesis, University of Waterloo Waterloo, Ontario (1969)

    Ehle, B.L.: On Pad´ e approximations to the exponential function and A- stable methods for the numerical solution of initial value problems. PhD thesis, University of Waterloo Waterloo, Ontario (1969)

    work page 1969

  36. [36]

    Math- ematics of Computation28(125), 145–162 (1974) https://doi.org/10.1090/ s0025-5718-1974-0331793-2

    Prothero, A., Robinson, A.: On the stability and accuracy of one-step methods for solving stiff systems of ordinary differential equations. Math- ematics of Computation28(125), 145–162 (1974) https://doi.org/10.1090/ s0025-5718-1974-0331793-2

    work page 1974

  37. [37]

    Applied Numerical Mathematics 35 25(2-3), 151–167 (1997) https://doi.org/10.1016/s0168-9274(97)00056-1

    Ascher, U.M., Ruuth, S.J., Spiteri, R.J.: Implicit-explicit Runge-Kutta methods for time-dependent partial differential equations. Applied Numerical Mathematics 35 25(2-3), 151–167 (1997) https://doi.org/10.1016/s0168-9274(97)00056-1

    work page doi:10.1016/s0168-9274(97)00056-1 1997

  38. [38]

    BIT Numerical Mathematics45(2), 341–373 (2005)

    Layton, A.T., Minion, M.L.: Implications of the choice of quadrature nodes for Picard Integral Deferred Corrections methods for ordinary differential equations. BIT Numerical Mathematics45(2), 341–373 (2005)

    work page 2005

  39. [39]

    PhD thesis, Hamburg University of Technology, Hamburg, Germany (March 2026)

    Fregin, J.: Analysis of spectral deferred corrections as Runge-Kutta methods and their application to numerical weather prediction. PhD thesis, Hamburg University of Technology, Hamburg, Germany (March 2026). In preparation

    work page 2026

  40. [40]

    Philosophical Magazine13, 172–176 (1857) https://doi.org/10.1080/14786445708642866

    Cayley, A.: On the theory of the analytical forms called trees. Philosophical Magazine13, 172–176 (1857) https://doi.org/10.1080/14786445708642866

    work page doi:10.1080/14786445708642866

  41. [41]

    Computing13(1), 1–15 (1974) https://doi.org/10.1007/BF02268387

    Hairer, E., Wanner, G.: On the Butcher group and general multi-value methods. Computing13(1), 1–15 (1974) https://doi.org/10.1007/BF02268387

    work page doi:10.1007/bf02268387 1974

  42. [42]

    Springer, Berlin (1993)

    Hairer, E., Nørsett, S.P., Wanner, G.: Solving Ordinary Differential Equations I: Nonstiff Problems, 2nd edn. Springer, Berlin (1993). https://doi.org/10.1007/ 978-3-540-78862-1

    work page 1993

  43. [43]

    Asia Pacific Mathematics Newsletter (2015)

    Mclachlan, R., Modin, K., Munthe-Kaas, H., Verdier, O.: What are Butcher series, really? the story of rooted trees and numerical methods for evolution equations. Asia Pacific Mathematics Newsletter (2015)

    work page 2015

  44. [44]

    In: Proceedings of the 8th International Congress on I Ndustrial and Applied Mathematics, pp

    Sanz-Serna, J.M., Murua, A.: Formal series and numerical integrators: some his- tory and some new techniques. In: Proceedings of the 8th International Congress on I Ndustrial and Applied Mathematics, pp. 311–331. Higher Ed. Press, Beijing, Beijing (2015)

    work page 2015

  45. [45]

    (ed.) Rigid Body DynamicsinEncyclopedia of Applied and Computational Mathematics, pp

    Vilmart, G.: In: Engquist, B. (ed.) Rigid Body DynamicsinEncyclopedia of Applied and Computational Mathematics, pp. 1268–1276. Springer, Berlin, Heidelberg (2015). https://doi.org/10.1007/978-3-540-70529-1 142

    work page doi:10.1007/978-3-540-70529-1 2015

  46. [46]

    Rota, G.-C., Strang, G.: A note on the joint spectral radius. Indag. Math22(4), 379–381 (1960)

    work page 1960

  47. [47]

    Linear Algebra and its Applications166, 21–27 (1992)

    Berger, M.A., Wang, Y.: Bounded semigroups of matrices. Linear Algebra and its Applications166, 21–27 (1992)

    work page 1992

  48. [48]

    Journal of Computational and Applied Mathematics140(1–2), 231–243 (2002) https://doi

    Del Buono, N., Mastroserio, C.: Explicit methods based on a class of four stage fourth order Runge–Kutta methods for preserving quadratic laws. Journal of Computational and Applied Mathematics140(1–2), 231–243 (2002) https://doi. org/10.1016/s0377-0427(01)00398-3

    work page doi:10.1016/s0377-0427(01)00398-3 2002

  49. [49]

    arXiv (2019)

    Ketcheson, D.I.: Relaxation Runge-Kutta Methods: Conservation and stability for Inner-Product Norms. arXiv (2019). https://doi.org/10.48550/ARXIV.1905. 09847 36

    work page doi:10.48550/arxiv.1905 2019

  50. [50]

    SIAM Journal on Scientific Computing42(2), 612–638 (2020) https://doi.org/10.1137/19m1263480 37

    Ranocha, H., Sayyari, M., Dalcin, L., Parsani, M., Ketcheson, D.I.: Relaxation Runge–Kutta methods: Fully discrete explicit entropy-stable schemes for the compressible Euler and Navier–Stokes equations. SIAM Journal on Scientific Computing42(2), 612–638 (2020) https://doi.org/10.1137/19m1263480 37

    work page doi:10.1137/19m1263480 2020