Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative methods”

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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

EUTERPE: A global gyrokinetic code for stellarator geometry

The current state of the EUTERPE code is described with emphasis on the implemented models and their numerical implementation. The code solves the multi-species electromagnetic gyrokinetic equations in the full volume of a three-dimensional domain. Noise reduction of the particle-in-cell method is achieved by using a δf-method and Fourier filters. The field equations are discretized with B-splines and the resulting system of equations is solved iteratively. For linear simulations a phase-factor transformation is applied in order to strongly reduce the necessary grid resolution. Apart from the full gyrokinetic model, other numerically less expensive hybrid models are also implemented. They are mainly tailored for comparison with fluid theory and for studying the interaction of the bulk plasma with fast particles. The code is parallelized for CPUs by particle and domain decomposition. Good scalability up to several thousand nodes is demonstrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Physics-Based Real-time Analysis and Control to Achieve Transient-Free Operations for the ITER Era (Final Report)

This is the final report for the early career award for Prof. Egemen Kolemen that aimed to develop the physics and technical basis of real-time transient – i.e. disruptions and Edge Localized Modes (ELMs) – avoidance and feedback control at the DIII-D nuclear fusion facility for the ITER era. During this project, we reconstructed high quality real-time DIII-D equilibria using kinetic information from the motional Stark effect (MSE), Thomson Scattering (TS), and Charge Exchange Recombination (CER) spectroscopy. These equilibria were analyzed in real-time to determine the low-n ideal MHD stability and the pedestal stability thresholds, and to obtain plasma response models. These calculations were used to understand which physical process evolves to lead to the onset of disruption in ITER-relevant scenarios at DIII-D, and how disruption can be predicted using stability analysis as opposed to the current methods of correlation of various signals, which are descriptive but lack predictive power. In the disruption studies, we focused on tearing modes, since these constitute the vast majority of disruptions in this regime. With this knowledge, real-time disruption avoidance algorithms were developed and tested. The enhanced situation awareness and physics insight were used in advanced real-time feedback control of pedestal and core profiles, which allowed the pursuit and sustainment of transient-free high-confinement regimes that cannot be achieved via feed-forward design based on in-between shot analysis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Field Test Report Neutron Scintillator Array Dry Storage Cask Scanner FY2024

During two weeks of Field Testing at the Idaho National Laboratory INTEC Cask Farm in July and August 2024, the LLNL Dry Storage Cask Scanner Array was lifted on top of an MC-10 dry storage fuel cask and operated to acquire neutron and gamma-ray data from the 24 fuel bundle positions. Neutron and gamma-ray data acquisition scans across the top of the cask of varying dwell times were performed July 15-18, 2024 and August 19-22, 2024 to evaluate the ability of the scanner data to reveal asymmetries in the fuel positions that reflect asymmetries in the MC-10 cask fuel bundle loading. The MC-10 cask 24 position fuel bundle loading at the INTEC Cask Farm is well documented, including the locations of six empty fuel bundle positions. This loading presents an opportunity to test the ability of the scanner system to detect diversion of spent fuel bundles as well as to validate the MC-10 cask MCNP modeling. The cask scanner array consists of six Stilbene crystal scintillator detectors and a linear actuator frame that moves the six detectors across the MC-10 dry storage cask to obtain data above each of the 24 fuel bundle positions. The detectors are connected to a pulse-shape discrimination data acquisition system capable of generating separate neutron and gamma-ray spectra for each detector and for each scan position. From the prior single detector Field Test in 2021 and iteration with MCNP modeling, the neutron and gamma-ray data were analyzed in multiple energy regions to identify an analysis method that would provide the strongest and most consistent signature of the asymmetric MC-10 cask fuel loading1 . From both the 2021 Field Test and the current Field Test results, the neutron capture gamma-ray count rate around 2.2 MeV provides the strongest signature of the asymmetric MC-10 cask fuel loading and has qualitative agreement with MCNP calculations. Counting all gamma-rays produces a similar signature. Neutrons emerging from the cask top are moderated and captured by the hydrogen in the polyethylene moderator and scintillator detector, producing a 2.2 MeV gamma ray which is seen in the scintillator gamma-ray spectrum. The count rate in the 2.2 MeV gamma-ray region is ~50 c/s, which is ~1000x higher than the ~0.05 n/s rate in the > 4MeV neutron region, and ~50x greater than the ~1 n/s rate in the neutrons > 500 keV region. Analysis of the 2.2 MeV neutron-capture Compton-scattered gamma-rays produces a statistically significant signature of the INTEC Cask Farm MC-10 asymmetric fuel loading. MCNP simulations indicate that the average neutron energy spectrum offers the potential to detect a large asymmetry from several missing bundles as well as individual missing fuel bundles. Testing this feature will require measurements on a cask with single missing elements.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2023

Optimizing invader suppression to restore native species: Leveraging species traits to overcome collateral damage

Strategies to control ongoing biological invasions are often developed by modelling the invasive species' population and aiming to reduce its abundance. However, if the ultimate objective is to protect and restore native species, focussing solely on the invader may not be optimal because it does not account for (i) species interactions that can cause the invader's impacts to depend nonlinearly on its abundance, (ii) collateral damages to native species incurred due to nonspecific removal methods or (iii) native-invader trait differences. Here, to identify an invader suppression strategy that maximizes average native population size, we applied optimal control theory to a two-species model of a native species threatened by an invasive competitor. We examined trade-offs between iterative physical removals that selectively target invaders and intensifiable chemical control that is nonselective but has higher efficacy. We found that while iterative removals were capable of supporting large native populations when applied continuously, cost could be prohibitively high. In contrast, when favourable native-invader trait differences enabled native species to re-establish more quickly than invaders, intensifiable methods could achieve substantial restoration benefits at lower cost by focussing removal effort into periodic, high-efficacy events. In a metapopulation, removals that rotated among spatial patches were optimal when the native species had higher dispersal, whereas synchronous removals were preferred when native recovery was initiated locally and the invader could disperse. For a case study in Hawaiian streams, we compared how effective two alternative methods of removing invasive live-bearing fishes (poeciliids) might be at restoring the endemic freshwater goby Sicyopterus stimpsoni. We found that rotenone (a piscicidal chemical) offered superior benefits when the control budget was small and efficacy was high, but that electrofishing (use of electricity to manually collect target fish) was better with larger budgets and in many lower-efficacy scenarios. Synthesis and applications. Our findings demonstrate that, by accounting for species interactions and collateral damage, invasive species control strategies can be optimized in light of species traits. Choices about the timing, locations and types of removal events present opportunities to increase the efficiency with which invasive species suppression benefits native species.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Online Optimization for Networked Distributed Energy Resources With Time-Coupling Constraints

This paper proposes a Lyapunov optimization-based online distributed (LOOD) algorithmic framework for active distribution networks (ADNs) with numerous photovoltaic inverters and inverter air conditionings (IACs). In the proposed scheme, ADNs can track an active power setpoint reference at the substation in response to transmission-level requests while concurrently minimizing the social utility loss and ensuring the security of voltages. Conventional distributed optimization methods are rarely feasible to track the optimal solutions in fast variable environments using a fine-grained sampling interval where the underlying optimization problem evolves with the iterations of the algorithms. In contrast, based on the framework of online convex optimization (OCO), the developed approach uses a distributed algebraic update to compute the next round decisions relying on the current feedback of measurements. Notably, the time-coupling constraints of IACs are decoupled for online implementation with Lyapunov optimization technique. An incentive scheme is tailored to coordinate the customer-owned assets in lieu of the direct control from network operators. Optimality and convergency are characterized analytically. Finally, we corroborate the proposed method on a modified version of 33-node test feeder. Benchmark tests show that the proposed method is computationally and economically efficient, and outperforming existing algorithms.

active distribution networks↗
DOE OSTI2020

Data-driven predictive probability density function control of fiber length stochastic distribution shaping in refining process

Pulp is the most important raw material in paper in paper industries, whose Fiber Length Stochastic Distribution (FLSD) shaping directly determines the energy consumption and paper quality of the subsequent papermaking processes. However, the mean and variance are insufficient to describe the output FLSD shaping, which display non-Gaussian distribution properties. Therefore, the traditional control, method based on the mean and variance of fiber length is difficult to control the FLSD shaping effectively. In this paper, a novel data-driven predictive probability density function (PDF) control method is proposed for output FLSD shaping in refining process. Primarily, in order to improve the approximation accuracy of the PDF employing RBF neural network, the parameters (center value and width) of each RBF basis functions are tuned via utilizing iterative learning control (ILC) law, and the corresponding estimations of weights law can be obtained. Secondly, considering that the conventional linear model of weights vector has drawbacks of low accuracy and weak generalization ability, random vector functional link networks (RVFLNs) based data driven nonlinear modelling method is employed to characterize the prediction model between the input variables and weights vector. Finally, in order to reduce the randomness of the output FLSD, a minimum entropy control method under mean constraint is employed to design the predictive PDF controller for the output FLSD shaping with the help of the established nonlinear stochastic distribution model. Both simulations and experiments are given to illustrate the effectiveness and practicability of the proposed method.

Probability debsity function, Fiber length distrib↗
DOE OSTI2021

Prime factorization using quantum variational imaginary time evolution

The road to computing on quantum devices has been accelerated by the promises that come from using Shor’s algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robust error correction schemes. Here we explore a promising, alternative method for prime factorization that uses well-established techniques from variational imaginary time evolution. We create a Hamiltonian whose ground state encodes the solution to the problem and use variational techniques to evolve a state iteratively towards these prime factors. We show that the number of circuits evaluated in each iteration scales as \(O(n^{5}d)\) , where n is the bit-length of the number to be factorized and d is the depth of the circuit. We use a single layer of entangling gates to factorize 36 numbers represented using 7, 8, and 9-qubit Hamiltonians. We also verify the method’s performance by implementing it on the IBMQ Lima hardware to factorize 55, 65, 77 and 91 which are greater than the largest number (21) to have been factorized on IBMQ hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Data-Driven Learning of Nonautonomous Systems

In this work, we present a numerical framework for recovering unknown nonautonomous dynamical systems with time-dependent inputs. To circumvent the difficulty presented by the nonautonomous nature of the system, our method transforms the solution state into piecewise integration of the system over a discrete set of time instances. The time-dependent inputs are then locally parameterized by using a proper model, for example, polynomial regression, in the pieces determined by the time instances. This transforms the original system into a piecewise parametric system that is locally time invariant. We then design a deep neural network structure to learn the local models. Once the network model is constructed, it can be iteratively used over time to conduct global system prediction. We provide theoretical analysis of our algorithm and present a number of numerical examples to demonstrate the effectiveness of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Data-Driven Learning of Non-Autonomous Systems

We present a numerical framework for recovering unknown non-autonomous dynamical systems with time-dependent inputs. To circumvent the difficulty presented by the non-autonomous nature of the system, our method transforms the solution state into piecewise integration of the system over a discrete set of time instances. The time-dependent inputs are then locally parameterized by using a proper model, for example, polynomial regression, in the pieces determined by the time instances. This transforms the original system into a piecewise parametric system that is locally time invariant. We then design a deep neural network structure to learn the local models. Once the network model is constructed, it can be iteratively used over time to conduct global system prediction. We provide theoretical analysis of our algorithm and present a number of numerical examples to demonstrate the effectiveness of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Finite Volume Discretization of the Euler Equations in Pronghorn

Modeling flow and heat transfer in high temperature gas reactors (HTGR) requires the ability to model a wide range of flow speeds from slow (natural convection), to intermediate (forced-flow conditions), to supersonic regimes (depressurization) for a wide range of geometries including the pebble bed, upper and lower plenum, and risers. In previous work, Pronghorn has effectively modeled low-to-medium speed flows in scenarios such as the one described in the two-dimensional PBMR-400 benchmark, using its finite-element-based streamline-upwind Petrov-Galerkin (SUPG) stabilized implementation of the Euler equations. However, limitations of this method become apparent when dealing with more complicated geometries (e.g. imposing slip boundary conditions at nodes belonging to two different boundaries) and when gas speeds are fast enough for shocks and supersonic flow to occur. For these problems, the finite-element-based solver lacks robustness and is plagued by slow iterative convergence or even divergence. In order to address these challenges, the Pronghorn code at INL has been updated with new, modified versions of its original equations. The new Pronghorn models are built on the finite volume method with a Harten-Lax-van Leer-Contact (HLLC) Riemann solver based numerical flux method, which (1) allows imposing slip boundary conditions much more robustly and (2) performs well for a wide range of flow speeds. The finite-volume-based flow solver will form the basis for a robust coarse-mesh thermal-hydraulics capability in Pronghorn.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The Schwarz alternating method for transient solid dynamics

Abstract In our earlier work, we formulated the Schwarz alternating method as a means for concurrent multiscale coupling in finite deformation solid mechanics for quasi‐static problems. Herein, we advance this method for the study of transient dynamic multiscale solid mechanics problems where information is exchanged back and forth between small and large scales. The extension to dynamics relies on the notion of a global time stepper. Within each global time step, the subdomains are coupled by the standard Schwarz iterative process. Remarkably, each subdomain can use its own time step or even its own time integrator to advance its solution in time, provided that they synchronize at each global time step. We study the performance of the Schwarz method on several examples designed for this purpose. Our numerical experiments demonstrate that the method is capable of coupling regions with different mesh resolutions, different element types, and different time integration schemes (e.g., implicit and explicit), all without introducing any artifacts that afflict other coupling methods for transient dynamics. Finally, we apply the dynamic Schwarz alternating method to the simulation of a bolted joint subjected to dynamic loading, as a demonstration of the performance of the method in a realistic scenario.

Mota, Alejandro↗
DOE OSTI2024

Scale-Bridging Optimization Framework for Desalination Integrated Produced Water Networks

In this work, we develop a Pyomo-based non-linear optimization strategy that includes rigorous MVR models. The detailed desalination unit is integrated into the multiperiod produced water network problem using the trust region filter (TRF) method. TRF decomposes the integrated problem into a master problem consisting of the network variables and a simplified surrogate model for the detailed desalination unit. The surrogate is updated using zero and first-order corrections from the optimal solution of the detailed models at every iteration. This framework allows us to co-optimize the design of the desalination units and operating policy for the multiperiod network. A common design is ensured across all periods using global capacity constraints. We validate the solution obtained using the TRF method by solving the full integrated problem for small network instances and show our results on real case studies on produced water networks from the Permian and Appalachian basins. In this work, we describe our TRF formulation, give details on our implementation in Pyomo, and analyze the results obtained by solving the optimization problem using IPOPT. We also present a discussion on the computational efficiency and scaling using the TRF approach against a full-scale integration of the rigorous models within the water network.

Naik, Sakshi↗
DOE OSTI2020

Stochastic AC optimal power flow: A data-driven approach

There is an emerging need for efficient solutions to stochastic AC Optimal Power Flow (AC-OPF) to ensure optimal and reliable grid operations in the presence of increasing demand and generation uncertainty. Herein this paper presents a highly scalable data-driven algorithm for stochastic AC-OPF that has extremely low sample requirement. The novelty behind the algorithm’s performance involves an iterative scenario design approach that merges information regarding constraint violations in the system with data-driven sparse regression. Compared to conventional methods with random scenario sampling, our approach is able to provide feasible operating points for realistic systems with much lower sample requirements. Furthermore, multiple sub-tasks in our approach can be easily paralleled and based on historical data to enhance its performance and application. We demonstrate the computational improvements of our approach through simulations on different test cases in the IEEE PES PGLib-OPF benchmark library.

42 ENGINEERING↗
DOE OSTI2024

A novel conditional generative model for efficient ensemble forecasts of state variables in large-scale geological carbon storage

Integrating monitoring data to efficiently update reservoir pressure and CO 2 plume distribution forecasts presents a significant challenge in geological carbon storage (GCS) applications. Inverse modeling techniques are commonly used to fuse observational data and refine reservoir model parameters, thereby improving state variable forecasts. However, these techniques often rely on linear or Gaussian assumptions, which can limit their effectiveness in accurately predicting state variables. Moreover, simulating large-scale three-dimensional (3D) GCS problems is computationally expensive, making iterative runs in inverse problems prohibitive. To address these challenges, we propose a conditional generative model utilizing the score-based diffusion method for real-time 3D pressure and saturation field distribution predictions. Our approach involves solving the score function with a mini-batch-based Monte Carlo estimator to generate labeled data. This data is subsequently employed to train a fully connected neural network, enabling it to learn the conditional sample generator within a supervised learning framework. This method enables the rapid generation of a large ensemble of predictions, facilitating comprehensive uncertainty quantification of state variables. Here we applied our method to forecast the dynamic 3D distributions of pressure and saturation fields over a 30-year injection period. The statistical assessment with low root mean square error (RMSE) values demonstrates that our method can accurately predict the spatiotemporal distributions of both pressure and saturation fields. Moreover, the developed conditional generative model shows high computational efficiency by generating 100 ensemble forecasts of 3D state variables in less than 10 min. The consistency between ensemble averages and ground truth values further illustrates the model’s capability to capture state variable dynamics during the CO 2 plume injection process. Notably, the ground truth values fall within the ensemble forecasts, indicating that our uncertainty quantification effectively captures variability and potential noise in the observations. Thus, the developed conditional generative model proves to be a more efficient, accurate, and practical tool for GCS applications, facilitating timely risk analysis and informed decision-making.

58 GEOSCIENCES↗
DOE OSTI2024

State Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry

State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space–unitary coupled cluster (LAS–UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. Here, in this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C–C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗