Optimal Dirichlet control of partial differential equations on networks

From MaRDI portal
Publication:822679

DOI10.1553/ETNA_VOL54S392zbMATH Open1473.49002arXiv1907.07806OpenAlexW3170313257WikidataQ115235359 ScholiaQ115235359MaRDI QIDQ822679FDOQ822679


Authors: Martin Stoll, Max Winkler Edit this on Wikidata


Publication date: 23 September 2021

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1907.07806

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (3)





This page was built for publication: Optimal Dirichlet control of partial differential equations on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q822679)