arXiv (All)
open access
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Warp-Geo: Differentiable Geometry Representation for Dynamic-Boundary Simulation and Shape Optimization#1034936
- CuACD: A Fully GPU-Resident Approximate Convex Decomposition#1076387
- Planar-faced and high-Jacobian two-refinement hexahedral templates#1084655
- Numerical Design of Optimized First-Order Algorithms#635621
- Numerical Design of Optimized First-Order Algorithms#633272
Record · ID 1413777
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive