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.
Related
- Retrainable physics-integrated neural differentiable modeling of sintering across material systems
- Fully differentiable framework for inverse identification of geometry and material parameters with application to determining stress-free configuration of soft tissues
- A Differentiable Ray-Wave Framework for Hybrid Refractive-Diffractive System Modeling and Optimization
- A Differentiable Framework for Inverse Identification of Heterogeneous Cohesive Laws
- A differentiable PCA-GPR surrogate framework for full-transient Bayesian inverse uncertainty quantification of black-box nuclear thermal-hydraulic systems
BibTeX
@misc{bogaarts2026managing,
title = {{Managing complexity for integrated fusion reactor design using a differentiable graph-based MDAO framework: PROCESS as a case study}},
author = {Timo J. Bogaarts and Willem Rutten and Felix Warmer},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.22687},
eprint = {2610.22687},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.22687},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Managing complexity for integrated fusion reactor design using a differentiable graph-based MDAO framework: PROCESS as a case study
AU - Timo J. Bogaarts
AU - Willem Rutten
AU - Felix Warmer
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2610.22687
UR - https://arxiv.org/abs/2610.22687
AB - 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.
ER -