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,585 records · Page 88
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Method and system for reducing metadata overhead in a two-tier storage architecture

Example embodiments of the present invention relate to a method, a system, and a computer program product for maintaining dynamically loadable namespaces. The method includes presenting, to an application, a file system having a global single namespace (SN) comprising a plurality of dynamically-loadable namespaces (DLNs) maintained in a capacity tier (CT) of object storage of a storage system. In response to a job submitted by the application, dynamically loading a first dynamically-loadable namespace, including the metadata only for the first dynamically-loadable namespace, associated with the job from the capacity tier of object storage into a fast tier (FT) of storage of the storage system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Implicit Multirate GARK Methods

This article considers multirate generalized-structure additively partitioned Runge–Kutta methods for solving stiff systems of ordinary differential equations with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate coupling strategies, problems for assessing linear stability, and techniques to efficiently implement Newton iterations for stage equations. Unlike much of the existing multirate stability analysis which is limited in scope to particular methods, we present general statements on stability and describe fundamental limitations for certain types of multirate schemes. New implicit multirate methods up to fourth order are derived, and their accuracy and efficiency properties are verified with numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A greedy Galerkin method to efficiently select sensors for linear dynamical systems

A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Energy Exascale Computational Fluid Dynamics Simulations With the Spectral Element Method

Development and application of the open-source GPU-based fluid-thermal simulation code, NekRS, are described. Time advancement is based on an efficient kth-order accurate timesplit formulation coupled with scalable iterative solvers. Spatial discretization is based on the high-order spectral element method (SEM), which affords the use of fast, low-memory, matrix-free operator evaluation. Further, recent developments include support for nonconforming meshes using overset grids and for GPU-based Lagrangian particle tracking. Results of large-eddy simulations of atmospheric boundary layers for wind-energy applications as well as extensive nuclear energy applications are presented.

42 ENGINEERING↗
DOE OSTI2020

Seismology in the Cloud: A New Streaming Workflow

Data-intensive research in seismology is experiencing a recent boom, driven in part by large volumes of available data and advances in the growing field of data science. However, there are significant barriers to processing large data volumes, such as long retrieval times from data repositories, complex data management, and limited computational resources. New tools and platforms have reduced the barriers to entry for scientific cluster computing, including the maturation of the commercial cloud as an accessible instrument for research. Here, we build a customized research cluster in the cloud to test a new workflow for large-scale seismic analysis, in which data are processed as a stream (retrieved on-the-fly and acted upon without storing), with data from the Incorporated Research Institutions for Seismology Data Management Center. We use this workflow to deploy a spectral peak detection algorithm over 5.6 TB of compressed continuous seismic data from 2074 stations of the USArray Transportable Array EarthScope network. Using a 50-node cluster in the cloud, we completed the noise survey in 80 hr, with an average data throughput of 1.7 GB per minute. By varying cluster sizes, we find the scaling of our analysis to be sublinear, due to a combination of algorithmic limitations and data center response times. The cloud-based streaming workflow represents an order-of-magnitude increase in acquisition and processing speed compared to a traditional download-store-process workflow, and offers the additional benefits of employing a flexible, accessible, and widely used computing architecture. It is limited, however, due to its reliance on Internet transfer speeds and data center service capacity, and may not work well for repeated analyses or those for which even higher data throughputs are needed. These research applications will require a new class of cloud-native approaches in which both data and analysis are in the cloud.

58 GEOSCIENCES↗
DOE OSTI2022

Machine Reading at Scale: A Search Engine for Scientific and Academic Research

The Internet, much like our universe, is ever-expanding. Information, in the most varied formats, is continuously added to the point of information overload. Consequently, the ability to navigate this ocean of data is crucial in our day-to-day lives, with familiar tools such as search engines carving a path through this unknown. In the research world, articles on a myriad of topics with distinct complexity levels are published daily, requiring specialized tools to facilitate the access and assessment of the information within. Recent endeavors in artificial intelligence, and in natural language processing in particular, can be seen as potential solutions for breaking information overload and provide enhanced search mechanisms by means of advanced algorithms. As the advent of transformer-based language models contributed to a more comprehensive analysis of both text-encoded intents and true document semantic meaning, there is simultaneously a need for additional computational resources. Information retrieval methods can act as low-complexity, yet reliable, filters to feed heavier algorithms, thus reducing computational requirements substantially. In this work, a new search engine is proposed, addressing machine reading at scale in the context of scientific and academic research. It combines state-of-the-art algorithms for information retrieval and reading comprehension tasks to extract meaningful answers from a corpus of scientific documents. The solution is then tested on two current and relevant topics, cybersecurity and energy, proving that the system is able to perform under distinct knowledge domains while achieving competent performance.

Sousa, Norberto (ORCID:0000000329194817)↗
DOE OSTI2023

MFiX: Fractional-Step Method Implementation

A comprehensive, multiphase computational fluid dynamics (CFD) simulation solves several coupled transport equations including continuity, momentum, species, and energy. Chemical reactions further couple these equations through heats of reaction and rates of formation of products and rates of destruction of reactants. A fractional-step method separates changes attributed to chemical reactions from transport phenomena like convection and diffusion. When the governing equations are split into the transport and reacting components, efficient and independent methodologies can be exploited to solve the different systems. Specifically, discretization of field variable transport equations results in large, sparse matrices which are loosely coupled. These systems are solved in succession using iterative techniques that take advantage of the matrix structure. In contrast, chemical reactions tightly couple field variables locally within the domain (e.g., within a single computational cell) resulting in low dimensional but dense, nonlinear systems that are better solved using direct integration techniques.

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

Spin–spin interactions in defects in solids from mixed all-electron and pseudopotential first-principles calculations

Abstract Understanding the quantum dynamics of spin defects and their coherence properties requires an accurate modeling of spin-spin interaction in solids and molecules, for example by using spin Hamiltonians with parameters obtained from first principles calculations. We present a real-space approach based on density functional theory for the calculation of spin-Hamiltonian parameters, where only selected atoms are treated at the all-electron level, while the rest of the system is described with the pseudopotential approximation. Our approach permits calculations for systems containing more than 1000 atoms, as demonstrated for defects in diamond and silicon carbide. We show that only a small number of atoms surrounding the defect needs to be treated at the all-electron level, in order to obtain an overall all-electron accuracy for hyperfine and zero-field splitting tensors. We also present results for coherence times, computed with the cluster correlation expansion method, highlighting the importance of accurate spin-Hamiltonian parameters for quantitative predictions of spin dynamics.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A Realistic Full-Scale 3D Modeling of Turning Using Coupled Smoothed Particle Hydrodynamics and Finite Element Method for Predicting Cutting Forces

Computational modelling is an effective technique for understanding the complex physics of machining. Large deformations, material separation, and high computational requirements are the key challenges faced while simulating machining. This work introduces a full-scale three-dimensional model of turning operations using a combined approach based on the Smoothed Particle Hydrodynamics (SPH) and Finite Element (FE) methods. By exploiting the advantages of each method, this approach leads to high-fidelity coupled SPH-FE machining models. Cutting forces and chip morphology are the primary results of interest. The machining models are validated with the results of turning experiments. Two-dimensional machining model underpredicts the cutting force and feed force by approximately 49% and 70%, respectively. Moreover, passive force cannot be predicted using the two-dimensional model. On the other hand, with the three-dimensional models developed in this manuscript, the difference between the total simulated force and experimentally measured force is ∼17%. The chip morphologies correlate with experiments in terms of the direction of the chip movement and the “long” continuous chips observed while turning Al 6061. This work expands the realm of machining simulations from two-dimensional orthogonal machining or sectional three-dimensional model to a full-scale realistic simulation. The encouraging simulation results show the potential to study more complex phenomena, such as machining stability and tool path modulation.

42 ENGINEERING↗
DOE OSTI2021

Computational Fluid Dynamics Using the Adaptive Wavelet-Collocation Method

Advancements to the adaptive wavelet-collocation method over the last decade have opened up a number of new possible areas for active research. Volume penalization techniques allow complex immersed boundary conditions to be used with high efficiency for both internal and external flows. Anisotropic methods make it possible to use body-fitted meshes while still taking advantage of the dynamic adaptability properties wavelet-based methods provide. The parallelization of the approach has made it possible to perform large high-resolution simulations of detonation initiation and fluid instabilities to uncover new physical insights that would otherwise be difficult to discover. Other developments include space-time adaptive methods and nonreflecting boundary conditions. This article summarizes the work performed using the adaptive wavelet-collocation method developed by Vasilyev and coworkers over the past decade.

42 ENGINEERING↗
DOE OSTI2025

Kolmogorov-Arnold wavefunctions

Here, this work investigates Kolmogorov-Arnold network-based (KAN) wave-function Ansätz as viable representations for quantum Monte Carlo simulations. Through systematic analysis of one-dimensional model systems, we evaluate their computational efficiency and representational power against established methods. Our numerical experiments suggest some efficient training methods and we explore how the computational cost scales with desired precision, particle number, and system parameters. Roughly speaking, KANs seem to be 10 times cheaper computationally than other neural-network-based Ansätz . We also introduce a novel approach for handling strong short-range potentials—a persistent challenge for many numerical techniques—which generalizes efficiently to higher-dimensional, physically relevant systems with short-ranged strong potentials common in atomic and nuclear physics.

1-dimensional systems↗
DOE OSTI2023

Control optimization for parametric Hamiltonians by pulse reconstruction

Optimal control techniques provide a means to tailor the control pulses required to generate customized quantum gates, which helps to improve the resilience of quantum simulations to gate errors and device noise. However, the significant amount of (classical) computation required to generate customized gates can quickly undermine the effectiveness of this approach, especially when pulse optimization needs to be iterated. We propose a method to reduce the computational time required to generate the control pulse for a Hamiltonian that is parametrically dependent on a time-varying quantity. We use simple interpolation schemes to accurately reconstruct the control pulses from a set of pulses obtained in advance for a discrete set of predetermined parameter values. We obtain a reconstruction with very high fidelity and a significant reduction in computational effort. We report the results of the application of the proposed method to device-level quantum simulations of the unitary (real) time evolution of two interacting neutrons based on superconducting qubits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Learning viscoelasticity models from indirect data using deep neural networks

In this study, we propose a novel approach to model viscoelasticity materials, where rate-dependent and non-linear constitutive relationships are approximated with deep neural networks. We assume that inputs and outputs of the neural networks are not directly observable, and therefore common training techniques with input–output pairs for the neural networks are inapplicable. To that end, we develop a novel computational approach to both calibrate parametric and learn neural-network-based constitutive relations of viscoelasticity materials from indirect displacement data in the context of multiple-physics systems. We show that limited displacement data holds sufficient information to quantify the viscoelasticity behavior. We formulate the inverse computation – modeling viscoelasticity properties from observed displacement data – as a PDE-constrained optimization problem and minimize the error functional using a gradient-based optimization method. The gradients are computed by a combination of automatic differentiation and implicit function differentiation rules. The effectiveness of our method is demonstrated through numerous benchmark problems in geomechanics and porous media transport.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Machine learning models for PDE constrained optimization

Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Methods and Tools To Assess Robustness of Nuclear Plant Outages

Refueling outages are one of the most challenging phases in a nuclear power plant (NPP) operating cycle. Refueling outages are extremely costly for an NPP due to the large amount of required resources and because of lost revenue due to plant being off the grid. Outage durations have steadily decreased across the industry over that last few decades primarily due to improved planning and coordination, but there are still many plants that struggle to meet the performance metrics accomplished by other utilities. Schedule resilience is one of the issues. NPP outages require scheduling thousands of activities within 30 days on average. Despite detailed planning, once the outage starts, numerous emergent issues typically appear along with schedule delays requiring continuous replanning and adjustment. When schedule disruption occurs during an outage, plant staff make urgent efforts to recover but are often not able to maintain the planned outage duration. These outage delays can cost a utility several million dollars per day. Tools that could help outage schedulers create a more resilient schedule and allow them to optimally reschedule emergent work could significantly reduce outage delays. One key aspect of creating a resilient schedule is to have accurate estimates for activity duration. Another important outage scheduling capability is the ability to schedule emergent work with minimal disruption. This paper focuses on developing tools and methods to support NPPs with outage schedule optimization and it describes the initial development of tools to support outage management that leverage computational and machine learning methods.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A reactive molecular dynamics model for uranium/hydrogen containing systems

Uranium-based materials are valuable assets in the energy, medical, and military industries. However, understanding their sensitivity to hydrogen embrittlement is particularly challenging due to the toxicity of uranium and the computationally expensive nature of quantum-based methods generally required to study such processes. In this regard, we have developed a Chebyshev Interaction Model for Efficient Simulation (ChIMES) that can be employed to compute energies and forces of U and UH3 bulk structures with vacancies and hydrogen interstitials with accuracy similar to that of Density Functional Theory (DFT) while yielding linear scaling and orders of magnitude improvement in computational efficiency. Here, we show that the bulk structural parameters, uranium and hydrogen vacancy formation energies, and diffusion barriers predicted by the ChIMES potential are in strong agreement with the reference DFT data. We then use ChIMES to conduct molecular dynamics simulations of the temperature-dependent diffusion of a hydrogen interstitial and determine the corresponding diffusion activation energy. Our model has particular significance in studies of actinides and other high-Z materials, where there is a strong need for computationally efficient methods to bridge length and time scales between experiments and quantum theory.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method

We present the mathematical derivation, software implementation details, and computational results for a semi-smooth Newton method applied to two inverse problems governed by partial differential equations with bound constraints. The two problems share mathematical structural similarities to density-based topology optimization problems. The semi-smooth Newton method provides a mesh independent solution computation for the two test problems. A key step is that the complementarity part of the necessary optimality conditions are reformulated with the use of a complementarity functionφsuch that the complementarity conditions are satisfied if and only if a zero of a nonsmooth function has been obtained. The modular finite element package MFEM is utilized for the software implementation. In addition we constructed a matrix-free Operator to enable the use of efficient Krylov subspace IterativeSolver of MFEM for the solution of our two target problems.

97 MATHEMATICS AND COMPUTING↗