pith. sign in

arxiv: 1907.07806 · v1 · pith:PLAI7FZRnew · submitted 2019-07-17 · 🧮 math.OC · cs.NA· math.NA

Optimization of a partial differential equation on a complex network

Martin Stoll , Max Winkler This is my paper

Pith reviewed 2026-05-24 20:04 UTC · model grok-4.3

classification 🧮 math.OC cs.NAmath.NA
keywords metric graphsPDE-constrained optimizationfinite elementspreconditioningDirichlet controlserror boundsnetwork optimization
0
0 comments X

The pith

Finite element discretization of PDE optimization on metric graphs yields rigorous error bounds and scalable preconditioners for sparse Dirichlet controls.

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

The paper sets up and solves an optimization problem whose constraint is a differential equation posed on a metric graph, with the control restricted to a small number of Dirichlet nodes. It discretizes this problem by finite elements, derives a priori error bounds that continue to hold after optimization, and supplies a preconditioner that keeps the resulting linear systems tractable at large scale. Numerical tests on several graphs confirm that the scheme remains stable and accurate. The approach therefore supplies a concrete, provably convergent route to design problems on networks that arise in physics and information flow.

Core claim

Discretizing the PDE-constrained optimization problem on a metric graph by finite elements produces rigorous a priori error bounds that remain valid when the controls are sparse Dirichlet nodes; an efficient preconditioning strategy then renders the discrete systems solvable at large scale, and the overall method exhibits robust performance across numerical examples.

What carries the argument

Finite-element discretization of the PDE on the metric graph together with a priori error analysis and a preconditioner for the resulting saddle-point system under sparse Dirichlet control.

If this is right

  • The proven error bounds guarantee that the computed optimal control converges to the true continuous optimum as the mesh is refined.
  • The preconditioner reduces the cost of solving the large linear systems that arise from the discretization, making the method practical for networks with thousands of edges.
  • The same discretization and analysis framework applies to a range of graph topologies and control placements demonstrated in the examples.
  • Robustness observed in the tests implies that the method can be used without extensive parameter tuning across different network problems.

Where Pith is reading between the lines

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

  • The same error-analysis technique could be tested on time-dependent or nonlinear equations posed on the same graphs.
  • Results on metric graphs may transfer to discrete graph Laplacians when edge lengths are taken to zero, providing a bridge to purely combinatorial network optimization.
  • The sparse-control setting suggests direct application to sensor or actuator placement problems on real infrastructure networks.

Load-bearing premise

The finite element discretization of the PDE on the metric graph admits rigorous a priori error bounds that remain valid under the optimization with sparse Dirichlet controls.

What would settle it

A computed example in which the discrete optimal control fails to converge to the continuous optimum at the predicted rate, or a large network instance in which the preconditioner iteration count grows with problem size.

Figures

Figures reproduced from arXiv: 1907.07806 by Martin Stoll, Max Winkler.

Figure 1
Figure 1. Figure 1: Eigenvalue plots of the preconditioned matrices. In particular, preconditioned [PITH_FULL_IMAGE:figures/full_fig_p014_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Optimal solution of the Dirichlet control problem in a star-shaped network. [PITH_FULL_IMAGE:figures/full_fig_p016_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Solution of the optimal Dirichlet control problem on an L-shaped finite differ [PITH_FULL_IMAGE:figures/full_fig_p018_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example networks investigated in Section [PITH_FULL_IMAGE:figures/full_fig_p019_4.png] view at source ↗
read the original abstract

Differential equations on metric graphs can describe many phenomena in the physical world but also the spread of information on social media. To efficiently compute the solution is a hard task in numerical analysis. Solving a design problem, where the optimal setup for a desired state is given, is even more challenging. In this work, we focus on the task of solving an optimization problem subject to a differential equation on a metric graph with the control defined on a small set of Dirichlet nodes. We discuss the discretization by finite elements and provide rigorous error bounds as well as an efficient preconditioning strategy to deal with the large-scale case. We show in various examples that the method performs very robustly.

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

0 major / 3 minor

Summary. The manuscript addresses the optimization of a PDE posed on a metric graph, with the control restricted to a sparse set of Dirichlet nodes. It develops a finite-element discretization of the state equation, derives rigorous a priori error bounds for the discrete solution, proposes an efficient preconditioner for the resulting large-scale saddle-point systems, and illustrates the overall approach on several numerical examples that demonstrate robustness.

Significance. If the claimed a priori error bounds remain valid once the state equation is embedded in the optimization problem and if the preconditioner scales well, the work supplies a theoretically grounded and practically usable framework for a class of network optimization problems that arise in both physical modeling and information-flow applications. The explicit provision of rigorous bounds together with a scalable solver strategy constitutes a clear strength.

minor comments (3)
  1. [Abstract] The abstract states that rigorous error bounds are provided, yet the precise assumptions on the graph, the PDE coefficients, and the admissible control set are not summarized; a short sentence clarifying these hypotheses would improve readability.
  2. Notation for the metric graph (vertices, edges, lengths) and the finite-element spaces is introduced without a dedicated preliminary section; a short notation table or paragraph would help readers track the constants appearing in the error estimates.
  3. The numerical examples are described as showing “robust performance,” but the manuscript does not report iteration counts or condition-number histories for the preconditioned systems; adding these quantitative indicators would strengthen the practical claim.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No specific major comments were listed in the report, so we have no points requiring point-by-point response at this stage.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper's central claims concern finite-element discretization of a PDE on a metric graph, derivation of rigorous a priori error bounds that remain valid under optimization with sparse Dirichlet controls, and an efficient preconditioning strategy. These rest on standard variational analysis and numerical linear algebra applied to the graph setting. No equations, fitted parameters, or self-citations are shown that reduce any claimed prediction or uniqueness result to the inputs by construction. The abstract and skeptic summary confirm the derivation is presented as independent mathematical analysis rather than a renaming or self-referential fit, making the result self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review yields no information on free parameters, axioms, or invented entities used in the work.

pith-pipeline@v0.9.0 · 5634 in / 926 out tokens · 31615 ms · 2026-05-24T20:04:15.536247+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

40 extracted references · 40 canonical work pages · 2 internal anchors

  1. [1]

    T. Apel, M. Mateos, J. Pfefferer, and A. Rösch , Error estimates for Dirichlet control problems in polygonal domains: quasi-uniform meshes, Mathematical Control and Related Fields, 8 (2018), pp. 217–245

    work page 2018

  2. [2]

    Arioli and M

    M. Arioli and M. Benzi , A finite element method for quantum graphs, IMA Journal of Nu- merical Analysis, 38 (2018), pp. 1119–1163

    work page 2018

  3. [3]

    Benzi, G

    M. Benzi, G. H. Golub, and J. Liesen , Numerical solution of saddle point problems, Acta Numerica, 14 (2005), pp. 1–137

    work page 2005

  4. [4]

    Berkolaiko and P

    G. Berkolaiko and P. Kuchment , Introduction to quantum graphs, vol. 186 of Mathematical Surveys and Monographs, American Mathematical Society, Providence, RI, 2013. OPTIMAL CONTROL OF PDES ON NETWORKS 19 NDOF 210000 421328 843980 β 10−1 45 45 61 10−2 39 31 42 10−3 39 29 41 10−4 39 29 41 Table 3: Iteration numbers of the Gmres-method for the solution of a...

    work page 2013

  5. [5]

    Casas and J.-P

    E. Casas and J.-P. Raymond , Error estimates for the numerical approximation of Dirichlet boundary control for semilinear elliptic equations, SIAM Journal on Control and Opti- mization, 45 (2006), pp. 1586–1611

    work page 2006

  6. [6]

    F. R. K. Chung , Spectral graph theory, vol. 92 of CBMS Regional Conference Series in Math- ematics, Amer. Math. Soc., Providence, RI, 1997

    work page 1997

  7. [7]

    I. S. Duff, A. M. Erisman, and J. K. Reid , Direct methods for sparse matrices, Monographs on Numerical Analysis, The Clarendon Press, Oxford University Press, New York, 1989. Corrected paperback edition of [ MR0892734], Oxford Science Publications

    work page 1989

  8. [8]

    H. C. Elman, D. J. Silvester, and A. J. W athen , Finite elements and fast iterative solvers: with applications in incompressible fluid dynamics, Numerical Mathematics and Scientific Computation, Oxford University Press, New York, 2005

    work page 2005

  9. [9]

    L. J. Grady and J. R. Polimeni , Discrete calculus, Springer-Verlag London, Ltd., London,

    work page

  10. [10]

    Applied analysis on graphs for computational science

    work page

  11. [11]

    Grundel, N

    S. Grundel, N. Hornung, and S. Roggendorf , Numerical aspects of model order reduc- tion for gas transportation networks, in Simulation-Driven Modeling and Optimization, Springer, 2016, pp. 1–28

    work page 2016

  12. [12]

    Herty, J

    M. Herty, J. Mohring, and V. Sachers , A new model for gas flow in pipe networks, Math- ematical Methods in the Applied Sciences, 33 (2010), pp. 845–855

    work page 2010

  13. [13]

    Herzog and E

    R. Herzog and E. Sachs , Preconditioned conjugate gradient method for optimal control prob- lems with control and state constraints, SIAM Journal on Matrix Analysis and Applica- tions, 31 (2010), pp. 2291–2317

    work page 2010

  14. [14]

    Hild and G

    J. Hild and G. Leugering , Real-time control of urban drainage systems, in Mathematical op- timization of water networks, vol. 162 of Internat. Ser. Numer. Math., Birkhäuser/Springer Basel AG, Basel, 2012, pp. 129–150

    work page 2012

  15. [15]

    Hinze, R

    M. Hinze, R. Pinnau, M. Ulbrich, and S. Ulbrich , Optimization with PDE Constraints, Mathematical Modelling: Theory and Applications, Springer-Verlag, New York, 2009

    work page 2009

  16. [16]

    Ito and K

    K. Ito and K. Kunisch,Lagrange multiplier approach to variational problems and applications, vol. 15 of Advances in Design and Control, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2008. 20 MARTIN STOLL AND MAX WINKLER

    work page 2008

  17. [17]

    Leugering, A

    G. Leugering, A. Martin, M. Schmidt, and M. Sirvent , Nonoverlapping domain decompo- sition for optimal control problems governed by semilinear models for gas flow in networks, Control and Cybernetics, 46 (2017), pp. 191–225

    work page 2017

  18. [18]

    Mardal and R

    K.-A. Mardal and R. Winther , Preconditioning discretizations of systems of partial differ- ential equations, Numerical Linear Algebra with Applications, 18 (2011), pp. 1–40

    work page 2011

  19. [19]

    S. May, R. Rannacher, and B. Vexler , Error analysis for a finite element approximation of elliptic Dirichlet boundary control problems, SIAM Journal on Control and Optimization, 51 (2013), pp. 2585–2611

    work page 2013

  20. [20]

    M. F. Murphy, G. H. Golub, and A. J. W athen , A note on preconditioning for indefinite linear systems, SIAM Journal on Scientific Computing, 21 (2000), pp. 1969–1972

    work page 2000

  21. [21]

    Nordenfelt, Spectral analysis of discrete approximations of quantum graphs, tech

    A. Nordenfelt, Spectral analysis of discrete approximations of quantum graphs, tech. rep., Lund University, Sweden, 2007

    work page 2007

  22. [22]

    G. Of, T. X. Phan, and O. Steinbach , An energy space finite element approach for elliptic Dirichlet boundary control problems, Numerische Mathematik, 129 (2015), pp. 723–748

    work page 2015

  23. [23]

    C. C. Paige and M. A. Saunders , Solutions of sparse indefinite systems of linear equations, SIAM Journal on Numerical Analysis, 12 (1975), pp. 617–629

    work page 1975

  24. [24]

    J. W. Pearson, M. Stoll, and A. J. W athen , Regularization-robust preconditioners for time- dependent PDE-constrained optimization problems, SIAM Journal on Matrix Analysis and Applications, 33 (2012), pp. 1126–1152

    work page 2012

  25. [25]

    J. W. Pearson and A. J. W athen , A new approximation of the Schur complement in precon- ditioners for PDE-constrained optimization, Numerical Linear Algebra with Applications, 19 (2012), pp. 816–829

    work page 2012

  26. [26]

    , Fast iterative solvers for convection-diffusion control problems, Electronic Transactions on Numerical Analysis, 40 (2013), pp. 294–310

    work page 2013

  27. [27]

    Pfefferer and M

    J. Pfefferer and M. Winkler , Finite element error estimates for normal derivatives on boundary concentrated meshes, SIAM Journal on Numerical Analysis, to appear (2019)

    work page 2019

  28. [28]

    T. Rees, H. S. Dollar, and A. J. W athen,Optimal solvers for PDE-constrained optimization, SIAM Journal on Scientific Computing, 32 (2010), pp. 271–298

    work page 2010

  29. [29]

    Rees and M

    T. Rees and M. Stoll , Block-triangular preconditioners for PDE-constrained optimization, Numerical Linear Algebra with Applications, 17 (2010), pp. 977–996

    work page 2010

  30. [30]

    Romano, M

    Y. Romano, M. Elad, and P. Milanfar , The little engine that could: regularization by denoising (RED), SIAM Journal on Imaging Sciences, 10 (2017), pp. 1804–1844

    work page 2017

  31. [31]

    Saad and M

    Y. Saad and M. H. Schultz , GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, Society for Industrial and Applied Mathematics. Journal on Scientific and Statistical Computing, 7 (1986), pp. 856–869

    work page 1986

  32. [32]

    Schöberl and W

    J. Schöberl and W. Zulehner , Symmetric indefinite preconditioners for saddle point prob- lems with applications to PDE-constrained optimization problems, SIAMJournalonMatrix Analysis and Applications, 29 (2007), pp. 752–773

    work page 2007

  33. [33]

    D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. V andergheynst , The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains, arXiv preprint arXiv:1211.0053, (2012)

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  34. [34]

    Spielman , Spectral graph theory, in Combinatorial scientific computing, Chapman & Hall/CRC Comput

    D. Spielman , Spectral graph theory, in Combinatorial scientific computing, Chapman & Hall/CRC Comput. Sci. Ser., CRC Press, Boca Raton, FL, 2012, pp. 495–524

    work page 2012

  35. [35]

    Stoll, One-shot solution of a time-dependent time-periodic PDE-constrained optimization problem, IMA Journal of Numerical Analysis, 34 (2014), pp

    M. Stoll, One-shot solution of a time-dependent time-periodic PDE-constrained optimization problem, IMA Journal of Numerical Analysis, 34 (2014), pp. 1554–1577

    work page 2014

  36. [36]

    Tröltzsch, Optimal control of partial differential equations: theory, methods, and applica- tions, vol

    F. Tröltzsch, Optimal control of partial differential equations: theory, methods, and applica- tions, vol. 112, American Mathematical Soc., 2010

    work page 2010

  37. [37]

    von Luxburg , A tutorial on spectral clustering, Statistics and Computing, 17 (2007), pp

    U. von Luxburg , A tutorial on spectral clustering, Statistics and Computing, 17 (2007), pp. 395–416

    work page 2007

  38. [38]

    Error estimates for variational normal derivatives and Dirichlet control problems with energy regularization

    M. Winkler, Error estimates for variational normal derivatives and Dirichlet control problems with energy regularization, 2018. arXiv-preprint 1808.01171

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  39. [39]

    W. A. M. Wybo, D. Boccalini, B. Torben-Nielsen, and M.-O. Gewaltig , A sparse refor- mulation of the Green’s function formalism allows efficient simulations of morphological neuron models, Neural Computation, 27 (2015), pp. 2587–2622

    work page 2015

  40. [40]

    Zlotnik, M

    A. Zlotnik, M. Chertkov, and S. Backhaus , Optimal control of transient flow in natural gas networks, in Decision and Control (CDC), 2015 IEEE 54th Annual Conference on, IEEE, 2015, pp. 4563–4570

    work page 2015