Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton Method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Orbit-averaging and deposition accuracy for runaway electron beams in hybrid kinetic-MHD simulations of the runaway plateau

We develop a new procedure that combines the kinetic orbit runaway electron code (KORC) and the NIMROD extended-magnetohydrodynamic code to simulate runaway electrons (REs) in the post-disruption plateau. KORC integrates guiding-center orbits, with a barycentric-based binary search strategy providing initial guesses for the Newton–Raphson logical-to-physical coordinate inversion, ensuring reliable particle-to-mesh mapping in NIMROD, whose fields remain static for the present study. Samples are drawn in accord with experimental parallel current profiles of RE beams during the plateau phase. Deposition in NIMROD is verified through comparison with a Python-based finite-element code that ensures periodicity in the poloidal direction and continuity at the magnetic axis. Accurate representation of near-axis fields requires finer mesh resolution to prevent under- and overshoots in current density from orbit inaccuracies. Yet, at a fixed particle count, increasing mesh resolution amplifies statistical noise in the deposited fields. An orbit-averaging method accumulates partial current deposits over multiple kinetic steps and reduces the statistical noise with little added computational cost. By coupling kinetic routines from KORC directly into the NIMROD codebase, these developments lay essential groundwork for future self-consistent KORC–NIMROD coupling.

Algorithms and data structure↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2025

FedOSAA: Improving Federated Learning with One-Step Anderson Acceleration

Federated learning (FL) is a distributed machine learning approach that enables multiple local clients and a central server to collaboratively train a model while keeping the data on their own devices. First-order methods, particularly those incorporating variance reduction techniques, are the most widely used FL algorithms due to their simple implementation and stable performance. However, these methods tend to be slow and require a large number of communication rounds to reach the global minimizer. We propose FedOSAA, a novel approach that preserves the simplicity of first-order methods while achieving the rapid convergence typically associated with second-order methods. Our approach applies one Anderson acceleration (AA) step following classical local updates based on first-order methods with variance reduction, such as FedSVRG and SCAFFOLD, during local training. This AA step is able to leverage curvature information from the history points and gives a new update that approximates the Newton-GMRES direction, thereby significantly improving the convergence. We establish a local linear convergence rate to the global minimizer of FedOSAA for smooth and strongly convex loss functions. Numerical comparisons show that FedOSAA substantially improves the communication and computation efficiency of the original first-order methods, achieving performance comparable to second-order methods like GIANT.

Feng, Xue [University of California, Davis]↗
DOE OSTI2024

Accelerating the design of lattice structures using machine learning

Lattices remain an attractive class of structures due to their design versatility; however, rapidly designing lattice structures with tailored or optimal mechanical properties remains a significant challenge. With each added design variable, the design space quickly becomes intractable. To address this challenge, research efforts have sought to combine computational approaches with machine learning (ML)-based approaches to reduce the computational cost of the design process and accelerate mechanical design. While these efforts have made substantial progress, significant challenges remain in (1) building and interpreting the ML-based surrogate models and (2) iteratively and efficiently curating training datasets for optimization tasks. Here, we address the first challenge by combining ML-based surrogate modeling and Shapley additive explanation (SHAP) analysis to interpret the impact of each design variable. We find that our ML-based surrogate models achieve excellent prediction capabilities (R 2 > 0.95) and SHAP values aid in uncovering design variables influencing performance. We address the second challenge by utilizing active learning-based methods, such as Bayesian optimization, to explore the design space and report a 5 × reduction in simulations relative to grid-based search. Collectively, these results underscore the value of building intelligent design systems that leverage ML-based methods for uncovering key design variables and accelerating design.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part I: Model Formulation

Here, this paper formulates a new particle-in-cell method for the Vlasov–Maxwell system. Under the Lorenz gauge condition, Maxwell’s equations for the electromagnetic fields can be written as a collection of scalar and vector wave equations. The use of potentials for the fields motivates the adoption of a Hamiltonian formulation for particles that employs the generalized (conjugate) momentum. A notable advantage offered by the Hamiltonian formulation is the elimination of time derivatives in the Lorenz gauge formulation that are required by the standard Newton–Lorentz treatment of the particles. This allows the fields to retain the full time-accuracy guaranteed by the field solver. The resulting updates for particles require only knowledge of the fields and their spatial derivatives. An analytical method for constructing these spatial derivatives is presented that exploits the underlying integral solution used in the field solver for the wave equations. Moreover, these derivatives are demonstrated to converge at the same rate as the fields in both time and space. The Method of Lines Transpose field solver we consider in this work is globally first-order accurate in time and high-order accurate in space (e.g., fourth- and fifth-order) and belongs to a larger class of methods which are unconditionally stable, can address geometry, and leverage $\mathcal {O}(N)$ fast summation methods for efficiency. We demonstrate the method on several well-established benchmark problems on bounded domains, including a plasma sheath as well as a relativistic particle beam. The efficacy of the proposed formulation is established by comparing with a second-order accurate finite-difference time-domain method that employs a leapfrog time advance for particles and a charge conserving map suitable for bounded domains. The new method shows mesh-independent numerical heating properties even in cases where the plasma Debye length is smaller than the grid spacing. This is an important feature of the new method for problems defined on bounded domains, because it permits the use of coarser grids in space in the representation of the fields. Such a capability has significant implications for the simulation of plasmas in bounded domains with complex geometry, where the ratio between the largest and smallest cells can vary significantly. The use of high-order spatial approximations in the new method also means that fewer grid points are required in order to achieve a fixed accuracy. Our results also suggest that the new method can be used with fewer simulation particles per cell compared to the benchmark explicit method, which permits further computational savings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A multi-mass and multi-hit two-camera 3D ion momentum imaging system

We demonstrate an improved two-camera system for multi-mass and multi-hit three-dimensional (3D) momentum imaging of ions. The imaging system employs two conventional complementary metal–oxide–semiconductor cameras. We have shown previously that the system can time slice ion Newton spheres with a time resolution of 8.8 ns, limited by camera timing jitter [J. Chem. Phys., 158, 191104 (2023)]. In this work, a jitter correction method was developed to suppress the camera jitter and improve the time resolution to better than 2 ns. With this resolution, full 3D momentum distributions of ions can be obtained. We further show that this method can detect two ions with different masses when utilizing both the rising and falling edges of the cameras.

Instruments & Instrumentation↗
DOE OSTI2024

Scalable Multiphysics Block Preconditioning for Low Mach Number Compressible Resistive MHD with Application to Magnetic Confinement Fusion

This study investigates multiphysics block preconditioners that are critical in devising scalable Newton–Krylov iterative solvers for longer time-scale fully implicit fluid plasma models. The specific model of interest is the visco-resistive, low Mach number, compressible magnetohydrodynamics (MHD) model. This model describes the dynamics of conducting fluids in the presence of electromagnetic fields and can be used to study aspects of astrophysical phenomena, important science and technology applications, and basic plasma physics. The specific application of interest that motivates this study is the macroscopic simulation of longer time-scale stability and disruptions of magnetic confinement fusion devices, specifically the ITER Tokamak. The computational solution of the governing balance equations for mass, momentum, heat transfer, and magnetic induction for resistive MHD systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena as well as the significant range of time and length scales that the interactions of these physical mechanisms produce. To handle the range of time and spatial scales of interest, a fully implicit unstructured variational multiscale finite element formulation is employed. For the scalable solution of the Newton linearized systems, fully coupled block preconditioners are designed to leverage algebraic multigrid subsolves. In conclusion, results are presented for the strong and weak scaling of the method as well as the robustness of these techniques for a large range of Lundquist numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Delving into the depths of NGC 3783 with XRISM II. Cross-calibration of X-ray instruments used in the large, multi-mission observational campaign

Context. Accurate X-ray spectroscopic measurements are fundamental for deriving basic physical parameters of the most abundant baryon components in the Universe. The plethora of X-ray observatories currently operational enables a panchromatic view of the high-energy emission of celestial sources. However, uncertainties in the energy-dependent calibration of the instrument transfer functions (e.g. the effective area, energy redistribution, or gain) can limit - and historically, did limit - the accuracy of X-ray spectroscopic measurements. Aims. We revised the status of the cross-calibration among the scientific payload on board four operation missions: Chandra, NuSTAR, XMM-Newton, and the recently launched XRISM. XRISM carries the micro-calorimeter Resolve, which yields the best energy resolution at energies ≥2 keV. For this purpose, we used the data from a 10-day-long observational campaign targeting the nearby active galactic nucleus NGC 3783, carried out in July 2024. Methods. We present a novel model-independent method for assessing the cross-calibration status that is based on a multi-node spline of the spectra with the highest-resolving power (XRISM/Resolve in our campaign). We also estimated the impact of the intrinsic variability of NGC 3783 on the cross-calibration status due to the different time coverages of participating observatories and performed an empirical reassessment of the Resolve throughput at low energies. Results. Based on this analysis, we derived a set of energy-dependent correction factors of the observed responses, enabling a statistically robust analysis of the whole spectral dataset. They will be employed in subsequent papers describing the astrophysical results of the campaign. Aims. We revised the status of the cross-calibration among the scientific payload on board four operation missions: Chandra, NuSTAR, XMM-Newton, and the recently launched XRISM. XRISM carries the micro-calorimeter Resolve, which yields the best energy resolution at energies ≥2 keV. For this purpose, we used the data from a 10-day-long observational campaign targeting the nearby active galactic nucleus NGC 3783, carried out in July 2024. Methods. We present a novel model-independent method for assessing the cross-calibration status that is based on a multi-node spline of the spectra with the highest-resolving power (XRISM/Resolve in our campaign). We also estimated the impact of the intrinsic variability of NGC 3783 on the cross-calibration status due to the different time coverages of participating observatories and performed an empirical reassessment of the Resolve throughput at low energies. Results. Based on this analysis, we derived a set of energy-dependent correction factors of the observed responses, enabling a statistically robust analysis of the whole spectral dataset. They will be employed in subsequent papers describing the astrophysical results of the campaign.

Active Galactic Nuclei, individual: NGC 3783↗
DOE OSTI2024

Newton-Raphson AC Power Flow Convergence Based on Deep Learning Initialization and Homotopy Continuation

Power flow forms the basis of many power system studies. With the increased penetration of renewable energy, grid planners tend to perform multiple power flow simulations under various operating conditions and not just selected snapshots at peak or light load conditions. Getting a converged AC power flow (ACPF) case remains a significant challenge for grid planners especially in large power grid networks. This paper proposes a two-stage approach to improve Newton-Raphson ACPF convergence and was applied to a 6102 bus Electric Reliability Council of Texas (ERCOT) system. The first stage utilizes a deep learning-based initializer with data re-training. Here a deep neural network (DNN) initializer is developed to provide better initial voltage magnitude and angle guesses to aid in power flow convergence. This is because Newton-Raphson ACPF is quite sensitive to the initial conditions and bad initialization could lead to divergence. The DNN initializer includes a data re-training framework that improves the initializer's performance when faced with limited training data. The DNN initializer successfully solved 3,285 cases out of 3,899 non-converging dispatch and performed better than random forest and DC power flow initialization methods. ACPF cases not solved in this first stage are then passed through a hot-starting algorithm based on homotopy continuation with switched shunt control. The hot-starting algorithm successfully converged 416 cases out of the remaining 614 non-converging ACPF dispatch. In conclusion, the combined two-stage approach achieved a 94.9% success rate, by converging a total of 3,701 cases out of the initial 3,899 unsolved cases.

Deep learning↗
DOE OSTI2026

Processed sap flow and fine-root trait data associated with summer drought responses in temperate trees in Lisle, Illinois, USA (2019–2021)

These data support the manuscript “Acquisitive root exploration strategies help maintain higher peak sap flux rates during summer drought, but more root biomass does not”. The dataset includes processed sap flow measurements and fine-root trait data collected between 2019 and 2021 from temperate monodominant tree plots established in the 1920s to 1930s ranging in size from 0.05 to 0.8 ha at The Morton Arboretum in Lisle, IL. Sap flow was measured with ICT sap flow sensors using the heat ratio method. Fine-root traits were measured from soil cores which includes specific root length (SRL), specific root area (SRA), diameter, biomass, and length for diameter classes ≤1 mm and ≤2 mm. The package contains comma separated value (CSV) data files and associated metadata that can be viewed and analyzed using common software such as spreadsheet programs, R, and Python. These data are used to investigate how variation in fine-root traits relate to tree water use and drought response during summer drought linking belowground root traits and aboveground physiological responses.

drought↗
DOE OSTI2025

Dynamic response of a freely rotating butterfly valve in the advanced test reactor − dynamic coefficients modeling

Here, in evaluating the water hammer issue pertaining to the primary-coolant-regulating butterfly valve in the Advanced Test Reactor, the dynamic fluid body interaction (DFBI) approach was implemented in the analysis covered in Part I. Although DFBI modeling accurately and simultaneously solved the dynamic motion of the valve’s disk along with the flow field of the surrounding fluid, it shed little light on the reason behind such motion. For Part II, the reacting torque of the fluid on the disk was decomposed into representations of the dynamic coefficients in terms of stiffness, damping, and added mass. These were evaluated via simulations with steady-state static (stiffness), constant angular speed (damping), and variable angular speed (added mass) disks. Substituting the dynamic coefficients into Newton’s second law enabled the response trajectories to be obtained. Stable (by average) and unstable equilibrium positions and thrust tendencies of the valve were determined based on the stiffness coefficient (or static torque), the response amplitude was dampened or enlarged by the damping coefficient (minorly affected by added mass), and the response frequency was altered by the damping and added mass coefficients. Although the dynamic coefficient approach renders slightly different trajectories, due to the averaging effect of the torque in comparison to the DFBI method, the overall trend of the response aligns with the DFBI simulation, thus confirming the conclusion in Part I that a fix to the current butterfly valve is necessary.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Variational quantum and neural quantum states algorithms for the linear complementarity problem

Variational quantum algorithms (VQAs) are promising hybrid quantum-classical methods designed to leverage the computational advantages of quantum computing while mitigating the limitations of current noisy intermediate-scale quantum (NISQ) hardware. Although VQAs have been demonstrated as proofs of concept, their practical utility in solving real-world problems—and whether quantum-inspired classical algorithms can match their performance—remains an open question. We present a novel application of the variational quantum linear solver (VQLS) and its classical neural quantum states-based counterpart, the variational neural linear solver (VNLS), as key components within a minimum map Newton solver for a complementarity-based rigid-body contact model. We demonstrate using the VNLS that our solver accurately simulates the dynamics of rigid spherical bodies during collision events. These results suggest that quantum and quantum-inspired linear algebra algorithms can serve as viable alternatives to standard linear algebra solvers for modelling certain physical systems.

neural quantum states↗
DOE OSTI2025

A direct-adjoint approach for material point model calibration with application to plasticity

Here, this paper proposes a new approach for the calibration of material parameters in local elastoplastic constitutive models. The calibration is posed as a constrained optimization problem, where the constitutive model evolution equations for a single material point serve as constraints. The objective function quantifies the mismatch between the stress predicted by the model and corresponding experimental measurements. To improve calibration efficiency, a novel direct-adjoint approach is presented to compute the Hessian of the objective function, which enables the use of second-order optimization algorithms. Automatic differentiation is used for gradient and Hessian computations. Two numerical examples are employed to validate the Hessian matrices and to demonstrate that the Newton–Raphson algorithm consistently outperforms gradient-based algorithms such as L-BFGS-B.

36 MATERIALS SCIENCE↗
DOE OSTI2026

ReMU: regional minimal updating for model-based derivative-free optimization

Derivative-free optimization (DFO) problems are optimization problems where derivative information is unavailable or extremely difficult to obtain. Model-based DFO solvers have been applied extensively in scientific computing. Powell's NEWUOA (2004) [Powell, The NEWUOA software for unconstrained optimization without derivatives, in Large-Scale Nonlinear Optimization, Nonconvex Optimization and its Applications Vol. 83, G. Di Pillo and M. Roma, eds., Springer, 2006, pp. 255–297] and Wild's POUNDerS (2014) [Wild, Solving derivative-free nonlinear least squares problems with POUNDERS, in Advances and Trends in Optimization with Engineering Applications, T. Terlaky, M.F. Anjos, and S. Ahmed, eds., SIAM, 2017, pp. 529–540] explore the numerical power of the minimal norm Hessian (MNH) model for DFO and contributed to the open discussion on building better models with fewer data to achieve faster numerical convergence. Another decade later, we propose the regional minimal updating (ReMU) models, and extend the previous models into a broader class, including the H 2 norm models [Xie and Yuan, Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms, IMA J. Numer. Anal. 46 (2025), pp. 21–50]. This paper shows motivation behind ReMU models, computational details, theoretical and numerical results on particular extreme points and the barycentre of ReMU's weight coefficient region, and the associated KKT matrix error and distance. Novel metrics, such as the truncated Newton step error, are proposed to numerically understand the new models' properties. A new algorithmic strategy, based on iteratively adjusting the ReMU model type, is also proposed, and shows numerical advantages by combining and switching between the barycentric model and the classic least Frobenius norm model in an online fashion.

derivative-free trust-region methods↗
DOE OSTI2025

$\mathrm{SageNet}$: Fast Neural Network Emulation of the Stiff-amplified Gravitational Waves from Inflation

Accurate modeling of the inflationary gravitational waves (GWs) requires time-consuming, iterative numerical integrations of differential equations to take into account their backreaction on the expansion history. To improve computational efficiency while preserving accuracy, we present the Stiff-amplified Gravitational-wave Emulator Network (SageNet), a deep learning framework designed to replace conventional numerical solvers (code available at https://github.com/YifangLuo/SageNet). SageNet employs a long short-term memory architecture to emulate the present-day energy density spectrum of the inflationary GWs with possible stiff amplification, Ω GW (f). Trained on a data set of 25,689 numerically generated solutions, SageNet allows accurate reconstructions of Ω GW (f) and generalizes well to a wide range of cosmological parameters; 90.9% of the test emulations with randomly distributed parameters exhibit errors of under 4%. In addition, SageNet demonstrates its ability to learn and reproduce the artificial, adaptive sampling patterns in numerical calculations, which implement denser sampling of frequencies around changes in spectral indices in Ω GW (f). The dual capability of learning both physical and artificial features of the numerical GW spectra establishes SageNet as a robust alternative to exact numerical methods. Finally, our benchmark tests show that SageNet reduces the computation time from tens of seconds to milliseconds, achieving a speedup of ∼10 4 times over standard CPU-based numerical solvers with the potential for further acceleration on GPU hardware. These capabilities make SageNet a powerful tool for accelerating Bayesian inference procedures for extended cosmological models. In a broad sense, the SageNet framework offers a fast, accurate, and generalizable solution to modeling cosmological observables whose theoretical predictions demand costly differential equation solvers.

Astronomy data modeling↗
DOE OSTI2026

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗
DOE OSTI2025

Zero curvature is a necessary and sufficient condition for a spin-orbital decomposition

There has been an extended debate regarding the existence of a spin-orbital decomposition of the angular momentum of photons and other massless particles. It was recently shown that there are both geometric and topological obstructions preventing any such decomposition. Here we show that any geometric connection on a particle’s state space induces a splitting of the angular momentum into two operators. These operators are well-defined angular momentum operators if and only if the connection has zero curvature. Massive particles have two canonical curved connections corresponding to boosts and rotations, respectively. Furthermore, these can be uniquely combined to produce a flat connection, and this gives a novel derivation of the Newton-Wigner position operator and the corresponding spin and orbital angular momenta for relativistic massive particles. When the mass is taken to zero, transverse boosts and rotations degenerate, leaving only a single connection for massless particles. This connection produces a commonly proposed splitting of the massless angular momentum into two operators. However, the connection is not flat, explaining why these operators do not satisfy the angular momentum commutation relations and are thus not true spin and orbital angular momentum operators.

Angular momentum↗
DOE OSTI2025

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗