Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computing 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 1,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Electronic Structure Theory Calculations Using Modern Architectures: KNL vs Haswell

The time to solution and parallel efficiency of several commonly used electronic structure methods (Hartree–Fock, density functional theory, second order perturbation theory, resolution of the identity second order perturbation theory, coupled cluster) are evaluated on both the Intel Xeon Haswell and the Intel Xeon Phi Knights Landing (KNL) architectures. The Haswell completes the benchmark calculations with a faster time to solution than the KNL for all molecules and methods tested. While the Haswell exhibits an average speedup of at least 3.5 relative to the KNL for all nonthreaded computations, the KNL has a better parallel efficiency than the Haswell with increasing core counts. The architectures are further tested using a more computationally costly coupled cluster method on a transition state reaction. The Haswell appears to be the best choice to minimize the time to solution, though for very large systems and high levels of theory that require memory intensive processes the superior memory hierarchy and larger on node memory of the KNL can make it a better choice. These results are used to showcase aspects of novel architectures that will increase efficiency for quantum chemistry applications.

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

Computational Advances in Ionic Liquid Applications for Green Chemistry: A Critical Review of Lignin Processing and Machine Learning Approaches

The valorization and dissolution of lignin using ionic liquids (ILs) is critical for developing sustainable biorefineries and a circular bioeconomy. This review aims to critically assess the current state of computational and machine learning methods for understanding and optimizing IL-based lignin dissolution and valorization processes reported since 2022. The paper examines various computational approaches, from quantum chemistry to machine learning, highlighting their strengths, limitations, and recent advances in predicting and optimizing lignin-IL interactions. Key themes include the challenges in accurately modeling lignin’s complex structure, the development of efficient screening methodologies for ionic liquids to enhance lignin dissolution and valorization processes, and the integration of machine learning with quantum calculations. These computational advances will drive progress in IL-based lignin valorization by providing deeper molecular-level insights and facilitating the rapid screening of novel IL-lignin systems.

09 BIOMASS FUELS↗
DOE OSTI2022

A fast matrix-free approach to the high-order control volume finite element method with application to low-Mach flow

Here, a fast matrix-free formulation of the control volume finite element method is presented, requiring much less memory and computational work than previous efforts. The method is implemented and evaluated as a solver for low-Mach flow, including the evaluation of a preconditioning strategy for the pressure Poisson equation. The efficiency and scaling with polynomial order is evaluated on simple turbulent flows of interest, with appropriate solution quality metrics, and compared with a reference node-centered finite volume discretization. For a turbulent channel flow test, we show improvement in computational work for a given accuracy with the high-order scheme. The performance on a GPU accelerated platform is also investigated, with benefit shown for the matrix-free discretization.

42 ENGINEERING↗
DOE OSTI2021

Quantum Solvers for Plane-Wave Hamiltonians: Abridging Virtual Spaces Through the Optimization of Pairwise Correlations

For many-body methods such as MCSCF and CASSCF, in which the number of one-electron orbitals is optimized and independent of the basis set used, there are no problems with using plane-wave basis sets. However, for methods currently used in quantum computing such as select configuration interaction (CI) and coupled cluster (CC) methods, it is necessary to have a virtual space that is able to capture a significant amount of electron-electron correlation in the system. The virtual orbitals in a pseudopotential plane-wave Hartree–Fock calculation, because of Coulomb repulsion, are often scattering states that interact very weakly with the filled orbitals. As a result, very little correlation energy is captured from them. The use of virtual spaces derived from the one-electron operators has also been tried, and while some correlations are captured, the amount is quite low. To overcome these limitations, we have been developing new classes of algorithms to define virtual spaces by optimizing orbitals from small pairwise CI Hamiltonians, which we term as correlation optimized virtual orbitals with the abbreviation COVOs. With these procedures, we have been able to derive virtual spaces, containing only a few orbitals, which are able to capture a significant amount of correlation. The focus in this manuscript is on using these derived basis sets to target full CI (FCI) quality results for H2 on near-term quantum computers. However, the initial results for this approach were promising. We were able to obtain good agreement with FCI/cc-pVTZ results for this system with just 4 virtual orbitals, using both FCI and quantum simulations. The quality of the results using COVOs suggests that it may be possible to use them in other many-body approaches, including coupled cluster and Møller–Plesset perturbation theories, and open up the door to many-body calculations for pseudopotential plane-wave basis set methods.

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

A Scalable Approach to Minimize Charging Costs for Electric Bus Fleets

Incorporating battery electric buses into bus fleets faces three primary challenges: a BEB’s extended refuel time, the cost of charging, both by the consumer and the power provider, and large compute demands for planning methods. When BEBs charge, the additional demands on the grid may exceed hardware limitations, so power providers divide a consumer’s energy needs into separate meters even though doing so is expensive for both power providers and consumers. Prior work has developed a number of strategies for computing charge schedules for bus fleets; however, prior work has not worked to reduce costs by aggregating meters. Additionally, because many works use mixed integer linear programs, their compute needs make planning for commercial-sized bus fleets intractable. This work presents a multi-program approach to computing charge plans for electric bus fleets. The proposed method solves a series of subproblems where the solution to the charge problem becomes more refined with each problem, moving closer to the optimal schedule. The results demonstrate how runtimes are reduced by using intermediate subproblems to refine the bus charge solution so that the proposed method can be applied to large bus fleets of 100+ buses. Not only will we demonstrate that runtimes scale linearly with the number of buses but we will also show how the proposed method scales to large bus fleets of over 100 buses while managing the monthly cost of energy.

Mortensen, Daniel (ORCID:0000000276494452)↗
DOE OSTI2024

Data-driven discovery of dynamics from time-resolved coherent scattering

Coherent X-ray scattering (CXS) techniques are capable of interrogating dynamics of nano- to mesoscale materials systems at time scales spanning several orders of magnitude. However, obtaining accurate theoretical descriptions of complex dynamics is often limited by one or more factors—the ability to visualize dynamics in real space, computational cost of high-fidelity simulations, and effectiveness of approximate or phenomenological models. In this work, we develop a data-driven framework to uncover mechanistic models of dynamics directly from time-resolved CXS measurements without solving the phase reconstruction problem for the entire time series of diffraction patterns. Our approach uses neural differential equations to parameterize unknown real-space dynamics and implements a computational scattering forward model to relate real-space predictions to reciprocal-space observations. This method is shown to recover the dynamics of several computational model systems under various simulated conditions of measurement resolution and noise. Moreover, the trained model enables estimation of long-term dynamics well beyond the maximum observation time, which can be used to inform and refine experimental parameters in practice. Finally, we demonstrate an experimental proof-of-concept by applying our framework to recover the probe trajectory from a ptychographic scan. Our proposed framework bridges the wide existing gap between approximate models and complex data.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Landau discriminants

Scattering amplitudes in quantum field theories have intricate analytic properties as functions of the energies and momenta of the scattered particles. In perturbation theory, their singularities are governed by a set of nonlinear polynomial equations, known as Landau equations, for each individual Feynman diagram. The singularity locus of the associated Feynman integral is made precise with the notion of the Landau discriminant, which characterizes when the Landau equations admit a solution. In order to compute this discriminant, we present approaches from classical elimination theory, as well as a numerical algorithm based on homotopy continuation. These methods allow us to compute Landau discriminants of various Feynman diagrams up to 3 loops, which were previously out of reach. For instance, the Landau discriminant of the envelope diagram is a reducible surface of degree 45 in the three-dimensional space of kinematic invariants. We investigate geometric properties of the Landau discriminant, such as irreducibility, dimension and degree. In particular, we find simple examples in which the Landau discriminant has codimension greater than one. Furthermore, we describe a numerical procedure for determining which parts of the Landau discriminant lie in the physical regions. In order to study degenerate limits of Landau equations and bounds on the degree of the Landau discriminant, we introduce Landau polytopes and study their facet structure. Finally, we provide an efficient numerical algorithm for the computation of the number of master integrals based on the connection to algebraic statistics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A Diffusion‐Based Uncertainty Quantification Method to Advance E3SM Land Model Calibration

Abstract Calibrating land surface models and accurately quantifying their uncertainty are crucial for improving the reliability of simulations of complex environmental processes. This, in turn, advances our predictive understanding of ecosystems and supports climate‐resilient decision‐making. Traditional calibration methods, however, face challenges of high computational costs and difficulties in accurately quantifying parameter uncertainties. To address these issues, we develop a diffusion‐based uncertainty quantification (DBUQ) method. Unlike conventional generative diffusion methods, which are computationally expensive and memory‐intensive, DBUQ innovates by formulating a parameterized generative model and approximates this model through supervised learning, which enables quick generation of parameter posterior samples to quantify its uncertainty. DBUQ is effective, efficient, and general‐purpose, making it suitable for site‐specific ecosystem model calibration and broadly applicable for parameter uncertainty quantification across various earth system models. In this study, we applied DBUQ to calibrate the Energy Exascale Earth System Model land model at the Missouri Ozark AmeriFlux forest site. Results indicated that DBUQ produced accurate parameter posterior distributions similar to those from Markov Chain Monte Carlo sampling but with 30 times less computing time. This significant improvement in efficiency suggests that DBUQ can enable rapid, site‐level model calibration at a global scale, enhancing our predictive understanding of climate impacts on terrestrial ecosystems.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Annular Flow Simulation Supported by Iterative In-Memory Mesh Adaptation

Various flow regimes exist in a boiling water reactor (BWR) as the steam quality increases in the uprising coolant flow, from bubbly flow, slug/churn flow, to annular flow. The annular flow is characterized by the presence of a fast-moving gas core and the surrounding liquid film flowing on the conduit wall. Additionally, entrained droplets can be observed in the gas core with ingested bubbles in the liquid film. The dynamics occurring on the wavy interface between the liquid film and gas core plays a crucial role in affecting the heat transfer rate and pressure drop within the BWR core. However, a fundamental understanding of annular flow is still lacking, partly due to the difficulty in obtaining detailed local data in annular flow experiments. In the current study, a novel simulation framework is developed for the annular flow by coupling a computational fluid dynamics flow solver with state-of-the-art meshing software. The gas-liquid interface is tracked with the level set method. Based on the computed flow solutions, the computational mesh is dynamically adapted in memory to meet the local mesh resolution requirement. This iterative simulation-adaptation framework can ensure the fine mesh resolution across the interface, which not only helps mitigate the mass conservation degradation known to level set methods but also improves the representation of dramatic interface topological changes such as wave breaking and droplet entrainment. The present investigation will shed light onto the complex interfacial processes involved in annular flow and generate much needed simulation data for annular flow modeling.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Reactive Flows in Porous Media: Challenges in Theoretical and Numerical Methods

We review theoretical and computational research, primarily from the past 10 years, addressing the flow of reactive fluids in porous media. The focus is on systems where chemical reactions at the solid–fluid interface cause dissolution of the surrounding porous matrix, creating nonlinear feedback mechanisms that can often lead to greatly enhanced permeability. Here, we discuss insights into the evolution of geological forms that can be inferred from these feedback mechanisms, as well as some geotechnical applications such as enhanced oil recovery, hydraulic fracturing, and carbon sequestration. Until recently, most practical applications of reactive transport have been based on Darcy-scale modeling, where averaged equations for the flow and reactant transport are solved. We summarize the successes and limitations of volume averaging, which leads to Darcy-scale equations, as an introduction to pore-scale modeling. Pore-scale modeling is computationally intensive but offers new insights as well as tests of averaging theories and pore-network models. We include recent research devoted to validation of pore-scale simulations, particularly the use of visual observations from microfluidic experiments.

wormhole formation↗
DOE OSTI2022

Multi-scan computed tomography defect detectability

Systems and methods for representing internal defects of an object to determine defect detectability using a multi-scan computed tomography (CT) approach are disclosed. A defect-free object may be scanned using a CT machine. In one or more separate scans, phantom defects may be imaged and the resulting projections combined and reconstructed to represent internal defects. The air-normalized intensities of the object and the phantom defect may be used to represent voids and inclusions. Subtraction of materials may be represented by the quotient of the air-normalized intensities thereof, and the addition of materials may be represented by the product of the air-normalized intensities thereof. A void may be represented by subtracting a phantom defect scan from the object scan. An inclusion may be represented by creating a void, scanning an additional phantom defect, and adding the additional phantom defect in the volume created by the void.

Schiefelbein, Bryan E.↗
DOE OSTI2023

An Edge Alignment-Based Orientation Selection Method for Neutron Tomography

Neutron computed tomography (nCT) is a 3D char-acterization technique used to image the internal morphology or chemical composition of samples in biology and materials sciences. A typical workflow involves placing the sample in the path of a neutron beam, acquiring projection data at a predefined set of orientations, and processing the resulting data using an analytic reconstruction algorithm. Typical nCT scans require hours to days to complete and are then processed using conventional filtered back-projection (FBP), which performs poorly with sparse views or noisy data. Hence, the main methods in order to reduce overall acquisition time are the use of an improved sampling strategy combined with the use of advanced reconstruction methods such as model-based iterative reconstruction (MBIR). In this paper, we propose an adaptive orientation selection method in which an MBIR reconstruction on previously-acquired measurements is used to define an objective function on orientations that balances a data-fitting term promoting edge alignment and a regularization term promoting orientation diversity. Using simulated and experimental data, we demonstrate that our method produces high-quality reconstructions using significantly fewer total measurements than the conventional approach.

Yang, Diyu↗
DOE OSTI2020

Locally adaptive activation functions with slope recovery for deep and physics-informed neural networks

Here we propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each layer (layer-wise) and for every neuron (neuron-wise) separately, and then optimizing it using a variant of stochastic gradient descent algorithm. In order to further increase the training speed, an activation slope-based slope recovery term is added in the loss function, which further accelerates convergence, thereby reducing the training cost. On the theoretical side, we prove that in the proposed method, the gradient descent algorithms are not attracted to sub-optimal critical points or local minima under practical conditions on the initialization and learning rate, and that the gradient dynamics of the proposed method is not achievable by base methods with any (adaptive) learning rates. We further show that the adaptive activation methods accelerate the convergence by implicitly multiplying conditioning matrices to the gradient of the base method without any explicit computation of the conditioning matrix and the matrix–vector product. The different adaptive activation functions are shown to induce different implicit conditioning matrices. Furthermore, the proposed methods with the slope recovery are shown to accelerate the training process.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multiscale computational understanding and growth of 2D materials: a review

Abstract The successful discovery and isolation of graphene in 2004, and the subsequent synthesis of layered semiconductors and heterostructures beyond graphene have led to the exploding field of two-dimensional (2D) materials that explore their growth, new atomic-scale physics, and potential device applications. This review aims to provide an overview of theoretical, computational, and machine learning methods and tools at multiple length and time scales, and discuss how they can be utilized to assist/guide the design and synthesis of 2D materials beyond graphene. We focus on three methods at different length and time scales as follows: (i) nanoscale atomistic simulations including density functional theory (DFT) calculations and molecular dynamics simulations employing empirical and reactive interatomic potentials; (ii) mesoscale methods such as phase-field method; and (iii) macroscale continuum approaches by coupling thermal and chemical transport equations. We discuss how machine learning can be combined with computation and experiments to understand the correlations between structures and properties of 2D materials, and to guide the discovery of new 2D materials. We will also provide an outlook for the applications of computational approaches to 2D materials synthesis and growth in general.

Momeni, Kasra↗
DOE OSTI2020

Non-Intrusive Appliance Identification with Appliance-Specific Networks

The problem of noninstrusive load monitoring (NILM) is usually formulated as a single-channel blind source separation task, whose successful solution enable fast and convenient load identification and energy disaggregation. When applied at test time, NILM algorithms aim to identify the operating characteristics of individual appliances from an aggregate power measurement of the entire house. Recent advances in deep learning gave rise to many methods that mostly focus on learning a direct mapping from aggregate measurement to individual appliance power. However, these methods are not only computationally expensive, but they often suffer from overfitting and do not generalize very well. In this article, we propose a novel NILM method that leverages advances in statistical learning that have not been properly applied in this domain before. The proposed method consists of three stages: first, a Bayesian nonparametric learning-based approach for appliance state extraction; second, synthetic minority oversampling technique for data augmentation and mitigating the heavy imbalance in switching events; and third, appliance-specific lightweight long short-term memory networks for status classification for each appliance. Here, we adopt a “differential” input (the difference before and after the switching event) to reduce the complexity of network training and make the proposed method robust to multiappliance switching events. Experiments are conducted to demonstrate the effectiveness of the proposed method, achieving superior performance when compared to recent methods. An ablation study is conducted to demonstrate the effectiveness of each module of our method. Finally, we investigate the quality of generated synthetic samples.

42 ENGINEERING↗
DOE OSTI2021

Power Grid Reliability Estimation via Adaptive Importance Sampling

Electricity production currently generates approximately 25% of greenhouse gas emissions in the USA. Thus, increasing the amount of renewable energy is a key step to carbon neutrality. However, integrating a large amount of fluctuating renewable generation is a significant challenge for power grid operating and planning. Grid reliability, i.e., an ability to meet operational constraints under power fluctuations, is probably the most important of them. In this letter, we propose computationally efficient and accurate methods to estimate the probability of line overflow, i.e., reliability constraints violation, under a known distribution of renewable energy generation. To this end, we investigate an importance sampling approach, a flexible extension of Monte-Carlo methods, which adaptively changes the sampling distribution to generate more samples near the reliability boundary. The approach allows to estimate overload probability in real-time based only on a few dozens of random samples, compared to thousands required by the plain Monte-Carlo. Our study focuses on high voltage direct current power transmission grids with linear reliability constraints on power injections and line currents. Herein, we propose a novel theoretically justified physics-informed adaptive importance sampling algorithm and compare its performance to state-of-the-art methods on multiple IEEE power grid test cases.

power system faults↗
DOE OSTI2022

Computational Response Theory for Dynamics

Quantifying the sensitivity - how a quantity of interest (QoI) varies with respect to a parameter – and response – the representation of a QoI as a function of a parameter - of a computer model of a parametric dynamical system is an important and challenging problem. Traditional methods fail in this context since sensitive dependence on initial conditions implies that the sensitivity and response of a QoI may be ill-conditioned or not well-defined. If a chaotic model has an ergodic attractor, then ergodic averages of QoIs are well-defined quantities and their sensitivity can be used to characterize model sensitivity. The response theorem gives sufficient conditions such that the local forward sensitivity – the derivative with respect to a given parameter - of an ergodic average of a QoI is well-defined. We describe a method based on ergodic and response theory for computing the sensitivity and response of a given QoI with respect to a given parameter in a chaotic model with an ergodic and hyperbolic attractor. This method does not require computation of ensembles of the model with perturbed parameter values. The method is demonstrated and some of the computations are validated on the Lorenz 63 and Lorenz 96 models.

97 MATHEMATICS AND COMPUTING↗