vix.ing · top · new · best · stats · spec

Optimization of a partial differential equation on a complex network

2019/07/17 by Martin Stoll, Stoll, Martin, Max Winkler +1
Computer Science · Mathematics · Physics and Astronomy · #35R02 #49J20 #65F08 #65N30 #Electromagnetic Scattering and Analysis #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical methods for differential equations #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.1907.07806

openalex publication_date 2019/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

Related