arXiv subjects

Alan A. Kaptanoglu

Publications and source records attributed to Alan A. Kaptanoglu.

At least 19 recordsLinked to original sources

arXiv2026

Towards joint optimization of stellarator coils and support structures

The support structure is an integral part of the design of nuclear fusion reactors, especially 3D stellarator devices. A practical reactor's coils and support structures must have three competing qualities: an accurate magnetic field for good confinement, sufficient rigidity to protect the brittle high-temperature superconductor (HTS) from damage, and a simple geometry for low-cost construction. In existing devices, the coil geometry is often optimized without knowledge of the support structures' design and the coils' true stress and deformation. The support structures are then placed by hand through repeated finite element analyses (FEA) until engineering requirements are met. This makes the structural design of stellarator coil systems lengthy and labor-intensive. Using new developments in differentiable structural mechanics, we present coil-fem, an open-source software tool that integrates support differentiable FEA into the stellarator coil optimization loop. It enables the integrated optimization of coil geometry and support clamp locations to simultaneously reduce magnetic field errors and stresses in the coil body. We also present the first combined coil-support optimization in the stellarator literature. Using a penalty term based on coil-fem, we produced a coil set with 2.4x lower RMS von Mises stress and similar field error compared to an unoptimized baseline.

physics.plasm-ph↗

arXiv2026

A proof-of-concept for automated AI-driven stellarator coil optimization with in-the-loop finite-element calculations

Finding feasible coils for stellarator fusion devices is a critical challenge of realizing this concept for future power plants. Years of research work can be put into the design of even a single reactor-scale stellarator design. To rapidly speed up and automate the workflow of designing stellarator coils, we have designed an end-to-end ``runner'' for performing stellarator coil optimization. The entirety of pre and post-processing steps have been automated; the user specifies only a few basic input parameters, and final coil solutions are updated on an open-source leaderboard. Two policies are available for performing non-stop automated coil optimizations through a genetic algorithm or a context-aware LLM. Lastly, we construct a novel in-the-loop optimization of Von Mises stresses in the coils, opening up important future capabilities for in-the-loop finite-element calculations.

physics.plasm-ph↗

arXiv2025

Permanent magnet optimization of stellarators with coupling from finite permeability and demagnetization effects

Permanent magnets provide an attractive path for shaping university-scale stellarator magnetic fields. Previous work has shown that greedy permanent magnet optimization (GPMO) can produce sparse, grid-aligned arrays that match target surfaces with high accuracy under an ideal rigid-remanence model. Here we extend this approach to a greedy permanent magnet optimization with macromagnetic refinement (GPMOmr) by introducing a block-level macromagnetic model that accounts for magnet-magnet and magnet-coil coupling from finite permeability and demagnetizing interactions, and apply it to the published magnet grid from the MUSE stellarator design. Finite-permeability effects produce degree-scale tilts and few-percent magnitude changes in individual magnets and modify the surface-normal field $\mathbf B\cdot\mathbf n$ only at the percent level, yet for a fixed layout they increase the standard squared-flux objective by more than a factor of two. When the same model is embedded in the greedy loop, GPMOmr achieves $f_B$ histories and final errors within a few percent of classical GPMO while producing visibly more nonuniform magnetization patterns. Our formulation provides a fast and practical tool for quantifying and incorporating finite-permeability effects in permanent-magnet stellarator designs, and offers a framework for extending permanent-magnet optimization to higher field strengths and to materials with stronger macromagnetic coupling.

physics.plasm-ph↗

arXiv2025

MRX: A differentiable 3D MHD equilibrium solver without nested flux surfaces

This article introduces a new 3D magnetohydrodynamic (MHD) equilibrium solver, based on the concept of admissible variations of B, p that allows for magnetic relaxation of a magnetic field in a perturbed/non-minimum energy state to a lower energy state. We describe the mathematical theory behind this method, including ensuring certain bounds on the magnetic energy, and the differential geometry behind transforming to and from a logical domain and physical domain. Our code is designed to address a number of traditional challenges to 3D MHD equilibrium solvers, e.g. exactly enforcing physical constraints such as divergence-free magnetic field, exhibiting high levels of numerical convergence, dealing with complex geometries, and modeling stochastic field lines or chaotic behavior. By using differentiable Python, our numerical method comes with the additional benefits of computational efficiency on modern computing architectures, high code accessibility, and differentiability at each step. The proposed magnetic relaxation solver is robustly benchmarked and tested with standard examples, including solving 2D toroidal equilibria at high-beta, and a rotating ellipse stellarator. Future work will address the integration of this code for 3D equilibrium optimization for modeling magnetic islands and chaos in stellarator fusion devices.

physics.comp-ph↗

arXiv2025

Efficient Computation of Stellarator Coils with an Augmented Lagrangian Optimization Method

Finding feasible coils for stellarator fusion devices is a critical challenge of realizing this concept for future power plants. Current design efforts struggle to navigate the highly nonconvex optimization landscape, spend considerable resources scanning the parameter space, and may produce suboptimal coils. In this work, we present an augmented Lagrangian approach to tackle the ill-posed problem of coil optimization. We illustrate its effectiveness and versatility by generating coils for five stellarators with very different symmetries and magnetic field shaping. In all cases, we find Pareto-optimal coil solutions that in various ways outperform published coil sets.

physics.plasm-ph↗

arXiv2025

Optimization of passive superconductors for shaping stellarator magnetic fields

We consider the novel problem of optimizing a large set of passive superconducting coils (PSCs) with currents induced by a background magnetic field rather than power supplies. In the nuclear fusion literature, such coils have been proposed to partially produce the 3D magnetic fields for stellarators and provide passive stabilization. We perform the first optimizations of PSC arrays with respect to the orientation, shape, and location of each coil, jointly minimized with the background fields. We conclude by generating passive coil array solutions for four stellarators.

physics.plasm-ph↗

arXiv2025

Data-driven methods to discover stable linear models of the helicity injectors on HIT-SIU

Accurate and efficient circuit models are necessary to control the power electronic circuits found on plasma physics experiments. Tuning and controlling the behavior of these circuits is inextricably linked to plasma performance. Linear models are greatly preferred for control applications due to their well-established performance guarantees, but they typically fail to capture nonlinear dynamics and changes in experimental parameters. Data-driven system identification can help mitigate these shortcomings by learning interpretable and accurate reduced-order models of a complex system, in this case the injector circuits of the Helicity Injected Torus - Steady Inductive Upgrade (HIT-SIU) experiment. Specifically, the Bagging Optimized Dynamic Mode Decomposition (BOP-DMD), is leveraged to learn stable, reduced order models of the interaction between the spheromak plasma formed in the confinement volume, and the injector circuits of the device. BOP-DMD is trained and evaluated on an analytic model of the vacuum dynamics of the injector circuits of HIT-SIU, as well as an analytic linear reduced-order model for the injector dynamics when a plasma is present. BOP-DMD is then fit on experimental data, both on shots with and without a plasma in the confinement volume. In doing so, we demonstrate the capability of data-driven methods to produce stable, linear models for control and uncertainty quantification in plasma experiments.

physics.plasm-ph↗

arXiv2024

Reactor-scale stellarators with force and torque minimized dipole coils

In this work, we utilize new coil objectives for stellarator optimization with autodifferentiation, including pointwise and net coil-coil forces and torques. We use these methods to perform the first large-scale optimization of planar dipole coil arrays, since arrays of small and geometrically simple coils have been proposed to partially produce the 3D magnetic fields for stellarators, generate advantageous magnetic field perturbations in tokamaks, and provide active, real-time control capabilities. We perform an ablation study to show that minimizing the orientation and location of each coil may be essential to get coil forces, coil torques, and field errors to tolerable levels. We conclude with solutions for three reactor-scale quasi-symmetric stellarators by jointly optimizing nonplanar TF coils and planar coil arrays.

physics.plasm-ph↗

arXiv2024

Global Stellarator Coil Optimization with Quadratic Constraints and Objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvement in conditioning, regularization , sparsity and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a fast, global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10^2\times$ faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL's effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

physics.plasm-ph↗

arXiv2023

Nonlinear parametric models of viscoelastic fluid flows

Reduced-order models have been widely adopted in fluid mechanics, particularly in the context of Newtonian fluid flows. These models offer the ability to predict complex dynamics, such as instabilities and oscillations, at a considerably reduced computational cost. In contrast, the reduced-order modeling of non-Newtonian viscoelastic fluid flows remains relatively unexplored. This work leverages the sparse identification of nonlinear dynamics algorithm to develop interpretable reduced-order models for viscoelastic flows. In particular, we explore a benchmark oscillatory viscoelastic flow on the four-roll mill geometry using the classical Oldroyd-B fluid. This flow exemplifies many canonical challenges associated with non-Newtonian flows, including transitions, asymmetries, instabilities, and bifurcations arising from the interplay of viscous and elastic forces, all of which require expensive computations in order to resolve the fast timescales and long transients characteristic of such flows. First, we demonstrate the effectiveness of our data-driven surrogate model to predict the transient evolution and accurately reconstruct the spatial flow field for fixed flow parameters. We then develop a fully parametric, nonlinear model capable of capturing the dynamic variations as a function of the Weissenberg number. While the training data is predominantly concentrated on a limit cycle regime for moderate Wi, we show that the parameterized model can be used to extrapolate, accurately predicting the dominant dynamics in the case of high Weissenberg numbers. The proposed methodology represents an initial step in the field of reduced-order modeling for viscoelastic flows with the potential to be further refined and enhanced for the design, optimization, and control of a wide range of non-Newtonian fluid flows using machine learning and reduced-order modeling techniques.

physics.flu-dyn↗

arXiv2023

Grad-Shafranov equilibria via data-free physics informed neural networks

A large number of magnetohydrodynamic (MHD) equilibrium calculations are often required for uncertainty quantification, optimization, and real-time diagnostic information, making MHD equilibrium codes vital to the field of plasma physics. In this paper, we explore a method for solving the Grad-Shafranov equation by using Physics-Informed Neural Networks (PINNs). For PINNs, we optimize neural networks by directly minimizing the residual of the PDE as a loss function. We show that PINNs can accurately and effectively solve the Grad-Shafranov equation with several different boundary conditions. We also explore the parameter space by varying the size of the model, the learning rate, and boundary conditions to map various trade-offs such as between reconstruction error and computational speed. Additionally, we introduce a parameterized PINN framework, expanding the input space to include variables such as pressure, aspect ratio, elongation, and triangularity in order to handle a broader range of plasma scenarios within a single network. Parametrized PINNs could be used in future work to solve inverse problems such as shape optimization.

physics.plasm-ph↗

arXiv2023

Topology optimization for inverse magnetostatics as sparse regression: application to electromagnetic coils for stellarators

Topology optimization, a technique to determine where material should be placed within a predefined volume in order to minimize a physical objective, is used across a wide range of scientific fields and applications. A general application for topology optimization is inverse magnetostatics; a desired magnetic field is prescribed, and a distribution of steady currents is computed to produce that target field. In the present work, electromagnetic coils are designed by magnetostatic topology optimization, using volume elements (voxels) of electric current, constrained so the current is divergence-free. Compared to standard electromagnet shape optimization, our method has the advantage that the nonlinearity in the Biot-Savart law with respect to position is avoided, enabling convex cost functions and a useful reformulation of topology optimization as sparse regression. To demonstrate, we consider the application of designing electromagnetic coils for a class of plasma experiments known as stellarators. We produce topologically-exotic coils for several new stellarator designs and show that these solutions can be interpolated into a filamentary representation and then further optimized.

physics.plasm-ph↗

arXiv2023

Benchmarking sparse system identification with low-dimensional chaos

Sparse system identification is the data-driven process of obtaining parsimonious differential equations that describe the evolution of a dynamical system, balancing model complexity and accuracy. There has been rapid innovation in system identification across scientific domains, but there remains a gap in the literature for large-scale methodological comparisons that are evaluated on a variety of dynamical systems. In this work, we systematically benchmark sparse regression variants by utilizing the dysts standardized database of chaotic systems. In particular, we demonstrate how this open-source tool can be used to quantitatively compare different methods of system identification. To illustrate how this benchmark can be utilized, we perform a large comparison of four algorithms for solving the sparse identification of nonlinear dynamics (SINDy) optimization problem, finding strong performance of the original algorithm and a recent mixed-integer discrete algorithm. In all cases, we used ensembling to improve the noise robustness of SINDy and provide statistical comparisons. In addition, we show very compelling evidence that the weak SINDy formulation provides significant improvements over the traditional method, even on clean data. Lastly, we investigate how Pareto-optimal models generated from SINDy algorithms depend on the properties of the equations, finding that the performance shows no significant dependence on a set of dynamical properties that quantify the amount of chaos, scale separation, degree of nonlinearity, and the syntactic complexity.

cs.LG↗

arXiv2022

Greedy permanent magnet optimization

A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression. However, binary, grid-aligned solutions are desired for realistic engineering designs. We now show that the binary permanent magnet problem can be formulated as a quadratic program with quadratic equality constraints (QPQC), the binary, grid-aligned problem is equivalent to the quadratic knapsack problem with multiple knapsack constraints (MdQKP), and the single-orientation-only problem is equivalent to the unconstrained quadratic binary problem (BQP). We then provide a set of simple greedy algorithms for solving variants of permanent magnet optimization, and demonstrate their capabilities by designing magnets for stellarator plasmas. The algorithms can a-priori produce sparse, grid-aligned, binary solutions. Despite its simple design and greedy nature, we provide an algorithm that outperforms the state-of-the-art algorithms while being substantially faster, more flexible, and easier-to-use.

physics.plasm-ph↗

arXiv2022

Permanent magnet optimization for stellarators as sparse regression

A common scientific inverse problem is the placement of magnets that produce a desired magnetic field inside a prescribed volume. This is a key component of stellarator design, and recently permanent magnets have been proposed as a potentially useful tool for magnetic field shaping. Here, we take a closer look at possible objective functions for permanent magnet optimization, reformulate the problem as sparse regression, and propose an algorithm that can efficiently solve many convex and nonconvex variants. The algorithm generates sparse solutions that are independent of the initial guess, explicitly enforces maximum strengths for the permanent magnets, and accurately produces the desired magnetic field. The algorithm is flexible, and our implementation is open-source and computationally fast. We conclude with two new permanent magnet configurations for the NCSX and MUSE stellarators. Our methodology can be additionally applied for effectively solving permanent magnet optimizations in other scientific fields, as well as for solving quite general high-dimensional, constrained, sparse regression problems, even if a binary solution is required.

physics.plasm-ph↗

arXiv2022

PySINDy: A comprehensive Python package for robust sparse system identification

Automated data-driven modeling, the process of directly discovering the governing equations of a system from data, is increasingly being used across the scientific community. PySINDy is a Python package that provides tools for applying the sparse identification of nonlinear dynamics (SINDy) approach to data-driven model discovery. In this major update to PySINDy, we implement several advanced features that enable the discovery of more general differential equations from noisy and limited data. The library of candidate terms is extended for the identification of actuated systems, partial differential equations (PDEs), and implicit differential equations. Robust formulations, including the integral form of SINDy and ensembling techniques, are also implemented to improve performance for real-world data. Finally, we provide a range of new optimization algorithms, including several sparse regression techniques and algorithms to enforce and promote inequality constraints and stability. Together, these updates enable entirely new SINDy model discovery capabilities that have not been reported in the literature, such as constrained PDE identification and ensembling with different sparse regression optimizers.

eess.SY↗

arXiv2021

Physics-constrained, low-dimensional models for MHD: First-principles and data-driven approaches

Plasmas are highly nonlinear and multi-scale, motivating a hierarchy of models to understand and describe their behavior. However, there is a scarcity of plasma models of lower fidelity than magnetohydrodynamics (MHD), although these reduced models hold promise for understanding key physical mechanisms, efficient computation, and real-time optimization and control. Galerkin models, obtained by projection of the MHD equations onto a truncated modal basis, and data-driven models, obtained by modern machine learning and system identification, can furnish this gap in the lower levels of the model hierarchy. This work develops a reduced-order modeling framework for compressible plasmas, leveraging decades of progress in projection-based and data-driven modeling of fluids. We begin by formalizing projection-based model reduction for nonlinear MHD systems. To avoid separate modal decompositions for the magnetic, velocity, and pressure fields, we introduce an energy inner product to synthesize all of the fields into a dimensionally-consistent, reduced-order basis. Next, we obtain an analytic model by Galerkin projection of the Hall-MHD equations onto these modes. We illustrate how global conservation laws constrain the model parameters, revealing symmetries that can be enforced in data-driven models, directly connecting these models to the underlying physics. We demonstrate the effectiveness of this approach on data from high-fidelity numerical simulations of a 3D spheromak experiment. This manuscript builds a bridge to the extensive Galerkin literature in fluid mechanics, and facilitates future principled development of projection-based and data-driven models for plasmas.

physics.comp-ph↗

arXiv2021

Promoting global stability in data-driven models of quadratic nonlinear dynamics

Modeling realistic fluid and plasma flows is computationally intensive, motivating the use of reduced-order models for a variety of scientific and engineering tasks. However, it is challenging to characterize, much less guarantee, the global stability (i.e., long-time boundedness) of these models. The seminal work of Schlegel and Noack (JFM, 2015) provided a theorem outlining necessary and sufficient conditions to ensure global stability in systems with energy-preserving, quadratic nonlinearities, with the goal of evaluating the stability of projection-based models. In this work, we incorporate this theorem into modern data-driven models obtained via machine learning. First, we propose that this theorem should be a standard diagnostic for the stability of projection-based and data-driven models, examining the conditions under which it holds. Second, we illustrate how to modify the objective function in machine learning algorithms to promote globally stable models, with implications for the modeling of fluid and plasma flows. Specifically, we introduce a modified "trapping SINDy" algorithm based on the sparse identification of nonlinear dynamics (SINDy) method. This method enables the identification of models that, by construction, only produce bounded trajectories. The effectiveness and accuracy of this approach are demonstrated on a broad set of examples of varying model complexity and physical origin, including the vortex shedding in the wake of a circular cylinder.

physics.flu-dyn↗