SEARCH · Search NASA

Results for “Iterative”

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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Challenges of conventional iterative all-atom and coarse-grained multiscale molecular dynamics

In this work, we evaluate the biomolecular dynamics behaviors when conventionally iterating between all-atom (AA) and coarse-grained (CG) molecular dynamics (MD) simulations over multiple cycles. We implemented the workflow to iterate between AA and CG in OpenMM, namely the iterative multiscale MD (iMMD) simulation workflow. In particular, we aim to identify practical applications for iterating between AA and CG simulations in a conventional manner without any constraints or model modifications. We evaluate the iMMD workflow on four representative systems, spanning folding of two soluble proteins and protein-protein as well as protein-lipid interactions of two membrane proteins. We observe that iteration between AA and CG representations could help the soluble proteins exit undesirable metastable states to fold, resulting from random protein structural distortions due to cycling. Consequently, the most reliable use of iterative AA and CG simulations appears to be to accelerating complex lipid mixing for membrane-bound protein systems rather than sampling protein conformational space. Our work explores the practical usages and limitations for iterative AA and CG simulations using readily available AA and CG force fields. The evaluated iMMD workflow in OpenMM is made available at https://github.com/lanl/iMMD.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2018

Hybrid iterative approach for simulation of radio-frequency fields in plasma

In this work, a novel iterative approach for solving discretized linear wave equations in a frequency domain, which combines time evolution with iterative relaxation schemes, is presented. In this hybrid approach, each iteration cycle consists of evolution of electromagnetic (EM) fields in time over a specified number of field periods followed by several iterative relaxations. Provided that there is sufficient dissipation, both the time evolution and the iterative relaxations contribute to the convergence of the EM fields to the solution of the formulated full wave boundary value problem. Time evolution rapidly distributes EM fields, propagating with group velocity, over the simulation domain, while the iterative relaxations smooth the fields, reducing the numerical errors such that iteration cycles converge to a steady state solution, approximating the solution of the formulated problem. This approach is intended for large scale simulations which are beyond the capabilities of direct solvers presently used for solving wave equations in the frequency domain. Lastly, the technique is demonstrated for solving wave equations on a regular grid using a cold plasma dielectric model with collisions for 2D modeling of EM fields in tokamak in an electron cyclotron frequency range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SAT operates as a sequence of iterations, in which bitstrings returned from one iteration are used to set spin-dependent phases in oscillating transverse fields in the next iteration. Over several iterations, the novel mechanism of the algorithm steers the system toward the problem ground state. We benchmark IST-SAT on sets of hard MAX-3-XORSAT problem instances with exact state vector simulation, and report polynomial speedups over Trotterized adiabatic quantum computation and the best known semi-greedy classical algorithm. When IST-SAT is seeded with a sufficiently good initial approximation, the algorithm converges to exact solution(s) in a polynomial number of iterations. Our numerical results identify a critical Hamming radius, or quality of initial approximation, where the time-to-solution crosses from exponential to polynomial scaling in problem size. This work proposes IST-SAT a new quantum algorithm, which improves upon solutions obtained from initial classical or quantum optimization algorithms. The steering mechanism we introduce through IST-SAT presents a new path toward achieving quantum advantage in optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Testing of the ITER Central Solenoid Modules

The ITER Central Solenoid is under fabrication by the U.S. ITER organization and its subcontractors. U.S. ITER will supply seven modules to ITER IO, six of which will be assembled in a stack that forms the ITER Central Solenoid. The first modules that were built by GA at their facility, went into high voltage testing, including Paschen testing in the vacuum, and then they were tested at 4.5 K and up to 40 kA to demonstrate compliance of the coil with the ITER requirements. In this article, we present the Test Plan and results of the central solenoid (CS) module’s performance, especially at the full current. We measured critical temperatures in several pancakes, we measured ac losses, joint resistance, and hydraulic characteristics of the coils. We also measured displacements of the coil height and hoop strain of the CS module (CSM) to verify the structural mechanical characteristics of the coil along with the cooldown shrinkage of the coil. We studied the performance of the cowound quench detectors and confirmed their effectiveness in the suppression of inductive noise. This information is necessary for verification of the stack behavior of CS in ITER operation. The test results and preliminary analyses are presented, compared to expectations, and discussed.

Martovetsky, Nicolai↗

NASA NTRS1999

Solving Upwind-Biased Discretizations: Defect-Correction Iterations

This paper considers defect-correction solvers for a second order upwind-biased discretization of the 2D convection equation. The following important features are reported: (1) The asymptotic convergence rate is about 0.5 per defect-correction iteration. (2) If the operators involved in defect-correction iterations have different approximation order, then the initial convergence rates may be very slow. The number of iterations required to get into the asymptotic convergence regime might grow on fine grids as a negative power of h. In the case of a second order target operator and a first order driver operator, this number of iterations is roughly proportional to h-1/3. (3) If both the operators have the second approximation order, the defect-correction solver demonstrates the asymptotic convergence rate after three iterations at most. The same three iterations are required to converge algebraic error below the truncation error level. A novel comprehensive half-space Fourier mode analysis (which, by the way, can take into account the influence of discretized outflow boundary conditions as well) for the defect-correction method is developed. This analysis explains many phenomena observed in solving non-elliptic equations and provides a close prediction of the actual solution behavior. It predicts the convergence rate for each iteration and the asymptotic convergence rate. As a result of this analysis, a new very efficient adaptive multigrid algorithm solving the discrete problem to within a given accuracy is proposed. Numerical simulations confirm the accuracy of the analysis and the efficiency of the proposed algorithm. The results of the numerical tests are reported.

Diskin, Boris↗

DOE OSTI2026

Predicting core transport in ITER baseline discharges with neon injections

Achieving self-consistent performance predictions for ITER requires integrated modeling of core transport and divertor power exhaust under realistic impurity conditions. We present results from a systematic power-flow and impurity-content study for the ITER 15 MA baseline scenario constrained directly by existing SOLPS-ITER neon-seeded divertor solutions. Using the OMFIT STEP workflow, stationary temperature and density profiles are predicted with TGYRO for $1.5 \unicode{x2A7D} Z_\textrm{eff} \unicode{x2A7D} 2.5$, and the corresponding power crossing the separatrix $P_\textrm{sep}$ is evaluated. We find that $P_\textrm{sep}$ varies by more than a factor of 1.7 across this scan and matches the ${\sim}100$ MW SOLPS-ITER prediction when $Z_\textrm{eff} \simeq 1.6$ or when auxiliary heating is reduced to ${\sim}75\%$ of nominal. Rotation-sensitivity studies show that plausible variations in toroidal flow magnitude modify $P_\textrm{sep}$ by $\lesssim 20\%$, while AURORA modeling confirms that charge-exchange radiation inside the separatrix is dynamically negligible under predicted ITER neutral densities. These results identify a restricted compatibility window, $Z_\textrm{eff} \approx 1.6$ –1.75 and $0.75 \lesssim f_{P_\textrm{aux}} \unicode{x2A7D} 1.0$, in which core transport predictions remain aligned with neon-seeded divertor protection targets. This self-consistent, model-constrained framework provides actionable guidance for impurity control and auxiliary-heating scheduling in early ITER operation and supports future whole-device scenario optimization.

ITER↗

DOE OSTI2023

Simulation of shell pellet injection strategies for ITER-scale tokamaks

Dispersive shell pellet (DSP) injection is considered as an alternative to shattered pellet injection as a disruption mitigation system for ITER, and strategies for penetration of a shell pellet into ITER are modeled with the 3D MHD code NIMROD. Because the high plasma temperatures lead to rapid ablation of the shell, delivery of the dispersive payload to the core of ITER will be very challenging. Two strategies to increase payload delivery depth are modeled: first, multiple staggered pellets are simulated in DIII-D, to assess the ability for one DSP to "piggy-back" on another to reach deeper into the core; second, DSP injection after pre-dilution-cooling with deuterium is simulated in ITER, in order to reduce the plasma temperature before shell pellet arrival. The DIII-D simulations show that a second, slower pellet can penetrate much deeper once the release of the first payload strongly cools the mid-radius region. When the pellets are staggered, deeper penetration of the second pellet leads to higher radiation fraction and larger runaway electron loss fraction, consistent with single pellet results. However, simultaneously released pellets at mid-radius that do not trigger a large n=1 mode produce an even higher radiation fraction. The ITER simulations show that an inside-out TQ can be produced with a payload release just inside of the q=2 surface, which is achieved at a speed of 800 m/s after pre-dilution cooling. Although stochastization of the core leads to a complete thermal quench, the edge flux surfaces are surprisingly robust in the ITER simulations, regardless of payload release location. As a result, runaway electron losses would not be expected.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

First tungsten radiation studies in DIII-D’s ITER baseline demonstration discharges

Abstract ITER Baseline Scenario plasmas were studied in DIII-D using krypton and xenon gases as a proxy for the tungsten that will be present in ITER. These impurities were chosen for having the same radiative loss rate Lz as tungsten would exhibit in the hotter ITER core. Results show that the scenario with these core radiators spans the range of impurity concentration and W radiated fraction expected for ITER, and up to 50% higher values, explored at zero injected torque, as well as 1 Nm and full co-torque injection with T ∼ 3 Nm. Stationary discharges with duration >2–4 τ R are achieved with f rad ⩾ 30% leading to a reduction in confinement of ∼10%, and a comparison with real metal radiators in the same range of f rad shows that the higher Lz at the lower temperatures in these plasmas yields too pessimistic results on the survivability and performance of this scenario in ITER. Simulations of ITER power balance including W radiation show that with concentration up to three times higher than in the DIII-D plasmas the scenario can be stationary, remaining at acceptable core radiated fraction values.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2020

Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods

Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both internode communications and even moreso in intranode data motion. A new approach to address this limitation is to make use of data compression in the form of a compressed data array. Storing data in a compressed data array and converting to standard IEEE-754 types as needed during a computation can reduce the pressure on bandwidth and storage. However, repeated conversions (lossy compression and decompression) introduce additional approximation errors, which need to be shown to not significantly affect the simulation results. Here, we extend recent work that analyzed the error of a single use of compression and decompression of the ZFP compressed data array representation to the case of time-stepping and iterative schemes, where an advancement operator is repeatedly applied in addition to the conversions. We show that the accumulated error for iterative methods involving fixed-point and time evolving iterations is bounded under standard constraints. An upper bound is established on the number of additional iterations required for the convergence of stationary fixed-point iterations. An additional analysis of traditional forward and backward error of stationary iterative methods using ZFP compressed arrays is also presented. The results of several 1D, 2D, and 3D test problems are provided to demonstrate the correctness of the theoretical bounds.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Self-consistent simulation of transport and turbulence in tokamak edge plasma by coupling SOLPS-ITER and BOUT++

The status of coupling the fluid plasma/neutral 2D transport code SOLPS-ITER and the fluid 3D turbulence code BOUT++ is reported. Both codes simulated the same region, which is from several cm inside the magnetic separatrix to the far scrape-off layer (SOL). Compared to the profile evolution time scale, the characteristic time scale of the turbulence is quite short. For the turbulence code BOUT++, the time scale is around 10 -6 s. However, for the transport code SOLPS-ITER, the time scale is around 10 -3 –10 -2 s. An iterative scheme is used that each system is evolved on its own characteristic time scale. SOLPS-ITER can provide the background profiles of density, ion, and electron temperature to BOUT++. In turn, BOUT++ can provide the corresponding radial transport coefficients to SOLPS-ITER. The coupling has involved the ion density, ion temperature, and electron temperature. After several steps of iteration, the profiles of density, ion, and electron temperature show fluctuations, and the differences of the changes between two consecutive profiles are getting smaller and smaller. Finally, the self-consistent solutions of turbulence and transport can be obtained.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Overview of the EUROfusion Tokamak Exploitation programme in support of ITER and DEMO

Within the 9th European Framework programme, since 2021 EUROfusion is operating five tokamaks under the auspices of a single Task Force called ‘Tokamak Exploitation’. The goal is to benefit from the complementary capabilities of each machine in a coordinated way and help in developing a scientific output scalable to future largre machines. The programme of this Task Force ensures that ASDEX Upgrade, MAST-U, TCV, WEST and JET (since 2022) work together to achieve the objectives of Missions 1 and 2 of the EUROfusion Roadmap: i) demonstrate plasma scenarios that increase the success margin of ITER and satisfy the requirements of DEMO and, ii) demonstrate an integrated approach that can handle the large power leaving ITER and DEMO plasmas. The Tokamak Exploitation task force has therefore organized experiments on these two missions with the goal to strengthen the physics and operational basis for the ITER baseline scenario and for exploiting the recent plasma exhaust enhancements in all four devices (PEX: Plasma EXhaust) for exploring the solution for handling heat and particle exhaust in ITER and develop the conceptual solutions for DEMO. The ITER Baseline scenario has been developed in a similar way in ASDEX Upgrade, TCV and JET. Key risks for ITER such as disruptions and run-aways have been also investigated in TCV, ASDEX Upgrade and JET. Experiments have explored successfully different divertor configurations (standard, super-X, snowflakes) in MAST-U and TCV and studied tungsten melting in WEST and ASDEX Upgrade. The input from the smaller devices to JET has also been proven successful to set-up novel control schemes on disruption avoidance and detachment.

ASDEX upgrade↗

DOE OSTI2024

Prediction of performance and turbulence in ITER burning plasmas via nonlinear gyrokinetic profile prediction

Burning plasma performance, transport, and the effect of hydrogen isotope (H, D, D-T fuel mix) on confinement has been predicted for ITER baseline scenario (IBS) conditions using nonlinear gyrokinetic profile predictions. Accelerated by surrogate modeling (Rodriguez-Fernandez et al 2022 Nucl. Fusion 62 076036), high fidelity, nonlinear gyrokinetic simulations performed with the CGYRO code (Candy et al 2016 J. Comput. Phys. 324 73), were used to predict profiles of T i , T e , and n e while including the effects of alpha heating, auxiliary power (NBI + ECH), collisional energy exchange, and radiation losses inside of $r/a$ = 0.9. Predicted profiles and resulting energy confinement are found to produce fusion power and gain that are approximately consistent with mission goals ($P_\textrm{fusion} = 500$ MW at Q = 10) for the baseline scenario and exhibit energy confinement that is within 1σ of the H-mode energy confinement scaling. The power of the surrogate modeling technique is demonstrated through the prediction of alternative ITER scenarios with reduced computational cost. These scenarios include conditions with maximized fusion gain and an investigation of potential resonant magnetic perturbation (RMP) effects on performance with a minimal number of gyrokinetic profile iterations required (3–6). These predictions highlight the stiff ITG nature of the core turbulence predicted in the ITER baseline and demonstrate that $Q \gt$ 17 conditions may be accessible by reducing auxiliary input power while operating in IBS conditions. Prediction of full kinetic profiles allowed for the projection of hydrogen isotope effects around ITER baseline conditions. The gyrokinetic fuel ion species was varied from H, D, and 50/50 D-T and kinetic profiles were predicted. Results indicate that a weak or negligible isotope effect will be observed to arise from core turbulence in IBS conditions. The resulting energy confinement, turbulence, and density peaking, and the implications for ITER operations will be discussed.

gyrokinetics↗

DOE OSTI2023

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

NASA NTRS1994

Global Asymptotic Behavior of Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

Yee, H. C.↗

NASA NTRS2011

Iterative Strain-Gage Balance Calibration Data Analysis for Extended Independent Variable Sets

A new method was developed that makes it possible to use an extended set of independent calibration variables for an iterative analysis of wind tunnel strain gage balance calibration data. The new method permits the application of the iterative analysis method whenever the total number of balance loads and other independent calibration variables is greater than the total number of measured strain gage outputs. Iteration equations used by the iterative analysis method have the limitation that the number of independent and dependent variables must match. The new method circumvents this limitation. It simply adds a missing dependent variable to the original data set by using an additional independent variable also as an additional dependent variable. Then, the desired solution of the regression analysis problem can be obtained that fits each gage output as a function of both the original and additional independent calibration variables. The final regression coefficients can be converted to data reduction matrix coefficients because the missing dependent variables were added to the data set without changing the regression analysis result for each gage output. Therefore, the new method still supports the application of the two load iteration equation choices that the iterative method traditionally uses for the prediction of balance loads during a wind tunnel test. An example is discussed in the paper that illustrates the application of the new method to a realistic simulation of temperature dependent calibration data set of a six component balance.

Ulbrich, Norbert Manfred↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

97 MATHEMATICS AND COMPUTING↗