Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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

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

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

Hermes-3: Multi-component plasma simulations with BOUT++

A new open source tool for fluid simulation of multi-component plasmas is presented, based on a flexible software design that is applicable to scientific simulations in a wide range of fields. Hermes-3 is built on plasma simulation framework BOUT++, consolidating earlier SD1D and Hermes models into a single code that can be configured at run-time to solve plasma models in 1D, 2D or 3D, either for transport (steady-state) or turbulent (time-evolving) problems, with an arbitrary number of ion and neutral species. Here, we describe the improved numerical algorithms and software design that have been implemented in Hermes-3. To demonstrate the capabilities of this tool, applications relevant to the boundary of tokamak plasmas are presented: 1D simulations of diveror plasmas evolving equations for all charge states of neon and deuterium; 2D transport simulations of tokamak equilibria in single-null X-point geometry with plasma ion and neutral atom species; and simulations of the time-dependent propagation of plasma filaments (blobs). Hermes-3 is publicly available on Github under the GPL-3 open source license. The repository includes documentation and a suite of unit, integrated and convergence tests.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Time-dependent phenomena in correlated materials

Understanding time-dependent processes and light-matter interaction in strongly correlated materials, and the interplay between electronic, orbital, vibrational, and spin degrees of freedom, is a cornerstone of condensed matter. These mechanisms can be proven by measuring the response of the systems to time-dependent perturbations. The corresponding time scales are dictated by the way light couples to the different excitations, and how these excitations exchange energy and momentum. Our research advances our understanding of these processes, and the interpretation of different equilibrium and time-resolved spectroscopies. Our project encompasses two main themes: (i) developing and refining computational techniques to study non-equilibrium spectroscopies including non-perturbative effects and (ii) applications to non-equilibrium phenomena. We have developed a new computational approach that works directly in the time domain: by including all the degrees of freedom involved in the scattering process (e.g. electrons, photons, neutrons), we solve the time dependent problem: a faithful numerical simulation of the experiment. By measuring the energy and momentum of the outgoing particles, we can extract information about the energy and momentum absorbed by the system. Prior to our work, people attempting to model and calculate non-equilibrium spectral functions relied on a description of the scattering cross section based on a formulation in the frequency domain, a treatment that is extremely cumbersome and complex. Our technique works in and out of equilibrium and can reproduce spectra by several spectroscopic techniques, such as time-resolved photoemission, neutron scattering, Raman, X-ray spectroscopies (RIXS, Auger, XAS, XMCD), and, by not relying on analytical approximations, yields results that reveal novel overlooked transient mechanisms. These tools provide sorely needed intuition for understanding the phenomenology of strongly correlated materials and will help experimentalists in identifying signatures of relevant excitations in pump-probe experiments, such as those conducted in DOE supported facilities.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

A Scalable Space-Time Domain Decomposition Approach for Solving Large Scale Nonlinear Regularized Inverse Ill Posed Problems in 4D Variational Data Assimilation

We address the development of innovative algorithms designed to solve the strong-constraint Four Dimensional Variational Data Assimilation (4DVar DA) problems in large scale applications. We present a space-time decomposition approach which employs the whole domain decomposition, i.e. both along the spacial and temporal direction in the overlapping case, and the partitioning of both the solution and the operator. Starting from the global functional defined on the entire domain, we get to a sort of regularized local functionals on the set of sub domains providing the order reduction of both the predictive and the Data Assimilation models. The algorithm convergence is developed. Performance in terms of reduction of time complexity and algorithmic scalability is discussed on the Shallow Water Equations on the sphere. The number of state variables in the model, the number of observations in an assimilation cycle, as well as numerical parameters as the discretization step in time and in space domain are defined on the basis of discretization grid used by data available at repository Ocean Synthesis/Reanalysis Directory of Hamburg University.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Exploring the working range of automated standard dilution analysis of nutrient elements in foods by inductively coupled plasma optical emission spectrometry

Inductively coupled plasma optical emission spectrometry (ICP-OES) is an important tool for measuring nutrient elements in food. ICP-OES methods typically determine analytical concentrations using external standard calibration but can be susceptible to matrix effects. The method of standard additions does not suffer from matrix effects but is time consuming and labor intensive. Automated standard dilution analysis (SDA) allows for online matrix matched calibration without preparing individual standard additions for each sample matrix. This approach may solve both time and matrix issues and has been described in the literature as an attractive alternative to standard additions. The working range of the method for nutrient elements, however, is an understudied feature of SDA that may be a potential drawback to routine analysis of foods. We evaluated automated SDA performance through the analysis of 10 reference materials and four fortified (i.e., spiked) foods spanning the AOAC food triangle. We evaluated the working range, accuracy, and precision for analyses of nutrient elements in foods. Accepted accuracy (80–120% recovery) was achieved for 10 nutrient elements, Ca, Cu, Fe, K, Mg, Mn, Na, P, S, and Zn, when the analytical solution concentration to standard concentration ratio was less than 10. This equates to a working range for each element spanning at least two orders of magnitude. Removing outliers, Z scores (n = 95) ranged from –1.8 to 0.88, and the average recovery (n = 85) from fortification experiments was 97 ± 12% (2σ). Therefore, automated SDA applied to ICP-OES may be used for nutrient elemental analyses in samples with difficult matrices such as foods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗
DOE OSTI2023

Validation of time-dependent shift using the pulsed sphere benchmarks

The detailed behavior of neutrons in a rapidly changing time-dependent physical system is a challenging computational physics problem, particularly when using Monte Carlo methods on heterogeneous high-performance computing architectures. A small number of algorithms and code implementations have been shown to be performant for time-independent (fixed source and k-eigenvalue) Monte Carlo, and there are existing simulation tools that successfully solve the time-dependent Monte Carlo problem on smaller computing platforms. To bridge this gap, a time-dependent version of ORNL’s Shift code has been recently developed. Shift’s history-based algorithm on CPUs, and its event-based algorithm on GPUs, have both been observed to scale well to very large numbers of processors, which motivated the extension of this code to solve time-dependent problems. The validation of this new capability requires a comparison with time-dependent neutron experiments. Lawrence Livermore National Laboratory’s (LLNL) pulsed sphere benchmark experiments were simulated in Shift to validate both the time-independent as well as new time-dependent features recently incorporated into Shift. A suite of pulsed-sphere models was simulated using Shift and compared to the available experimental data and simulations with MCNP. Overall results indicate that Shift accurately simulates the pulsed sphere benchmarks, and that the new time-dependent modifications of Shift are working as intended. Validated exascale neutron transport codes are essential for a wide variety of future multiphysics applications.

Palmer, Camille J.↗
DOE OSTI2022

Fusion Fuel Cycle Inventory Reduction Studies Using a Processing-Time–Based Discrete-Time Interval Model

Developing a Fusion Pilot Plant (FPP) design that minimizes risks due to tritium in-process inventory (IPI) is an important concern for the operation of commercial devices. This becomes even more of concern since an FPP will be breeding more tritium than is burned in the reactor for sustainability. The IPI is the tritium moving through the system that is not in the storage and delivery subsystem. Here a process model that solves time-dependent differential equations based on processing times was used to investigate the reduction of the IPI of a potential fuel cycle design. The impact of new and more efficient technologies such as direct internal recycling (DIR), metal foil pumps, continuous pumping, improved isotope separation, and hydrogen separating continuous pumps on IPI was investigated by adjusting subsystem processing times and material flow streams. It was shown that any of the insertions of DIR studied in this paper caused a reduction in the total IPI of the system and proved to be the optimal way to reduce the IPI in the system. Fuel cycle modifications near the torus, such as a coupled DIR and improved pumping systems, produced the largest reductions in tritium inventory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Advances in ArborX to support exascale applications

ArborX is a performance portable geometric search library developed as part of the Exascale Computing Project (ECP). In this paper, we explore a collaboration between ArborX and a cosmological simulation code HACC. Large cosmological simulations on exascale platforms encounter a bottleneck due to the in-situ analysis requirements of halo finding, a problem of identifying dense clusters of dark matter (halos). This problem is solved by using a density-based DBSCAN clustering algorithm. With each MPI rank handling hundreds of millions of particles, it is imperative for the DBSCAN implementation to be efficient. In addition, the requirement to support exascale supercomputers from different vendors necessitates performance portability of the algorithm. We describe how this challenge problem guided ArborX development, and enhanced the performance and the scope of the library. We explore the improvements in the basic algorithms for the underlying search index to improve the performance, and describe several implementations of DBSCAN in ArborX. Further, we report the history of the changes in ArborX and their effect on the time to solve a representative benchmark problem, as well as demonstrate the real world impact on production end-to-end cosmology simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗
DOE OSTI2024

The gravity extension for MCNP 6.2

Standard MCNP particle tracking takes place along straight-line trajectories from interaction point to interaction point. There is a feature within MCNP that is planned for deprecation that provides surface boundary conditions for approximating gravity for planetary cases, but this feature is not applicable to a cold neutron beam. A new extension has been developed to track particles along parabolic trajectories with a constant acceleration. MCNP contains 1st and 2nd-order surfaces as well as a special case of 4th-order surfaces for simple tori, and the intersection of parabolic trajectories with these surfaces becomes 2nd, 4th, and 8th-order equations in time, respectively. Solving these equations utilizes a fast algorithm for finding the roots of polynomials. Finally, the theory, MCNP input card, and examples of using this new feature will be discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Optimizing Individualized Treatment Planning for Parkinson’s Disease Using Deep Reinforcement Learning

More than one million people currently live with Parkinson's Disease (PD) in the U.S. alone. Medications, such as levodopa, can help manage PD symptoms. However, medication treatment planning is generally based on patient history and limited interaction between physicians and patients during office visits. This limits the extent of benefit that may be derived from the treatment as disease/patient characteristics are generally non-stationary. Wearable sensors that provide continuous monitoring of various symptoms, such as bradykinesia and dyskinesia, can enhance symptom management. However, using such data to overhaul the current static medication treatment planning approach and prescribe personalized medication timing and dosage that accounts for patient/care-giver/physician feedback/preferences remains an open question. We develop a model to prescribe timing and dosage of medications, given the motor fluctuation data collected using wearable sensors in real-time. We solve the resulting model using deep reinforcement learning (DRL). The prescribed policy determines the optimal treatment plan that minimizes patient's symptoms. Our results show that the model-prescribed policy outperforms the static a priori treatment plan in improving patients' symptoms, providing a proof-of-concept that DRL can augment medical decision making for treatment planning of chronic disease patients.

Watts, Jeremy↗
DOE OSTI2023

DT-HYDRO

The software solves the time dependent, one dimensional (1D) coupled mass and momentum balance equations governing the elastic flow of water through the penstock, turbine and draft tube in a hydroelectric facility using a high order finite volume based method. The numerical method is based on the Kurganov-Tadmor central method paired with the Monotonic Upstream-centered Scheme for Conservation Laws (MUSCL). This solution method accurately resolves the fast transient behavior of the flow, including water hammer. Additionally, the software estimates the full 3D flow field within the turbine chamber in real time, a feat that is made possible by leveraging pre-computed CFD results by utilizing a reduced order modeling method based on an efficient randomized singular value decomposition (SVD) driven proper orthogonal decomposition (POD) with POD-mode weight regression. The reduced order model of the 3D flow is directly coupled to the 1D elastic flow model so the entire flow field through the penstock and turbine system is resolved quickly and with high fidelity.

Gurecky, William [Oak Ridge National Laboratory (O↗
DOE OSTI2023

Superior discretizations and AMG solvers for extremely anisotropic diffusion via hyperbolic operators [Slides]

Diffusion in magnetic confinement fusion is extremely anisotropic in the direction of field lines. Rewrote diffusion system based on directional gradients, apply discretization and solver techniques developed for advection. Orders of magnitude decrease in error and solve wallclock time vs. traditional methods. The next steps include: (1) incorporate into larger MHD simulations, (2) better solvers for closed field lines or mixed regimes, and (3) possibly other extremely anisotropic equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Learning to Branch with Interpretable Machine Learning Models

This presentation describes an algorithm for applying machine learning to branching to speed up the solution of integer optimization problems. These problems are challenging and solved multiple times a day by power systems operators. We show that our approach speeds up a widely used open-source optimization solver.

Bayramoglu, Selin↗
DOE OSTI2020

Method for active sensor signal optimization

A system and method for optimizing a fiber optic sensor by properly clocking or rotationally orienting a window with a fiber optic focuser. This method may include shining light through the focuser into the window and receiving with a reflectometer a first reflection from a first surface of the window and a second reflection from a second surface of the window. Next, the method may include calculating a delta of intensities between the first and second reflections, and then rotating an orientation of the window to a next rotational orientation. The steps of rotating the orientation of the window, receiving reflections, and calculating their delta may be repeated any plurality of times to solve for a plurality of deltas. Then, the method may include the steps of determining which one of the deltas is the largest and fixing the window to the focuser at a rotational orientation associated therewith.

42 ENGINEERING↗