Adjoint methods for obstacle problems and weakly coupled systems of PDE
Filippo Cagnetti, Diogo Gomes, and Hung Tran

TL;DR
This paper applies the adjoint method to obstacle problems and weakly coupled PDE systems, providing new insights into convergence rates of approximation methods.
Contribution
It extends the adjoint method to obstacle problems and coupled systems, offering novel convergence results for approximation procedures.
Findings
Derived new convergence speed results for approximation methods.
Applied the adjoint method to obstacle and coupled PDE systems.
Enhanced understanding of solution behaviors in complex PDE systems.
Abstract
The adjoint method, recently introduced by Evans, is used to study obstacle problems, weakly coupled systems, cell problems for weakly coupled systems of Hamilton-Jacobi equations, and weakly coupled systems of obstacle type. In particular, new results about the speed of convergence of common approximation procedures are derived.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods for differential equations · Quantum chaos and dynamical systems · Advanced Numerical Methods in Computational Mathematics
