Searcharxiv⌕ Search

arXiv · 2610.22687

Managing complexity for integrated fusion reactor design using a differentiable graph-based MDAO framework: PROCESS as a case study

Abstract

Integrated design of nuclear fusion reactors requires combining an increasingly large number of models from different disciplines self-consistently, with model selection and parametrisation changing between design studies. Manual definition of execution order and solvers for cyclic dependencies is error-prone, inefficient, and inflexible. We propose to use a generic graph-based coordination and execution core that enables automated execution order, cycle detection, and solver architecture specification for any set of models or parametrisation. To this end, a computational dependency graph of purely functional models is extended by a conditional node and nesting edges, treating solvers and optimisers in the same way. A minimal set of graph operations then allows for fine-tuned control on feedback resolution, making both optimiser and solver architectures easily reconfigurable. Existing monolithic multidisciplinary design analysis and optimisation (MDAO) architectures can be recovered by sequentially applying these operations. The cottax package implements this extended dependency graph, graph operations, executability checks, and a JAX-based execution layer. This execution layer eliminates runtime overhead and provides native gradient computation through the whole graph. As a proof of principle, cottax is then applied to the PROCESS systems code. Graph sequencing shows that for PROCESS only three small coupled components need to be solved every optimiser iteration. Monolithic MDAO architectures are then assigned to seven different PROCESS configurations, demonstrating the ease of (re)configuring its architecture. Compared to PROCESS, the sequencing and execution back-end together yield a two to three orders of magnitude reduction in model runtime during optimisation. cottax is currently being considered as the basis for developing an integrated stellarator MDAO framework.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timo J. Bogaarts, Willem Rutten, Felix Warmer. 2026-10-15. Managing complexity for integrated fusion reactor design using a differentiable graph-based MDAO framework: PROCESS as a case study. https://arxiv.org/abs/2610.22687

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Complex Hyperspin Machine and Symmetry Quenching: Benchmark and scaling up to millions of degrees of freedom

Driven-dissipative oscillator networks have been proposed to simulate spin models on physical hardware, mostly focusing on systems of binary (Ising) spins, or systems of spin vectors in low dimensions. The equalized hyperspin machine was recently introduced to provide a single platform to simulate general models of $N$ coupled spin vectors with tunable dimension $D$, realizing dynamical annealing protocols to vary the spin dimensionality in time. These schemes are limited to real spins coupled via real coupling matrices. We propose a generalization of the hyperspin machine that works with complex fields and deals with complex Hermitian coupling matrices, implementing an amplitude equalization scheme. This system, which we name complex hyperspin machine, can work on optimization problems with complex valued hyperspins that can be cast on complex $D$-vector Hamiltonians. We benchmark the machine against a differential evolution (DE) algorithm on complex $D=2$ hyperspins up to $N=80$, showing that the fraction of instances where a lower-energy solution is found grows with system size and coupling density, reaching $92.5\%$ at the largest considered sizes. When the DE finds a lower-energy solution, the machine still reaches a median relative energy deviation that lies between $10^{-15}$ and $10^{-12}$ while running at substantially lower computational cost. Using the complex nature of the field, we introduce a new dimensional reduction protocol that we name symmetry quenching, which collapses complex variables that map to XY spins onto real Ising spins by switching on the parametric pump. We show on Max-Cut instances with known ground states that symmetry quenching outperforms a fixed-pump Ising machine, reaching exact ground states in the presence of equalization. We scale the system to $N=10^6$ hyperspins, or $8\times10^6$ dynamical variables, on a Hermitian sparse two-dimensional lattice.

physics.comp-ph↗

Learning Stiff Dynamical Operators: Scaling, Fast-Slow Excitation, and Eigen-Consistent Neural Models

Stiff dynamical systems represent a central challenge in multi scale modeling across combustion, chemical kinetics, and nonlinear dynamical systems. Neural operator learning has recently emerged as a promising approach to approximate dynamical generators from data, yet stiffness imposes severe obstacles: training errors concentrate on slow manifold states, collapse of fast dynamics occurs, and the learned operator may fail to reproduce the true eigenstructure. We demonstrate three key advances enabling accurate learning of stiff operators and preserving spectral fidelity: (i) stiffness aware scaling of time derivatives, (ii) fast direction excitation via local trajectory cloud bursts, and (iii) autograd-based Jacobian diagnostics ensuring eigenstructure fidelity. Applied to the Davis-Skodje system, the approach recovers both slow and fast modes across stiffness regimes, reducing fast eigenvalue error by an order of magnitude while improving rollout fidelity. These results argue that spectral fidelity - not trajectory accuracy alone - should be a first-class target in data driven learning of stiff operators.

physics.comp-ph↗

Generative marginal learning for finite-size molecular simulation with application to stress calculation

We propose generative marginal learning (GML), a framework for equilibrium sampling and local observable estimation in molecular simulations. By training a conditional diffusion model on large-system simulations, GML learns the marginal distribution of a retained region, enabling configuration generation without explicitly simulating the surrounding environment or imposing periodic boundary conditions on the retained region. We derive a marginal effective potential and the associated conditional mean-force identity, which provide the basis for both denoising and force-alignment training. As an application, we estimate the spatially averaged Irving--Kirkwood stress near a vacancy defect. Numerical tests on a two-dimensional Lennard--Jones crystal and three-dimensional BCC Fe under combined tension and shear demonstrate improved local stress accuracy relative to small periodic molecular dynamics simulations.

physics.comp-ph↗