Finite element discretization, rigorous error bounds, and preconditioning are presented for optimizing PDE-constrained problems on metric graphs with sparse Dirichlet controls.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimization of a partial differential equation on a complex network
Finite element discretization, rigorous error bounds, and preconditioning are presented for optimizing PDE-constrained problems on metric graphs with sparse Dirichlet controls.