Sign inGet started
Paper · arXiv

Automatic Differentiation with Constraints in Forward and Inverse Problems

Approximate solutions of partial differential equations (PDEs) on unstructured grids can be represented on a graph. Numerical optimization involving stiff evolutionary and static PDEs often requires solving a large system of equations, which can be treated as a constraint. In this work, we present a fully differentiable graph-based implicit solver that incorporates this constraint. We evaluate its performance across four key tasks: a) linear and nonlinear forward modeling of evolutionary and static problems, b) solving inverse problems to estimate equation coefficients, c) solving inverse problems to estimate the right-hand side, and d) learnable graph coarsening to accelerate forward mod...

AuthorsNikolay Yavich, Alexander Ryabov, Viacheslav Naumov et al.
Primary categorycs.AI
Published20 October 2026
Last updated at source20 October 2026
cs.AImath.NA
Embed this entry
<iframe src="https://silytics.si/embed/item/5232d1f0-66c3-44c0-9ad3-f93832701892" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 21 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.