Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical algorithms”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A Lagrangian dual method for two-stage robust optimization with binary uncertainties

This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.

42 ENGINEERING↗
DOE OSTI2023

Quantum error mitigation by Pauli check sandwiching

Abstract We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗
DOE OSTI2024

Lattice Green’s Functions for High-Order Finite Difference Stencils

Lattice Green's Functions (LGFs) are fundamental solutions to discretized linear operators, and as such they are a useful tool for solving discretized elliptic PDEs on domains that are unbounded in one or more directions. The majority of existing numerical solvers that make use of LGFs rely on a second-order discretization and operate on domains with free-space boundary conditions in all directions. Under these conditions, fast expansion methods are available that enable precomputation of 2D or 3D LGFs in linear time, avoiding the need for brute-force multi-dimensional quadrature of numerically unstable integrals. Here we focus on higher-order discretizations of the Laplace operator on domains with more general boundary conditions, by (1) providing an algorithm for fast and accurate evaluation of the LGFs associated with high-order dimension-split centered finite differences on unbounded domains, and (2) deriving closed-form expressions for the LGFs associated with both dimension-split and Mehrstellen discretizations on domains with one unbounded dimension. Through numerical experiments we demonstrate that these techniques provide LGF evaluations with near machine-precision accuracy, and that the resulting LGFs allow for numerically consistent solutions to high-order discretizations of the Poisson's equation on fully or partially unbounded 3D domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Learning compact physics‐aware delayed photocurrent models using dynamic mode decomposition

Abstract Radiation‐induced photocurrent in semiconductor devices can be simulated using complex physics‐based models, which are accurate, but computationally expensive. This presents a challenge for implementing device characteristics in high‐level circuit simulations where it is computationally infeasible to evaluate detailed models for multiple individual circuit elements. In this work we demonstrate a procedure for learning compact delayed photocurrent models that are efficient enough to implement in large‐scale circuit simulations, but remain faithful to the underlying physics. Our approach utilizes dynamic mode decomposition (DMD), a system identification technique for learning reduced‐order discrete‐time dynamical systems from time series data based on singular value decomposition. To obtain physics‐aware device models, we simulate the excess carrier density induced by radiation pulses by solving numerically the ambipolar diffusion equation, then use the simulated internal state as training data for the DMD algorithm. Our results show that the significantly reduced‐order delayed photocurrent models obtained via this method accurately approximate the dynamics of the internal excess carrier density—which can be used to calculate the induced current at the device boundaries—while remaining compact enough to incorporate into larger circuit simulations.

Hanson, Joshua↗
DOE OSTI2022

Physics-informed neural networks (PINNs) for fluid mechanics: a review

Despite the significant progress over the last 50 years in simulating flow problems using numerical discretization of the Navier–Stokes equations (NSE), we still cannot incorporate seamlessly noisy data into existing algorithms, mesh-generation is complex, and we cannot tackle high-dimensional problems governed by parametrized NSE. Moreover, solving inverse flow problems is often prohibitively expensive and requires complex and expensive formulations and new computer codes. Here, we review flow physics-informed learning, integrating seamlessly data and mathematical models, and implement them using physics-informed neural networks (PINNs). Here, we demonstrate the effectiveness of PINNs for inverse problems related to three-dimensional wake flows, supersonic flows, and biomedical flows.

42 ENGINEERING↗
DOE OSTI2022

Online data-enabled predictive control

We develop an online data-enabled predictive (ODeePC) control method for optimal control of unknown systems, building on the recently proposed DeePC (Coulson et al., 2019). Our proposed ODeePC method leverages a primal-dual algorithm with real-time measurement feedback to iteratively compute the corresponding real-time optimal control policy as system conditions change. The proposed ODeePC conceptual-wise resembles standard adaptive system identification and model predictive control (MPC), but it provides a new alternative for the standard methods. ODeePC is enabled by computationally efficient methods that exploit the special structure of the Hankel matrices in the context of DeePC with Fast Fourier Transform (FFT) and primal-dual algorithm We provide theoretical guarantees regarding the asymptotic behavior of ODeePC, and we demonstrate its performance through numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multidisciplinary benchmarks of a conservative spectral solver for the nonlinear Boltzmann equation

The Boltzmann equation describes the evolution of the phase-space probability distribution of classical particles under binary collisions. Approximations to it underlie the basis for several scholarly fields, including aerodynamics and plasma physics. While these approximations are appropriate in their respective domains, they can be violated in niche but diverse applications which require direct numerical solution of the original nonlinear Boltzmann equation. An expanded implementation of the Galerkin–Petrov conservative spectral algorithm is employed to study a wide variety of physical problems. Enabled by distributed precomputation, solutions of the spatially homogeneous Boltzmann equation can be achieved in seconds on modern personal hardware, while spatially-inhomogeneous problems are solvable in minutes. Here, several benchmarks are presented focusing on accuracy compared to both analytic theoretical predictions and other Boltzmann solvers. These benchmarks span several physical domains including weakly ionized plasma, gaseous fluids, and atomic-plasma interaction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Development of simplified model for injection rate prediction of diesel injectors during transient and steady operation

Determining the injection rate of the diesel injector during the transient short injection operations is a critical matter to enhance the combustion process by improving air/fuel mixture formation. In this regard, numerous injection models have been suggested in the literature to predict the injection rate accurately. However, such algorithms have not precisely predicted the rate of injection (ROI) in transient short injection events. In addition, most of those models require many input parameters to characterize hydraulic and mechanical subsystems in the injector, which can make them inconvenient to tune for different injector specifications, in other words not suitable for universal usage. Therefore, our study aims to develop a simple injection model that can predict injection rate precisely in the short and long injection durations considering relatively fewer input parameters. The model traces the pressure variation inside the sac based on the bulk modulus theory to predict nozzle exit velocity, thus the injection rate of the injector. In the algorithm, the bulk modulus of fuel (E) and discharge coefficients of the nozzle hole and needle seat (C d,H and C d,N ) have been considered to vary rather than set constant during the injection process since such flow parameters would have a critical impact on the flow development at the transient stage, thus affecting the injection rate of diesel injectors. Here with this modelling strategy, the accuracy of the new model on ROI prediction was confirmed with acceptable model error for both short and long injection durations by validating against experimental results. To understand the effect of the new model scheme on ROI prediction, ROI results with the new model have been discussed by comparing it with the ROI results predicted with constant flow parameters.

42 ENGINEERING↗
DOE OSTI2024

Optimizing the location and configuration of disaster resilience hubs under transportation and electric power network failures

Natural disasters often result in failures of transportation network components and blackouts that imperil the wellbeing of vulnerable populations. In response to these events, resilience hubs have been proposed as a pre-disaster planning strategy to improve access to critical services. This paper introduces an optimization-based approach to locate and configure electric power-generating resilience hubs considering the possibility of failures in transportation and electric power systems. The model's objective is to identify hub locations and configurations that maximize transportation accessibility to the hubs and maximize the satisfaction of basic energy needs through hub-generated electric power. Besides a budget constraint, the model accounts for limits on the levels of hub energy generation vis-à-vis community energy demands, and on the transportation network distance of communities to hubs. Three heuristics are presented for the proposed planning problem. The first heuristic is a genetic algorithm (GA) with problem-specific solution generation procedures. The other two heuristics implement greedy search techniques. Numerical experiments were conducted, using data from rural Puerto Rico, to illustrate the application of the proposed model and heuristics, and examine their performance. In the numerical experiments, the GA heuristic found better solutions than the greedy heuristics. Additionally, design solutions consisting of spatially dispersed hubs with low energy generation capacity were better than solutions with spatially concentrated high-capacity hubs. Lastly, across a wide range of hub demand scenarios, only a small number of candidate hub locations consistently ranked among the best locations for establishing a hub.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

A Standardized Analysis Process Using Digital Image Correlation to Calculate In Situ Cladding Strain from Modified Burst Tests for Fuel Performance Code Validation

Historical data collection on nuclear fuel cladding materials has focused on generating a statistically significant amount of data to assess the material and its failure behavior. Furthermore, data generated to support material model and failure criteria development were previously posttest evaluations, so a large number of tests was required to gain new understanding. A way to expedite this process is to develop techniques capable of generating large, high-fidelity data sets from a single test with lower uncertainty or quantified uncertainty. One such example of this approach is Oak Ridge National Laboratory’s use of modified burst tests (MBTs) to analyze the mechanical behavior and failure conditions of cladding during a simulated reactivity-initiated accident (RIA). Each test incorporates digital image correlation (DIC) analysis techniques that are used to assess the accumulated strain in situ, as well as eventual cladding failure. This work has been fruitful in defining strain-to-failure conditions for materials like silicon carbide (SiC) fiber–reinforced/SiC matrix composite tubes (SiC/SiC), iron-chromium-aluminum (FeCrAl) alloy tubes, and chromium-coated Zircaloy-4 tubes. However, there are numerous DIC software available, including open-source and proprietary software. The different DIC software use various algorithms to process images and calculate displacement values. Using these different software and algorithms can lead to varying results, and perhaps larger-than-expected uncertainties. In the present study, previously published MBT data encompassing a variety of test conditions were reanalyzed with two different DIC software to assess the variance in the calculated strain results. The data consisted of SiC/SiC, FeCrAl, and chromium-coated Zircaloy-4 tubes. Plots of the calculated strains during the transient revealed good agreement between the two DIC software. The average root-mean-square errors between the two software was 0.20% strain, which is slightly larger than a previously reported error value for these tests. In conclusion, this variance in results is low enough that this analysis method can be used for code validation.

Reactivity-initiated accident↗
DOE OSTI2025

Ground-state-based model reduction with unitary circuits

Here, we present a method to numerically obtain low-energy effective models based on a unitary transformation of the ground state. The algorithm finds a unitary circuit that transforms the ground state of the original model to a projected wavefunction with only the low-energy degrees of freedom. The effective model can then be derived using the unitary transformation encoded in the circuit. We test our method on the one-dimensional and two-dimensional square-lattice Hubbard model at half-filling, and obtain more accurate effective spin models than the standard perturbative approach.

Hubbard model↗
DOE OSTI2024

Pseudospectral particle-in-cell formulation with arbitrary charge and current-density time dependencies for the modeling of relativistic plasmas

This paper introduces a formulation of the particle-in-cell (PIC) method for the modeling of relativistic plasmas, that leverages the ability of the pseudospectral analytical time-domain solver (PSATD) to handle arbitrary time dependencies of the charge and current densities during one PIC cycle (applied to second-order polynomial dependencies here). Here, the formulation is applied to a modified set of Maxwell's equations that was proposed earlier in the context of divergence cleaning, and to recently proposed extensions of the PSATD-PIC algorithm. Detailed analysis and testings revealed that, under some condition, the formulation can expand the range of numerical parameters under which PIC simulations are stable and accurate when modeling relativistic plasmas such as, e.g., plasma-based particle accelerators.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Comparative Analysis of Direct and Indirect Cooling of Wide-Bandgap Power Modules and Performance Enhancement of Jet Impingement-Based Direct Substrate Cooling

With the development of high-power and high-torque machines, requirements for high-power density electronics are increasing. Thermal management of such systems requires high heat extraction. Conventional air cooling based heat sinks and cold plate based liquid cooling have their own benefits for various applications but has limitations for high power density applications. The current study explores a jet impingement based direct substrate cooling system that was implemented for a SiC based direct bonded Cu substrate for various power losses. Numerical comparison between jet impingement cooling and conventional horizontal/indirect cooling (pin fin heat sink and genetic algorithm-optimized heat sink) showed that the area weighted average of the heat transfer coefficient (HTC) is high for both horizontal cooling designs, and the local HTC is higher for jet impingement. Design iterations were undertaken to resolve the bottleneck of this cooling system. Increasing the number of nozzles helped to cover more area at the direct bonded Cu bottom plate, which drops the chip temperature considerably. With a constant flow rate, increasing the number of nozzles would decrease local jet velocity, which reduces the heat extraction by jet impingement. This issue can be addressed by reducing the diameter of nozzle but doing so results in a high pressure drop where the design constraint is 2 psi. A flared nozzle design is proposed, which has a higher spreading angle of the jet that increases the flow coverage and reduces the pressure drop of the coolant loop.

Barua, Himel↗
DOE OSTI2023

Reconstruction of interactions in the ProtoDUNE-SP detector with Pandora

The Pandora Software Development Kit and algorithm libraries provide pattern-recognition logic essential to the reconstruction of particle interactions in liquid argon time projection chamber detectors. Pandora is the primary event reconstruction software used at ProtoDUNE-SP, a prototype for the Deep Underground Neutrino Experiment far detector. ProtoDUNE-SP, located at CERN, is exposed to a charged-particle test beam. This paper gives an overview of the Pandora reconstruction algorithms and how they have been tailored for use at ProtoDUNE-SP. In complex events with numerous cosmic-ray and beam background particles, the simulated reconstruction and identification efficiency for triggered test-beam particles is above 80% for the majority of particle type and beam momentum combinations. Specifically, simulated 1 GeV/c charged pions and protons are correctly reconstructed and identified with efficiencies of 86.1$\pm 0.6$% and 84.1$\pm 0.6$%, respectively. The efficiencies measured for test-beam data are shown to be within 5% of those predicted by the simulation.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Machine Learning-Based Identification of the Interface Regions for Coupling Local and Nonlocal Models

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. However, the coupling process can be challenging, requiring expertise to identify the interface between local and nonlocal regions. Here, this study introduces a machine learning-based approach to automatically detect the regions in which the local and nonlocal models should be used. The method uses loading functions evaluated at grid points to decide the model selection at those points. Training of the networks is based on datasets provided by classes of loading functions for which reference coupling configurations are computed using accurate coupled solutions, where accuracy is measured in terms of the relative error between the solution to the coupling approach and the solution to the nonlocal model. We study two approaches that vary in data structure. The first, the full-domain input data approach, uses the entire load vector and outputs a complete label vector, performing a global classification. The second, a window-based approach, processes loads into windows and addresses the problem as a node-wise classification where each window's central point is classified individually. The classification problems are solved via deep learning algorithms based on convolutional neural networks. The performance of these approaches is studied on one-dimensional numerical examples using F1-scores and accuracy metrics. Notably, the windowing approach achieves an accuracy of 0.96 and an F1-score of 0.97, highlighting its potential to automate coupling processes effectively and enhance computational efficiency in material science applications.

97 MATHEMATICS AND COMPUTING↗