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 1,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS1987

A new method to predict unsteady aeroelastic behavior

A new method for predicting subsonic flutter and static deflections, including divergence, has been developed. The present method accounts for aspect ratio and, in the case of flutter, static deflections. The angle of attack is limited only by the occurrence of stall or vortex bursting near the wing. The innovation in the present method is to integrate simultaneously and interactively the equations of motion of the structure and the flowfield. The present approach employs an iterative scheme based on the predictor-corrector method. The general unsteady vortex-lattice method (UVLM) is used to predict the aerodynamic loads. Because the UVLM predicts the wakes as part of the solution, the history of the motion is taken into account; hysteresis is predicted. The deflection (for both bending and torsion) is expressed as an expansion in terms of the free-vibration modes. The time-dependent coefficients in these expansions serve as the generalized coordinates. Numerical examples illustrating the calculation of static deflections and transient dynamic responses above and below the flutter boundary are included.

Strganac, Thomas W.↗
NASA NTRS1985

Higher order methods for convection-diffusion problems

This paper applies C1 cubic Hermite polynomials embedded in an orthogonal collocation scheme to the spatial discretization of the unsteady nonlinear Burgers equation as a model of the equations of fluid mechanics. The temporal discretization is carried out by means of either a noniterative finite difference or an iterative finite difference procedure. Results of this method are compared with those of a second-order finite difference scheme and a splined-cubic Taylor's series scheme. Stability limits are derived and the matrix structure of the several schemes are compared.

Murphy, J. D.↗
NASA NTRS1987

A new method to real-normalize measured complex modes

A time domain subspace iteration technique is presented to compute a set of normal modes from the measured complex modes. By using the proposed method, a large number of physical coordinates are reduced to a smaller number of model or principal coordinates. Subspace free decay time responses are computed using properly scaled complex modal vectors. Companion matrix for the general case of nonproportional damping is then derived in the selected vector subspace. Subspace normal modes are obtained through eigenvalue solution of the (M sub N) sup -1 (K sub N) matrix and transformed back to the physical coordinates to get a set of normal modes. A numerical example is presented to demonstrate the outlined theory.

Wei, Max L.↗
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↗
NASA NTRS2011

Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems

A technique based on Evolutionary Computational Methods (ECMs) was developed that allows for the automated optimization of complex computationally modeled systems, such as autonomous systems. The primary technology, which enables the ECM to find optimal solutions in complex search spaces, derives from evolutionary algorithms such as the genetic algorithm and differential evolution. These methods are based on biological processes, particularly genetics, and define an iterative process that evolves parameter sets into an optimum. Evolutionary computation is a method that operates on a population of existing computational-based engineering models (or simulators) and competes them using biologically inspired genetic operators on large parallel cluster computers. The result is the ability to automatically find design optimizations and trades, and thereby greatly amplify the role of the system engineer.

Terrile, Richard J.↗
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↗
NASA NTRS1980

Methods of using closure phases in radio aperture synthesis

A simple iterative algorithm for reconstructing the images of compact radio sources from very-long-baseline interferometry (VLBI) measurements of visibility amplitudes and 'closure' phases is described. The method makes efficient use of redundant sampling of spatial frequencies by making a global solution of phase 'closure' equations for a complete set of observations.

Rogers, A. E. E.↗
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↗