Pith. sign in

REVIEW 4 major objections 2 minor 47 references

Voltage Support Procurement in Transmission Grids: Incentive Design via Online Bilevel Games

T0 review · 4 major / 2 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A transmission operator can hold voltage stable by learning financial incentives from live measurements.

desk verdict The submission is a mixed record: the abstract is a TSO-DSO voltage support game paper, but the full text is a different cut-cell DG stability paper, so the claimed work is unreviewable as submitted. read the letter →

arxiv 2508.05378 v2 pith:V2XMOGFV submitted 2025-08-07 math.OC

Zhisen Jiang , Saverio Bolognani , Giuseppe Belgioioso This is my paper
classification math.OC MSC 91A65
keywords voltageregulationreactivepowerStackelberggameonlinefeedbackoptimizationincentivedesigntransmissiongriddistributedenergyresourcesbilevel
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper tries to show that a transmission system operator can secure voltage support from self-interested distribution operators by dynamically adjusting financial incentives, using only live voltage measurements. It frames the interaction as a Stackelberg game, in which the TSO leads by setting incentives and the DSOs respond with reactive power injections. The proposed algorithm updates incentives via gradient steps informed by online feedback optimization, so that voltage stability can be maintained in real time even when the grid model is imperfect or operating conditions drift. If the claim holds, voltage regulation becomes a market mechanism that can be co-designed with automation, rather than a purely model-based control problem.

What carries the argument

The Stackelberg (bilevel) game between TSO and DSOs, combined with online feedback optimization: the TSO updates incentive signals by gradient steps computed from measured voltages rather than from a fully trusted model, and each DSO adjusts reactive power according to its own objective. The bilevel structure lets the designer anticipate strategic responses, while the measurement feedback keeps the loop closed in real time.

What would settle it

A simulation or field test in which DSOs use a different decision rule (e.g., profit-seeking with private constraints) than the assumed game model, while load or generation varies faster than the incentive updates; if voltage limits are violated before the algorithm converges, the claim of robust real-time voltage support fails.

Watch

Extended reading notes

Core claim

The central claim is that reactive-power procurement for voltage support can be cast as a bilevel game and solved online: the TSO's incentive signal is the leader's decision, the DSOs' reactive-power injections are the followers' best responses, and a gradient-based rule drives the incentives toward values under which the voltage profile stays within limits. The algorithm uses voltage measurements in both levels' policies, which is what makes it robust to model uncertainty and changing operating conditions. Numerical experiments on a 5-bus transmission grid are offered as evidence that voltage regulation is achieved despite the strategic behavior of DSOs.

Load-bearing premise

The guarantee rests on the premise that each DSO's reactive-power response follows the modeled Stackelberg best response, and that the gradient updates converge to a stabilizing incentive within the time scale of changing operating conditions.

Editorial extensions

If this is right

  • If the claim is right, a TSO can keep voltage within bounds without knowing DSO cost structures exactly, since incentives are corrected from measurements.
  • The approach turns reactive-power support into an incentive-compatible service, potentially reducing the need for direct dispatch commands.
  • Real-time voltage control can be co-designed with distribution-level automation, since both TSO and DSO policies depend only on voltage measurements.
  • The 5-bus demonstration suggests the method scales to small transmission networks; extension to larger grids is a natural next step.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the algorithm is measurement-driven, it may also handle unmodeled line outages or topology changes as long as voltage feedback remains available; the paper does not explicitly claim this.
  • A testable extension would compare the learned incentive trajectory against a known analytic Stackelberg equilibrium in a simple two-DSO case, to check whether the learned incentives coincide with the theoretical equilibrium.
  • The robustness claim likely depends on the step size and on how fast DSOs respond; quantifying this trade-off would be a useful follow-up the paper leaves implicit.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 2 minor

Summary. This manuscript record is internally inconsistent. The header/title correspond to arXiv:2508.05378, 'Voltage Support Procurement in Transmission Grids: Incentive Design via Online Bilevel Games', whose abstract claims a Stackelberg game between a TSO and DSOs, a gradient-based incentive-update algorithm, online feedback optimization from voltage measurements, robustness guarantees, and a 5-bus numerical demonstration. The supplied full text, however, is arXiv:2508.05372v2, 'The domain-of-dependence stabilization for cut-cell meshes is fully discretely stable', a numerical analysis paper on hyperbolic PDE discretizations. None of the sections, equations, theorems, or simulations in the supplied body concern voltage regulation, reactive power, incentives, DSO/TSO interaction, or bilevel games. Consequently, the paper's central claims cannot be verified or even located in the submitted material.

Significance. If the claimed game-theoretic online feedback optimization framework were present and correct, it could be a meaningful contribution to reactive-power procurement and voltage support under strategic DSO behavior. However, on the evidence in this record, no such framework exists to evaluate. The supplied cut-cell stability paper may itself be a competent contribution to numerical analysis, but it is a different paper and does not support the abstract's claims. The significance of the claimed work is therefore unassessable from the submitted text.

major comments (4)
  1. [Manuscript header vs. full text] The record is a different paper. The header identifies the manuscript as arXiv:2508.05378 with the voltage-support title, but the full text begins with 'The domain-of-dependence stabilization for cut-cell meshes is fully discretely stable', identifies itself as arXiv:2508.05372v2 [math.NA], and develops a fully discrete stability analysis of a cut-cell DG method. This is not a presentation defect: every claim in the abstract is absent from the body.
  2. [Sections 1-8] No game-theoretic model is present. The abstract's central elements—Stackelberg game, TSO incentive design, DSO reactive-power responses, voltage measurements, online feedback optimization—appear nowhere in the supplied text. There is no definition of the game, no incentive variable, no bilevel structure, and no theorem about convergence or stability of an incentive update.
  3. [Abstract claims of guarantees] The abstract states that the algorithm 'ensure[s]' DSO reactive-power adjustments maintain voltage stability, with robustness to model uncertainty and changing operating conditions. The supplied text contains no theorem, proof, or error analysis for any such algorithm. The only theoretical result, Theorem 2.3, bounds an operator norm for a linear advection semidiscretization; it has no connection to voltage regulation or incentive dynamics.
  4. [Section 7] The claimed numerical support is absent. The abstract reports experiments on a 5-bus transmission grid, but Section 7 of the supplied text contains 1D and 2D linear-advection simulations on cut-cell meshes. There is no 5-bus case, no voltage profile, no reactive-power trajectory, and no incentive trajectory. The effectiveness claim is therefore unsupported by the submitted evidence.
minor comments (2)
  1. [References] The reference list is entirely devoted to numerical analysis, cut-cell methods, and Runge-Kutta stability; there are no references to electricity markets, Stackelberg games, online optimization, or voltage control. This is consistent with the full text being a different manuscript.
  2. [Author/title metadata] The author names and ORCIDs in the body belong to the cut-cell paper, not to the manuscript identified by the header. The metadata should be reconciled by the editor before any further processing.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation is identifiable; the supplied full text is a different paper from the abstract's claimed subject, so the voltage-support claims have no derivation chain in the record to assess.

full rationale

The supplied full text is arXiv:2508.05372v2, "The domain-of-dependence stabilization for cut-cell meshes is fully discretely stable," not the voltage-support paper (arXiv:2508.05378) described in the abstract. The abstract's Stackelberg game, TSO/DSO incentives, online feedback optimization, voltage measurements, and 5-bus experiments have no matching equations, theorems, or experiments in the full text. Consequently, there is no derivation chain for the claimed voltage-support result to walk, and no specific circular reduction can be quoted. Within the full text that was actually supplied, the derivation is self-contained: Theorem 2.3 is proved from the explicit matrix formulation (2.17)-(2.18), interpolation/quadrature estimates, and operator-norm bounds. The paper cites prior semidiscrete stability from [38] as a premise, and some of those authors overlap with the present authors, but that cited result is a previously published separate theorem and is not identical to the fully discrete stability claim being proved; the proof does not assume its own conclusion. The optimized lambda_c in Section 6 is explicitly chosen by minimizing the same operator norm (6.1) and is then used in numerical tests, so it is a parameter optimization, not a fitted quantity renamed as a prediction. No self-definitional step, fitted-input-as-prediction step, or load-bearing self-citation chain is evident. The abstract/full-text mismatch is a serious verification defect, but it is a completeness or provenance issue, not a circularity issue.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

This ledger is reconstructed from the abstract only, because the supplied full text is a different manuscript (Petri et al., arXiv:2508.05372v2, on cut-cell DoD stabilization for hyperbolic PDEs). Each item is inferred from the abstract's wording and must be checked against the actual body of the voltage support paper before it can be confirmed.

free parameters (2)
  • incentive update step size (gradient gain) = not stated in abstract
    The gradient-based iterative incentive update requires a step size or gain that controls convergence speed; the abstract states no value or adaptation rule.
  • incentive coefficients (reactive power price or penalty weights) = not stated in abstract
    The Stackelberg incentive mechanism's coefficients must be set by the TSO; the abstract does not state how they are initialized or bounded.
assumptions (4)
  • domain assumption DSO reactive power responses follow the Stackelberg equilibrium of the modeled game
    The abstract frames the problem as 'strategic interactions of self-interested DSOs'; the incentive design only guarantees voltage support if modeled and actual DSO behavior coincide.
  • domain assumption Real-time voltage measurements are available to TSO and DSO policies
    The abstract states the algorithm 'utiliz[es] voltage measurements in both TSO's and DSOs' policies'; this presumes measurement availability and communication infrastructure.
  • domain assumption The bilevel gradient update converges within the control interval under changing operating conditions
    The abstract claims 'real-time implementation' and robustness to 'changing operating conditions' without stating convexity, smoothness, or time-scale-separation conditions.
  • domain assumption The power-flow model behind the 5-bus test is an adequate representation of transmission voltage behavior
    Voltage support conclusions depend on the fidelity of the grid model; the abstract does not specify AC, linearized, or reduced power-flow assumptions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Voltage Support Procurement in Transmission Grids: Incentive Design via Online Bilevel Games." pith.science (2026). https://pith.science/paper/V2XMOGFV

@misc{pith2026250805378,
  author       = {Pith},
  title        = {Pith review of: Voltage Support Procurement in Transmission Grids: Incentive Design via Online Bilevel Games},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/V2XMOGFV}},
  note         = {Machine review of arXiv:2508.05378}
}
read the original abstract

The integration of distributed energy resources into transmission grid operations presents a complex challenge, particularly in the context of reactive power procurement for voltage support. This paper addresses this challenge by formulating the voltage regulation problem as a Stackelberg game, where the Transmission System Operator (TSO) designs incentives to guide the reactive power responses of Distribution System Operators (DSOs). We utilize a gradient-based iterative algorithm that updates the incentives to ensure that DSOs adjust their reactive power injections to maintain voltage stability. We incorporate principles from online feedback optimization to enable real-time implementation, utilizing voltage measurements in both TSO's and DSOs' policies. This approach not only enhances the robustness against model uncertainties and changing operating conditions but also facilitates the co-design of incentives and automation. Numerical experiments on a 5-bus transmission grid demonstrate the effectiveness of our approach in achieving voltage regulation while accommodating the strategic interactions of self-interested DSOs.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

47 extracted references · 14 canonical work pages

  1. [1]

    Necessary and Sufficient Conditions for Strong Stability of Explicit Runge-Kutta Methods

    F. Achleitner, A. Arnold, and A. Jüngel. “Necessary and Sufficient Conditions for Strong Stability of Explicit Runge-Kutta Methods.” In:From Particle Systems to Partial Differential Equations. PSPDE X, Braga, Portugal, June 2022. Vol. 465. Proceedings in Mathematics & Statistics. Springer, 2024, pp. 1–21.doi:10.1007/978-3-031-65195-3_1

    doi:10.1007/978-3-031-65195-3_1 2022

  2. [2]

    TheDuneframework:Basicconceptsand recentdevelopments

    P.Bastian,M.Blatt,A.Dedner,N.-A.Dreier,C.Engwer,R.Fritze,C.Gräser,C.Grüninger,D. Kempf,R.Klöfkorn,M.Ohlberger,andO.Sander.“TheDuneframework:Basicconceptsand recentdevelopments.”In:Computers&MathematicswithApplications81(2021).Development and Application of Open-source Software for Problems with Numerical PDEs, pp. 75–112. doi:10.1016/j.camwa.2020.06.007

    doi:10.1016/j.camwa.2020.06.007 2021

  3. [3]

    A Generic Grid Interface for Parallel and Adaptive Scientific Computing. Part II: Implementation and Tests in DUNE

    P. Bastian, M. Blatt, A. Dedner, C. Engwer, R. Klöfkorn, R. Kornhuber, M. Ohlberger, and O. Sander. “A Generic Grid Interface for Parallel and Adaptive Scientific Computing. Part II: Implementation and Tests in DUNE.” In:Computing82.2–3 (2008), pp. 121–138.doi:10. 1007/s00607-008-0004-9

    work page 2008

  4. [4]

    A Generic Grid Interface for Parallel and Adaptive Scientific Computing. Part I: Abstract Framework

    P. Bastian, M. Blatt, A. Dedner, C. Engwer, R. Klöfkorn, M. Ohlberger, and O. Sander. “A Generic Grid Interface for Parallel and Adaptive Scientific Computing. Part I: Abstract Framework.” In:Computing82.2–3 (2008), pp. 103–119.doi:10.1007/s00607-008-0003-x

    doi:10.1007/s00607-008-0003-x 2008

  5. [5]

    A New Provably Stable Weighted State Redistribution Algo- rithm

    M. Berger and A. Giuliani. “A New Provably Stable Weighted State Redistribution Algo- rithm.” In:SIAM Journal on Scientific Computing46.5 (2024), A2848–A2873.doi:10.1137/ 23M1597484

    work page 2024

  6. [6]

    A state redistribution algorithm for finite volume schemes on cut cell meshes

    M. Berger and A. Giuliani. “A state redistribution algorithm for finite volume schemes on cut cell meshes.” In:Journal of Computational Physics428 (2021), p. 109820.doi:10.1016/j. jcp.2020.109820. 29

    arXiv 2021

  7. [7]

    Julia:AFreshApproachtoNumerical Computing

    J.Bezanson,A.Edelman,S.Karpinski,andV.B.Shah.“Julia:AFreshApproachtoNumerical Computing.” In:SIAM Review59.1 (2017), pp. 65–98.doi:10.1137/141000671

    doi:10.1137/141000671 2017

  8. [8]

    Error Analysis of a First-Order DoD Cut CellMethodfor2DUnsteadyAdvection

    G. Birke, C. Engwer, J. Giesselmann, and S. May. “Error Analysis of a First-Order DoD Cut CellMethodfor2DUnsteadyAdvection.”In:JournalofScientificComputing106.1(2025),p.1. doi:10.1007/s10915-025-03091-w

    work page doi:10.1007/s10915-025-03091-w 2025

Show all 47 references
  1. [9]

    Birke, C

    G. Birke, C. Engwer, S. May, L. Petri, and H. Ranocha.An Energy-Preserving Domain of Dependence Stabilization for the Linear Wave Equation on Cut-Cell Meshes. under review. 2026. doi:10.48550/arXiv.2601.19877

    2026 doi

  2. [10]

    DoD Stabilization of linear hyperbolic PDEs on general cut-cell meshes

    G. Birke, C. Engwer, S. May, and F. Streitbürger. “DoD Stabilization of linear hyperbolic PDEs on general cut-cell meshes.” In:PAMM23.1 (2023), e202200198.doi:10.1002/pamm. 202200198

    2023 doi

  3. [11]

    Blatt, S

    M. Blatt, S. Burbulla, A. Burchardt, A. Dedner, C. Engwer, C. Gräser, C. Grüninger, R. Klöfkorn, T. Koch, S. O. D. L. Ríos, S. Praetorius, and O. Sander.The Distributed and Unified Numerics Environment (DUNE), Version 2.10. 2025.doi:10.48550/arXiv.2506.23558

    2025 doi arXiv

  4. [12]

    I. N. Bronstein.Taschenbuch der Mathematik. Publication Title: Taschenbuch der Mathematik. Thun, Frankfurt am Main: Harri Deutsch, 1987

    1987

  5. [13]

    Canuto, M

    C. Canuto, M. Hussaini, A. Quarteroni, and T. Zang.Spectral Methods: Fundamentals in Single Domains. Vol. 23. 2006.doi:10.1007/978-3-540-30726-6

    2006 doi

  6. [14]

    Makie.jl: Flexible high-performance data visualization for Julia

    S. Danisch and J. Krumbiegel. “Makie.jl: Flexible high-performance data visualization for Julia.” In:Journal of Open Source Software6.65 (2021), p. 3349.doi:10.21105/joss.03349

    2021 doi

  7. [15]

    Academic Press, 2014.doi:10.1016/C2013-0-10566-1

    P.Davis,P.Rabinowitz,andW.Rheinbolt.MethodsofNumericalIntegration.ComputerScience and Applied Mathematics. Academic Press, 2014.doi:10.1016/C2013-0-10566-1

    2014 doi

  8. [16]

    doi:10.1007/978-3-642-22980-0

    D.DiPietroandA.Ern.MathematicalAspectsofDiscontinuousGalerkinMethods.Vol.69.2012. doi:10.1007/978-3-642-22980-0

    2012 doi

  9. [17]

    The interface for functions in the dune- functions module

    C. Engwer, C. Gräser, S. Müthing, and O. Sander. “The interface for functions in the dune- functions module.” In:Archive of Numerical Software(2017).doi:10.11588/heibooks.280. c3281

    2017 doi

  10. [18]

    Geometric Reconstruction of Implicitly Defined Surfaces and Domains with Topological Guarantees

    C. Engwer and A. Nüßing. “Geometric Reconstruction of Implicitly Defined Surfaces and Domains with Topological Guarantees.” In:ACM Trans. Math. Softw.44.2 (2017).doi:10. 1145/3104989

    2017

  11. [19]

    under review

    C.Engwer,C.Gräser,S.Müthing,S.Praetorius,andO.Sander.ConceptsforComposingFinite Element Function Space Bases. under review. 2025.doi:10.48550/arXiv.2508.10125

    2025 doi arXiv

  12. [20]

    A stabilized DG cut cell method for discretizing the linear transport equation

    C. Engwer, S. May, A. Nüßing, and F. Streitbürger. “A stabilized DG cut cell method for discretizing the linear transport equation.” In:SIAM Journal on Scientific Computing42.6 (2020), A3677–A3703.doi:10.1137/19M1268318

    2020 doi

  13. [21]

    High Order Cut Discontinuous Galerkin Methods for Hyperbolic Conservation Laws in One Space Dimension

    P. Fu and G. Kreiss. “High Order Cut Discontinuous Galerkin Methods for Hyperbolic Conservation Laws in One Space Dimension.” In:SIAM Journal on Scientific Computing43.4 (2021), A2404–A2424.doi:10.1137/20M1349060

    2021 doi

  14. [22]

    A Skew-Symmetric Discontinuous Galerkin Spectral Element Discretization and Its Relation to SBP-SAT Finite Difference Methods

    G. J. Gassner. “A Skew-Symmetric Discontinuous Galerkin Spectral Element Discretization and Its Relation to SBP-SAT Finite Difference Methods.” In:SIAM Journal on Scientific Com- puting35.3 (2013), A1233–A1253.doi:10.1137/120890144

    2013 doi

  15. [23]

    ATwo-DimensionalStabilizedDiscontinuousGalerkinMethodonCurvilinear Embedded Boundary Grids

    A.Giuliani.“ATwo-DimensionalStabilizedDiscontinuousGalerkinMethodonCurvilinear Embedded Boundary Grids.” In:SIAM Journal on Scientific Computing44.1 (2022), A389– A415.doi:10.1137/21M1396277

    2022 doi

  16. [24]

    G. H. Golub and C. F. Van Loan.Matrix Computations - 4th Edition. Philadelphia, PA: Johns Hopkins University Press, 2013.doi:10.1137/1.9781421407944. 30

    2013 doi

  17. [25]

    Total Variation Diminishing Runge-Kutta Schemes

    S. Gottlieb and C.-W. Shu. “Total Variation Diminishing Runge-Kutta Schemes.” In:Mathe- matics of Computation67 (1996), pp. 73–85.doi:10.1090/S0025-5718-98-00913-2

    1996 doi

  18. [26]

    Stabilized Cut Discontinuous Galerkin Methods for Advection-Reaction Problems

    C. Gürkan, S. Sticko, and A. Massing. “Stabilized Cut Discontinuous Galerkin Methods for Advection-Reaction Problems.” In:SIAM Journal on Scientific Computing42.5 (2020), A2620– A2654.doi:10.1137/18M1206461

    2020 doi

  19. [27]

    Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-StorageImplementations

    D. I. Ketcheson. “Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-StorageImplementations.”In:SIAMJournalonScientificComputing30.4(2008),pp.2113– 2136.doi:10.1137/07070485X

    2008 doi

  20. [28]

    D. A. Kopriva.Implementing Spectral Methods for Partial Differential Equations: Algorithms for Scientists and Engineers. Springer, 2009.doi:10.1007/978-90-481-2261-5

    2009 doi

  21. [29]

    OntheQuadratureandWeakFormChoicesinCollocation Type Discontinuous Galerkin Spectral Element Methods

    D.A.KoprivaandG.J.Gassner.“OntheQuadratureandWeakFormChoicesinCollocation Type Discontinuous Galerkin Spectral Element Methods.” In:Journal of Scientific Computing 44.2 (2010), pp. 136–155.doi:10.1007/s10915-010-9372-3

    2010 doi

  22. [30]

    Error Boundedness of Discontinuous Galerkin Spectral Element Approximations of Hyperbolic Problems

    D. A. Kopriva, J. Nordström, and G. J. Gassner. “Error Boundedness of Discontinuous Galerkin Spectral Element Approximations of Hyperbolic Problems.” In:Journal of Scien- tific Computing72.1 (2017), pp. 314–330.doi:10.1007/s10915-017-0358-2

    2017 doi

  23. [31]

    DoD stabilization for non-linear hyperbolic conservation laws on cut cell meshes in one dimension

    S. May and F. Streitbürger. “DoD stabilization for non-linear hyperbolic conservation laws on cut cell meshes in one dimension.” In:Applied Mathematics and Computation419 (2022), p. 126854.doi:10.1016/j.amc.2021.126854

    2022

  24. [32]

    On the Legendre–Gauss–Lobatto Points and Weights

    S. V. Parter. “On the Legendre–Gauss–Lobatto Points and Weights.” In:Journal of Scientific Computing14.4 (1999), 347–355.doi:10.1023/A:1023204631825

    1999 doi

  25. [33]

    The domain-of- dependence stabilization for cut-cell meshes is fully discretely stable

    L. Petri, G. Birke, C. Engwer, and H. Ranocha.Reproducibility repository for "The domain-of- dependence stabilization for cut-cell meshes is fully discretely stable".https : / / github . com / louispetri/2025_dod_linear_stability. 2025.doi:10.5281/zenodo.16751959

    2025 doi

  26. [34]

    Petri, S

    L. Petri, S. Ortleb, G. Birke, C. Engwer, and H. Ranocha.Domain-of-dependence-stabilized cut- celldiscretizationsoflinearkineticmodelswithsummation-by-partsproperties.underreview.2026. doi:10.48550/arXiv.2601.05817

    2026 doi

  27. [35]

    SummationByPartsOperators.jl: A Julia library of provably stable semidis- cretization techniques with mimetic properties

    H. Ranocha. “SummationByPartsOperators.jl: A Julia library of provably stable semidis- cretization techniques with mimetic properties.” In:Journal of Open Source Software6.64 (2021), p. 3454.doi:10.21105/joss.03454

    2021 doi

  28. [36]

    𝐿2 Stability of Explicit Runge-Kutta Schemes

    H. Ranocha and P. Öffner. “𝐿2 Stability of Explicit Runge-Kutta Schemes.” In:Journal of Scientific Computing75.2 (2018), pp. 1040–1056.doi:10.1007/s10915-017-0595-4

    2018 doi

  29. [37]

    HigherOrderCutFiniteElementsfortheWaveEquation

    S.StickoandG.Kreiss.“HigherOrderCutFiniteElementsfortheWaveEquation.”In:Journal of Scientific Computing80.3 (2019), pp. 1867–1887.doi:10.1007/s10915-019-01004-2

    2019 doi

  30. [38]

    DoDStabilizationforHigher-OrderAdvec- tion in Two Dimensions

    F.Streitbürger,G.Birke,C.Engwer,andS.May.“DoDStabilizationforHigher-OrderAdvec- tion in Two Dimensions.” In:Spectral and High Order Methods for Partial Differential Equations ICOSAHOM 2020+1. Springer, 2023, pp. 495–508.doi:10.1007/978-3-031-20432-6_33

    2020 doi

  31. [39]

    StabilizeddiscontinuousGalerkinmethodsforsolvinghyperbolicconserva- tion laws on grids with embedded objects

    F.Streitbürger.“StabilizeddiscontinuousGalerkinmethodsforsolvinghyperbolicconserva- tion laws on grids with embedded objects.” PhD thesis. Technische Universität Dortmund, 2023.doi:10.17877/de290r-23928

    2023 doi

  32. [40]

    StabilityofthefourthorderRunge-Kuttamethodfortime-dependent partial differential equations

    Z.SunandC.-W.Shu.“StabilityofthefourthorderRunge-Kuttamethodfortime-dependent partial differential equations.” In:Annals of Mathematical Sciences and Applications2.2 (2017), pp. 255–284.doi:10.4310/AMSA.2017.v2.n2.a3

    2017 doi

  33. [41]

    Strong Stability of Explicit Runge-Kutta Time Discretizations

    Z. Sun and C.-W. Shu. “Strong Stability of Explicit Runge-Kutta Time Discretizations.” In: SIAM Journal on Numerical Analysis57.3 (2019), pp. 1158–1182.doi:10.1137/18M122892X

    2019 doi

  34. [42]

    Szegő.Orthogonal Polynomials

    G. Szegő.Orthogonal Polynomials. American Math. Soc: Colloquium publ. American Mathe- matical Society, 1975. 31

    1975

  35. [43]

    From Semidiscrete to Fully Discrete: Stability of Runge-Kutta Schemes by the Energy Method II

    E. Tadmor. “From Semidiscrete to Fully Discrete: Stability of Runge-Kutta Schemes by the Energy Method II.” In:Collected Lectures on the Preservation of Stability under Discretization. Vol. 109. Proceedings in Applied Mathematics. Philadelphia: Society for Industrial and Appli...

    2002

  36. [44]

    OnthestabilityofRunge–KuttamethodsforarbitrarilylargesystemsofODEs

    E.Tadmor.“OnthestabilityofRunge–KuttamethodsforarbitrarilylargesystemsofODEs.” In:Communications on Pure and Applied Mathematicsn/a.n/a ().doi:10.1002/cpa.22238

    doi

  37. [45]

    Tange.GNU Parallel 20250422 (’Tariffs’)

    O. Tange.GNU Parallel 20250422 (’Tariffs’). GNU Parallel is a general parallelizer to run multiple serial command line programs in parallel without changing them. 2025.doi:10. 5281/zenodo.15265748

    2025

  38. [46]

    An energy stable high-order cut cell discontinuous Galerkinmethodwithstateredistributionforwavepropagation

    C. G. Taylor, L. C. Wilcox, and J. Chan. “An energy stable high-order cut cell discontinuous Galerkinmethodwithstateredistributionforwavepropagation.”In:JournalofComputational Physics521 (2025), p. 113528.doi:10.1016/j.jcp.2024.113528

    2025

  39. [47]

    The L2-norm Stability Analysis of Runge–Kutta Discontinuous Galerkin Methods for Linear Hyperbolic Equations

    Y. Xu, Q. Zhang, C.-w. Shu, and H. Wang. “The L2-norm Stability Analysis of Runge–Kutta Discontinuous Galerkin Methods for Linear Hyperbolic Equations.” In:SIAM Journal on Numerical Analysis57.4 (2019), pp. 1574–1601.doi:10.1137/18M1230700. 32

    2019 doi

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.