AutoPDE: Reliable Agentic PDE Solving via Explicitly Represented Solver Strategies

• URL: http://arxiv.org/abs/2606.10752v1
• Date: Tue, 09 Jun 2026 12:02:58 GMT
• Title: AutoPDE: Reliable Agentic PDE Solving via Explicitly Represented Solver Strategies
• Abstract summary: We propose AutoPDE, a code agent that maintains the solver strategy as an explicitly represented object throughout the solving process.<n>AutoPDE builds and maintains this object in three stages, all drawing from a library of reusable PDE-solving skills.<n>Experiments show that AutoPDE achieves a pass rate of $54.5%$, improving over the strongest baseline by $14.2$ percentage points.
• Score: 13.63605095777436
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Numerical solvers for partial differential equations (PDEs) are core computational tools in science and engineering. Building reliable PDE solvers requires not only executable code, but a numerical solver strategy, a set of decisions about discretization, stabilization, solver configuration, and resolution control, that matches the PDE structure. Recent LLM-based coding agents have begun to reduce the programming burden by generating and debugging solver implementations. However, they typically move directly from a PDE problem to solver code, leaving the solver strategy implicit in implementation details. Feedback from a failed solve is therefore routed back to code edits rather than to the underlying strategy, so numerical decisions remain hard to check before code is generated and hard to revise using numerical evidence when it fails. To address this limitation, we propose AutoPDE, a code agent that maintains the solver strategy as an explicitly represented object throughout the solving process: an independent, inspectable object that is built before any code is written and can be revised, using numerical evidence, whenever a solve fails. AutoPDE builds and maintains this object in three stages, all drawing from a library of reusable PDE-solving skills: PDE analysis identifies the equation type and algebraic structure; numerical method selection chooses a numerical method that matches the analysis result and commits to a discretization, stabilization, and linear solver accordingly; and adaptive tuning runs low-cost pilot solves to calibrate resolution and tolerances under the prescribed accuracy and runtime budget. We evaluate AutoPDE on the PDE Agent Bench, where experimental results show that AutoPDE achieves a pass rate of $54.5%$, improving over the strongest baseline by $14.2$ percentage points.

Related papers

• Improving Auto-Design of Neural PDE Solvers with a Domain-Specific Language [8.10360511033952]
  ADSL-PDE is a search-space representation for neural PDE solver auto-design.<n>It represents the functional decisions that determine a neural PDE solver.<n>A deterministic compiler maps each valid search state to an executable solver.
  arXiv  Detail & Related papers  (2026-08-05T02:41:23Z)
• PDEAgent-Bench: A Multi-Metric, Multi-Library Benchmark for PDE Solver Generation [31.813357785544408]
  We introduce PDEAgent-Bench, the first multi-metric, multi-library benchmark for PDE-to-solver code generation.<n>PDEAgent-Bench contains 645 instances across 6 mathematical categories and 11 PDE families, with common FEM libraries for DOLFINx, Firedrake, and deal.II.<n>Experiments show that models can often produce runnable code, but their pass rate drops substantially once accuracy and efficiency requirements are enforced.
  arXiv  Detail & Related papers  (2026-05-10T16:25:43Z)
• PDE-Agent: A toolchain-augmented multi-agent framework for PDE solving [50.54386756067269]
  Solving Partial Differential Equations (PDEs) is a cornerstone of engineering and scientific research.<n>Traditional methods for PDE solving are cumbersome, relying on manual setup and domain expertise.<n>In this work, we frame PDE solving as tool invocation via LLM-driven agents.<n>We introduce PDE-Agent, the first toolchain-augmented multi-agent collaboration framework.
  arXiv  Detail & Related papers  (2025-12-18T06:02:50Z)
• PDE-SHARP: PDE Solver Hybrids through Analysis and Refinement Passes [12.096472648029204]
  We introduce PDE-SHARP, a framework to reduce computational costs by replacing expensive scientific computation by cheaper LLM inference.<n>PDE-SHARP achieves superior solver accuracy with 60-75% fewer computational evaluations.<n>To generate high-quality solvers, PDE-SHARP requires fewer than 13 solver evaluations on average compared to 30+ for baseline methods.
  arXiv  Detail & Related papers  (2025-10-31T18:38:05Z)
• Lang-PINN: From Language to Physics-Informed Neural Networks via a Multi-Agent Framework [54.447408954009454]
  Physics-informed neural networks (PINNs) provide a powerful approach for solving partial differential equations (PDEs)<n>We present Lang-PINN, an LLM-driven multi-agent system that builds trainable PINNs directly from natural language task descriptions.<n>Experiments show that Lang-PINN achieves substantially lower errors and greater robustness than competitive baselines.
  arXiv  Detail & Related papers  (2025-10-03T08:20:02Z)
• CodePDE: An Inference Framework for LLM-driven PDE Solver Generation [57.15474515982337]
  Partial differential equations (PDEs) are fundamental to modeling physical systems.<n>Traditional numerical solvers rely on expert knowledge to implement and are computationally expensive.<n>We introduce CodePDE, the first inference framework for generating PDE solvers using large language models.
  arXiv  Detail & Related papers  (2025-05-13T17:58:08Z)
• Unisolver: PDE-Conditional Transformers Towards Universal Neural PDE Solvers [53.79279286773326]
  We present Unisolver, a novel Transformer model trained on diverse data and conditioned on diverse PDEs.<n>Unisolver achieves consistent state-of-the-art on three challenging large-scale benchmarks, showing impressive performance and generalizability.
  arXiv  Detail & Related papers  (2024-05-27T15:34:35Z)
• Deep Equilibrium Based Neural Operators for Steady-State PDEs [100.88355782126098]
  We study the benefits of weight-tied neural network architectures for steady-state PDEs. We propose FNO-DEQ, a deep equilibrium variant of the FNO architecture that directly solves for the solution of a steady-state PDE.
  arXiv  Detail & Related papers  (2023-11-30T22:34:57Z)
• Lie Point Symmetry Data Augmentation for Neural PDE Solvers [69.72427135610106]
  We present a method, which can partially alleviate this problem, by improving neural PDE solver sample complexity. In the context of PDEs, it turns out that we are able to quantitatively derive an exhaustive list of data transformations. We show how it can easily be deployed to improve neural PDE solver sample complexity by an order of magnitude.
  arXiv  Detail & Related papers  (2022-02-15T18:43:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.