Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration 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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Evaluation of the critical behavior near ferromagnetic to paramagnetic phase transition in CrTe 1-x Se x alloys: An experimental study

For this study, we used the conventional solid-state reaction method to prepare stoichiometric samples of CrTe 1-x Se x , where 0 ≤ x ≤ 0.10, and investigated the structural and critical behavior of the prepared samples. Room temperature powder X-ray diffraction, along with Rietveld refinement, revealed the emergence of the NiAs structure with P6 3 /mmc (194) space group with increasing Se substitution. The high-temperature linear fit to inverse of the dc-susceptibility versus temperature for the mother sample resulted in an effective moment of 3.65μ B Cr with Curie-Weiss temperature near 335K, which is slightly higher than the Tc of ~332K obtained from the inflection point of magnetization versus temperature. Magnetization isotherms were employed to investigate the critical behavior of ferromagnetic CrTe 1-x Se x with 0.0 ≤ x ≤ 0.10 near their Curie temperatures (Tc). The magnetic behavior near Tc was found to follow 3D mean-field critical exponents with a second-order phase transition in all samples investigated. We fine-tuned the critical exponents (β, γ, and δ) using a combination of an iteration technique, the Kouvel-Fisher method, and modified Arrott plots. All samples follow a mean field behavior, with Tc ranging from 298 to 340K. The acquired values exhibit self-consistency, as indicated by the results from the Widom scaling relation. Furthermore, the magnetization isotherms exhibit a universal scaling behavior, providing additional credence to the calculated critical exponents.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Data-driven acceleration of thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singular value decomposition

In this work, we present a method for accelerating discrete ordinates radiative transfer calculations for radiative transfer. Our method works with nonlinear positivity fixes, in contrast to most acceleration schemes. The method is based on the dynamic mode decomposition (DMD) and using a sequence of rank-one updates to compute the singular value decomposition needed for DMD. Using a sequential method allows us to automatically determine the number of solution vectors to include in the DMD acceleration. We present results for slab geometry discrete ordinates calculations with the standard temperature linearization. Compared with positive source iteration, our results demonstrate that our acceleration method reduces the number of transport sweeps required to solve the problem by a factor of about 3 on a standard diffusive Marshak wave problem, a factor of several thousand on a cooling problem where the effective scattering ratio approaches unity, and a factor of 20 improvement in a realistic, multimaterial radiating shock problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient and robust stability analysis in the internal energy, volume, and moles (UVN) space

Hydrodynamic simulation of fluids in vessels is often based on the internal energy (U), volume (V), and the number of moles of all components ( re N = N 1 , N 2 , ..., N n ) as the working variables to determine the thermodynamic state by finding the global maximum of entropy. The procedure of finding the equilibrium state may be divided into two steps: stability analysis and phase-split computations. Stability analysis is performed first, and the phase-split computation proceeds if the system is unstable. Most of the past work on UVN space has been based on phase-split computations, while the stability analysis is barely investigated. Furthermore, previous studies for the stability analysis use only Newton's method to solve the non-linear algebraic equations. We present an efficient and robust approach for stability analysis where UVN is specified. The successive substitution iteration (SSI) is used to provide good initial guesses for Newton's method. The proposed approach results in a reduced number of unknowns and does not require a large number of iterations to achieve convergence in Newton's method. Overall, our proposed formulation is compatible with different equations of state and is applicable to both pure component and multi-components. The robustness and efficiency of the algorithm for stability analysis are demonstrated in various examples.

02 PETROLEUM↗
DOE OSTI2025

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Three dimensions, two microscopes, one code: Automatic differentiation for x-ray nanotomography beyond the depth of focus limit

Conventional tomographic reconstruction algorithms assume that one has obtained pure projection images, involving no within-specimen diffraction effects nor multiple scattering. Advances in x-ray nanotomography are leading toward the violation of these assumptions, by combining the high penetration power of x-rays, which enables thick specimens to be imaged, with improved spatial resolution that decreases the depth of focus of the imaging system. We describe a reconstruction method where multiple scattering and diffraction effects in thick samples are modeled by multislice propagation and the 3D object function is retrieved through iterative optimization. We show that the same proposed method works for both full-field microscopy and for coherent scanning techniques like ptychography. Our implementation uses the optimization toolbox and the automatic differentiation capability of the open-source deep learning package TensorFlow, demonstrating a straightforward way to solve optimization problems in computational imaging with flexibility and portability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Systematic determination of a material’s magnetic ground state from first principles

Abstract We present a self-consistent method based on first-principles calculations to determine the magnetic ground state of materials, regardless of their dimensionality. Our methodology is founded on satisfying the stability conditions derived from the linear spin wave theory (LSWT) by optimizing the magnetic structure iteratively. We demonstrate the effectiveness of our method by successfully predicting the experimental magnetic structures of NiO, FePS 3 , FeP, MnF 2 , FeCl 2 , and CuO. In each case, we compared our results with available experimental data and existing theoretical calculations reported in the literature. Finally, we discuss the validity of the method and the possible extensions.

Chemistry↗
DOE OSTI2020

Asynchronous Richardson iterations: theory and practice

We consider asynchronous versions of the first- and second-order Richardson methods for solving linear systems of equations. These methods depend on parameters whose values are chosen a priori. We explore the parameter values that can be proven to give convergence of the asynchronous methods. This is the first such analysis for asynchronous second-order methods. We find that for the first-order method, the optimal parameter value for the synchronous case also gives an asynchronously convergent method. For the second-order method, the parameter ranges for which we can prove asynchronous convergence do not contain the optimal parameter values for the synchronous iteration. In practice, however, the asynchronous second-order iterations may still converge using the optimal parameter values, or parameter values close to the optimal ones, despite this result. We explore this behavior with a multithreaded parallel implementation of the asynchronous methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Nonlinear, real-time optimization for actuator management in tokamaks

Experiments in DIII-D have been carried out to test a novel actuator management approach in tokamaks. Here, the actuator management scheme is posed as a nonlinear-optimization problem in which the actuator commands are calculated in real time according to the changing control priorities, plasma state, and actuator availability. Such optimization problem is solved using the augmented Lagrangian method, combined with a gradient projection method and a conjugate-gradient iteration algorithm. The algorithmic approach followed in this work does not depend on the particular control objectives or actuators considered, which facilitates its integration with other independently-designed control components within a plasma-control system. In addition, the actuator-management algorithm is able to handle the optimization problem in a computationally efficient manner, making it suitable for real-time implementations. Initial DIII-D results in the steady-state high-q min scenario have demonstrated the capabilities of the actuator manager to perform both simultaneous multiple mission and repurposing sharing, which will be required in ITER.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Approximation of refrigerant thermophysical properties using neural networks to speed up transient thermofluid simulations

Accurate and efficient evaluations of refrigerant thermophysical properties and their partial derivatives are essential for transient simulations of thermofluid systems, where several computations need to be executed at each integration time step. Since the utilization of an Equation of State for retrieving properties based on a pair of independent inputs typically involves numerical iterations in solution procedures, when the input variables differ from the refrigerant state variables employed in dynamic models, a variety of approaches including lookup table interpolation and curve fitting have been developed to explicitly approximate these properties based on the state variables, and consequently eliminate internal iterations. This paper presents an alternative method that exploits derivative-informed neural networks to model refrigerant properties explicitly from inputs of pressure and enthalpy, while ensuring consistent partial derivatives generated by differentiating the neural networks. Computational speed and accuracy of the proposed approach are demonstrated via transient simulations of a discretized heat exchanger model in Modelica, and comparisons against other property evaluation routines. Simulation results indicate that the proposed approach can realize a significant speedup with negligible discrepancies in predicted transients. The method is implemented in an open-source Modelica library.

Ma, Jiacheng↗
DOE OSTI2023

Comparing Adjoint Waveform Tomography Models of California Using Different Starting Models

Abstract Adjoint waveform tomography (AWT) sits at the cutting edge of seismic tomography on local, regional, and global scales. However, the choice in starting model may have a significant impact on the final inversion results. In this paper, we present 3 AWT models of California that are based on different starting models. We chose three models that were inverted at different scales: SPiRaL, a global travel‐time tomography model (Simmons et al., 2021, 10.1093/gji/ggab277 ), CSEM_NA, a regional adjoint tomography model of North America and the North Atlantic (Krischer et al., 2018, 10.1029/2017JB015289 ), and WUS256, a regional adjoint tomography model of the western US (Rodgers et al., 2022, https://doi.org/10.1029/2022JB024549 ). We then inverted three AWT models using the same source and receiver set. We ran each model over three period bands: 30–100 s, 25–100 s, and 20–80 s. Once the iterations were finalized, we used five methods of testing model similarity in both the model and data space. We conclude that the choice of starting model has a minimal impact on long wavelength models if an appropriate multi‐scale inversion approach is used.

58 GEOSCIENCES↗
DOE OSTI2023

Linearized frequency domain Landau-Lifshitz-Gilbert equation formulation

We present a general finite element linearized Landau-Lifshitz-Gilbert equation (LLGE) solver for magnetic systems under weak time-harmonic excitation field. The linearized LLGE is obtained by assuming a small deviation around the equilibrium state of the magnetic system. Inserting such expansion into LLGE and keeping only first order terms gives the linearized LLGE, which gives a frequency domain solution for the complex magnetization amplitudes under an external time-harmonic applied field of a given frequency. We solve the linear system with an iterative solver using generalized minimal residual method. We construct a preconditioner matrix to effectively solve the linear system. The validity, effectiveness, speed, and scalability of the linear solver are demonstrated via numerical examples.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A Stochastic Calculus Approach to Boltzmann Transport

Traditional Monte Carlo methods for particle transport utilize source iteration to express the solution, the flux density, of the transport equation as a Neumann series. Our contribution is to show that the particle paths simulated within source iteration are associated with the adjoint flux density and the adjoint particle paths are associated with the flux density. Here, we make our assertion rigorous through the use of stochastic calculus by representing the particle path used in source iteration as a solution to a stochastic differential equation (SDE). The solution to the adjoint Boltzmann equation is then expressed in terms of the same SDE, and the solution to the Boltzmann equation is expressed in terms of the SDE associated with the adjoint particle process. An important consequence is that the particle paths used within source iteration simultaneously provide Monte Carlo samples of the flux density and adjoint flux density in the detector and source regions, respectively. The significant practical implication is that particle trajectories can be reused to obtain both forward and adjoint quantities of interest. To the best our knowledge, the reuse of entire particles paths has not appeared in the literature. Monte Carlo simulations are presented to support the reuse of the particle paths.

Boltzmann transport↗
DOE OSTI2026

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimal dynamic control for a maglev vehicle moving on multi-span guideway girders

Abstract An optimal control algorithm using a virtual tuned mass damper called virtual TMD to control the levitation force of a magnetic system is developed for resonance suppression of a maglev vehicle moving on multi-span guideway girders. Since the optimal dynamic parameters of a TMD in vibration control are well developed, the optimal tuning gains required to control the magnetic oscillations of the maglev bogie can be directly used and fed back to the maglev control system. To address the dynamic interaction analysis from the maglev vehicle to the guideway girders and vice versa, the entire coupling system is decomposed into two subsystems, one is the moving vehicle subsystem and another the stationary guideway subsystem. Then, an incremental–iterative procedure associated with the Newmark method is presented to solve the two sets of subsystem equations. Finally, the control effectiveness and parametric studies of the optimal virtual TMD scheme on resonance reduction of the moving maglev vehicle are demonstrated.

Liu, Linya↗
DOE OSTI2024

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Impact of Increased Latent Generations on Sensitivity Calculations with SCALE [Slides]

Depending on the system, energy, and/or nuclide, altering the number of latent generations can significantly impact generated sensitivity coefficients. In general, as the number of latent generations increases, the accuracy of the generated sensitivity value compared with the DP value increases and there is a significant increase in the uncertainty with generated sensitivity values. IFP generated sensitivities appear to be more stable than those with CLUTCH. Complex systems, even with IFP and increased latent generations can still produce poor results (i.e., MPC- 32). This reiterates the importance of performing DPs to confirm sensitivities. IFP-Shift and CLUTCH can take advantage of parallel computing abilities. Work continues in this area as additional parameters and calculational methods are examined to provide analysts insights to successfully generating sensitivity coefficients for confirmatory analyses and validation efforts.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗