Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “space computing”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Fierro

FIERRO is a parallel C++ code designed to simulate fluid mechanics, heat transfer, and solid mechanics in two- and three dimensional space. FIERRO is written to run on homogeneous (CPU) and heterogeneous (CPU+GPU) high performance computing machines. Fierro can aid a) modeling and design efforts that have historically relied on commercial implicit and explicit finite element codes, b) numerical methods research, c) manufacturing research, and d) computer science research. The code contains diverse numerical methods to solve the governing physics equations for both quasi-static and dynamic problems. Mathematical optimization solvers are coupled to the numerical methods to research topology and shape optimization that has application to additive manufacturing, and to create novel numerical approaches. Phase-field methods with micromechanical solvers are provided to simulate microstructure formation and evolution in manufacturing processes. The micromechanical solvers can also help research efforts create continuum-scale constitutive models for solids, as a function of the microstructure, in situ in a calculation or in a stand-alone manner. No physical data exists within the code.

Morgan, Nathaniel↗
DOE OSTI2020

Traversing large graphs on GPUs with unified memory

Due to the limited capacity of GPU memory, the majority of prior work on graph applications on GPUs has been restricted to graphs of modest sizes that fit in memory. Recent hardware and software advances make it possible to address much larger host memory transparently as a part of a feature known as unified virtual memory. While accessing host memory over an interconnect is understandably slower, the problem space has not been sufficiently explored in the context of a challenging workload with low computational intensity and an irregular data access pattern such as graph traversal. We analyse the performance of breadth first search (BFS) for several large graphs in the context of unified memory and identify the key factors that contribute to slowdowns. Next, we propose a lightweight offline graph reordering algorithm, HALO (Harmonic Locality Ordering), that can be used as a pre-processing step for static graphs. HALO yields speedups of 1.5x-1.9x over baseline in subsequent traversals. Our method specifically aims to cover large directed real world graphs in addition to undirected graphs whereas prior methods only account for the latter. Additionally, we demonstrate ties between the locality ordering problem and graph compression and show that prior methods from graph compression such as recursive graph bisection can be suitably adapted to this problem.

Gera, Prasun↗
DOE OSTI2020

Helium Bubble Growth and Retention Characteristics in Aging Palladium Tritide

The helium-related characteristics of aged palladium tritide, including tritium loss, the formation of He bubbles from tritium decay-induced He atoms, and He thermal desorption behavior are computed using a continuum model of bubble evolution that incorporates the log-normal bubble spacing distribution deduced from 3 He nuclear magnetic resonance (NMR) measurements. This spacing distribution produces significant differences between mean (expectation) values of the bubble size and pressure and the average (median) values of these aging characteristics obtained by a previous calculation. The new calculations find much of the He is retained in a large quantity of smaller bubbles with higher bubble pressures, improving the overall stability of the bubbles and extending the age of He retention. By contrast, the integrated tritide material characteristics of swelling and tritium pressure are found relatively insensitive to details of the bubble spacing distribution. Inter-bubble fracture is predicted to begin with small, closely-spaced bubbles and progress to include larger bubbles near the onset of rapid He release. The critical concentration for this onset increases almost linearly with material tensile strength and decreases with shear modulus. Release of He from the aging solid is modeled as a growing network of fractured inter-bubble ligaments. For small particle or small grain material, the physical size of the fracture cluster, relative to the material dimensions, becomes important. In contrast with normal aging, inter-bubble fracture occurring during thermal desorption appears to begin with large, widely-spaced bubbles, indicating elevated temperature techniques may be of limited use for evaluating development of the bubble fracture network.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Seamless Hybrid-integrated Interconnect NEtwork (SHINE)

Large-scale date centers are becoming increasingly limited by the capacity of interconnects due to the rapid increasing power consumption and bandwidth demands driven by the rigorous down scaling of CMOS critical dimensions in according with the Moore’s Law. As a result of the continuing bandwidth scaling, optical interconnects based on parallel optics, where data are simultaneously transmitted along more than one lane, have becoming a preferred interconnected solution over copper cables. To building an efficient optical interconnect system, optical coupling between different elements, such as optical fibers, photonics chips, is a critical step, which is challenging due to the mode mismatch of varies optical ports. In this project, we proposed and demonstrated an optical interfacing scheme, which provided a light coupling approach with low energy loss, broadband operation, high alignment tolerance and compatible with scalable fabrication and testing. Here, the mode transformation is achieved by a total internal reflection from a chip integrated microscale freefrom surface. Due to the enormous light wavefront manipulating ability associated with the gigantic design space, the freeform couplers platform is universally applicable to a wide range of optical coupling scenarios, such as the interfacing between a waveguide to a fiber, another waveguide, surface normal device, or free space.

42 ENGINEERING↗
DOE OSTI2022

Porting a fast-running wildfire plume model for use in national security and climate applications

In this project, the code for the fast-running Freitas wildfire plume model was successfully ported into the NARAC system, creating an operations-ready capability for predicting the transport of hazardous smoke from large wildfires. “Porting” refers to copying a section of code from one software package to another while accounting for unique dependencies in each software package. In this case, the code was ported from the Weather Research and Forecasting (WRF) Model, which is used extensively by the project team. To verify correct implementation, model results from the updated NARAC system were compared to those from WRF and the High-Resolution Rapid Refresh (HRRR) forecast model, which also employs the Freitas scheme. The NARAC User Interface (UI) and code documentation were also updated to include the new wildfire plume option, and a wildfire case was added to the NARAC test suite. The code was used in a real-time, semi-operational setup to predict smoke transport during the Cerro Pelado fire near Los Alamos National Laboratory in May 2022. The Freitas plume model was also tested for LLNL climate applications. Although the code was not ported into the Energy Exascale Earth System Model (E3SM), it was tested offline using E3SM atmospheric inputs, and results were compared to existing high-resolution plume predictions from large-eddy simulations in WRF. The code implementation and testing completed during this project will enable future work predicting smoke transport from large wildfires in LLNL national security and climate mission spaces.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

A Physics-Based Digital Twin for Wave Elevation and Seabed Moment Estimation of Offshore Monopiles: Preprint

In this work, we present a proof of concept of a physics-based digital twin for a monopile structure (with overhead inertia) subjected to wave loading. The digital twin is formulated using reduced-order models derived from first principles and combined with a Kalman filter for state estimation. The proposed framework estimates the monopile top motion, the wave elevation, and the section forces and moments along the pile using primarily acceleration measurements at the monopile top. Key innovations include the use of a hydrodynamic shape function to represent distributed wave loading in a compact and computationally efficient manner, and the introduction of a shaping filter to augment the state-space with wave kinematics. Synthetic measurement data are generated using OpenFAST and used as a reference to assess the performance of the digital twin. Results demonstrate that the wave elevation can be accurately reconstructed without direct sea-state measurements as long as the wave regime is inertia-dominated. Under the ideal tested conditions, the total hydrodynamic force and sea-bed bending moment are estimated with relative errors on the order of 1% and correlation coefficients exceeding 96%. Future work will evaluate the estimator's performance under operational uncertainties and more complex loading conditions.

17 WIND ENERGY↗
DOE OSTI2024

How Well Can Quantum Embedding Method Predict the Reaction Profiles for Hydrogenation of Small Li Clusters?

Quantum computing leverages the principles of quantum mechanics in novel ways to tackle complex chemistry problems that cannot be accurately addressed using traditional quantum chemistry methods. However, the high computational cost and available number of physical qubits with high fidelity limit its application to small chemical systems. This work employed a quantum-classical framework which features a quantum active space-embedding approach to perform simulations of chemical reactions that require up to 14 qubits. This framework was applied to prototypical example metal hydrogenation reactions: the coupling between hydrogen and Li 2 , Li 3 , and Li 4 clusters. Particular attention was paid to the computation of barriers and reaction energies. The predicted reaction profiles compare well with advanced classical quantum chemistry methods, demonstrating the potential of the quantum embedding algorithm to map out reaction profiles of realistic gas-phase chemical reactions to ascertain qualitative energetic trends. Additionally, the predicted potential energy curves provide a benchmark to compare against both current and future quantum embedding approaches.

36 MATERIALS SCIENCE↗
DOE OSTI2024

FLOWERS AEP: An Analytical Model for Wind Farm Layout Optimization

Annual energy production (AEP) is commonly used in objective functions for wind farm layout optimization. AEP is proportional to wind farm power production integrated over an annual distribution of free-stream wind conditions. Physics-based estimates of wind farm power production typically rely on low-fidelity engineering wake models that approximate the steady-state wind farm flow field. AEP estimates are then obtained by performing independent simulations for discrete wind conditions and using rectangular quadrature to account for each condition's expected frequency of occurrence. Depending on the number of simulated discrete wind conditions, this numerical integral could be hampered by poor accuracy or high computational costs. The FLOWERS AEP model instead poses an analytical integral of the engineering wake model over the variable wind conditions, yielding a closed-form, analytical function for wind farm AEP. This paper derives the analytical functions for FLOWERS AEP and its derivatives with respect to turbine position, which are useful for gradient-based wind farm layout optimization, in nondimensional form. We then analyze the benefits of the FLOWERS AEP model over conventional reference models, focusing on its low cost, adequate wake loss predictions, and smooth design space. Although the FLOWERS approach is found to predict the exact value of AEP with some error relative to the reference model (within 14% on average), it dramatically reduces computation time by an order of magnitude, produces a qualitatively similar design space at relatively low resolution, and yields comparable optimal layouts. This significant speed improvement is critical in layout optimization applications, where determining an optimal layout in an efficient manner is more important than precise AEP prediction.

17 WIND ENERGY↗
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Feynman-Kac based numerical method for the exit time probability of a class of transport problems

The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport problems. In this work, we present an accurate and efficient numerical method for computing this probability for systems described by non-autonomous (time-dependent) stochastic differential equations (SDEs) or their equivalent Fokker-Planck partial differential equations. The method is based on the direct approximation of the Feynman-Kac formula that establishes a link between the adjoint Fokker-Planck equation and the forward SDE. The Feynman-Kac formula is approximated using the Gauss-Hermite quadrature rules and piecewise cubic Hermite interpolating polynomials, and a GPU accelerated matrix representation is used to compute the entire time evolution of the exit time probability using a single pass of the algorithm. The method is unconditionally stable, exhibits second order convergence in space, first order convergence in time, and it is straightforward to parallelize. Applications are presented to the advection diffusion of a passive tracer in a fluid flow exhibiting chaotic advection, and to the runaway acceleration of electrons in a plasma in the presence of an electric field, collisions, and radiation damping. Benchmarks against analytical solutions as well as comparisons with explicit and implicit finite difference standard methods for the adjoint Fokker-Planck equation are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Inverse design of hypoeutectoid pearlite steel microstructures using a deep learning and genetic algorithm optimization framework

Goal-oriented microstructure design in metallic materials is a challenging task due to complex structure-property relationships. Traditional experimental and computational approaches are time-intensive and economically inefficient, limiting their applicability for large-scale design space exploration. Here, in this work, we propose an end-to-end framework that integrates deep learning models with genetic optimization to design microstructures with targeted mechanical properties. Deep learning models enable accurate forward design, while their integration with genetic optimization enables efficient inverse design within a few hours, compared to days or weeks using conventional finite element simulations. The framework combines experimental characterization and finite element modeling to analyze the influence of microstructural features on the mechanical behavior of hypoeutectoid steels. Data from both experiments and simulations are used to train the deep learning models. To demonstrate its effectiveness, we apply the framework to 0.63% carbon steel with proeutectoid ferrite and pearlite phases, commonly used in industrial applications. In this study, 2D microstructures were used for modeling, selected primarily for computational efficiency and to establish proof of concept. The framework successfully optimizes microstructures for targeted yield strength, ultimate strength, and stress concentration factors while significantly reducing computational time. Beyond hypoeutectoid steels, this scalable framework can be extended to other material systems and integrated with additive manufacturing, offering an efficient approach for accelerating microstructure design for specific engineering applications.

ConvLSTM↗
DOE OSTI2020

On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces

Newton’s method is usually preferred when solving optimization problems due to its superior convergence properties compared to gradient-based or derivative-free optimization algorithms. However, deriving and computing second-order derivatives needed by Newton’s method often is not trivial and, in some cases, not possible. In such cases quasi-Newton algorithms are a great alternative. In this paper, we provide a new derivation of well-known quasi-Newton formulas in an infinite-dimensional Hilbert space setting. Furthermore, it is known that quasi-Newton update formulas are solutions to certain variational problems over the space of symmetric matrices. In this paper, we formulate similar variational problems over the space of bounded symmetric operators in Hilbert spaces. By changing the constraints of the variational problem we obtain updates (for the Hessian and Hessian inverse) not only for the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method but also for Davidon–Fletcher–Powell (DFP), Symmetric Rank One (SR1), and Powell-Symmetric-Broyden (PSB). In addition, for an inverse problem governed by a partial differential equation (PDE), we derive DFP and BFGS “structured” secant formulas that explicitly use the derivative of the regularization and only approximates the second derivative of the misfit term. We show numerical results that demonstrate the desired mesh-independence property and superior performance of the resulting quasi-Newton methods.

97 MATHEMATICS AND COMPUTING↗
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

Unsupervised machine learning discovery of structural units and transformation pathways from imaging data

We show that unsupervised machine learning can be used to learn chemical transformation pathways from observational Scanning Transmission Electron Microscopy (STEM) data. To enable this analysis, we assumed the existence of atoms, a discreteness of atomic classes, and the presence of an explicit relationship between the observed STEM contrast and the presence of atomic units. With only these postulates, we developed a machine learning method leveraging a rotationally invariant variational autoencoder (VAE) that can identify the existing molecular fragments observed within a material. The approach encodes the information contained in STEM image sequences using a small number of latent variables, allowing the exploration of chemical transformation pathways by tracing the evolution of atoms in the latent space of the system. The results suggest that atomically resolved STEM data can be used to derive fundamental physical and chemical mechanisms involved, by providing encodings of the observed structures that act as bottom-up equivalents of structural order parameters. The approach also demonstrates the potential of variational (i.e., Bayesian) methods in the physical sciences and will stimulate the development of more sophisticated ways to encode physical constraints in the encoder–decoder architectures and generative physical laws and causal relationships in the latent space of VAEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A unifying modeling abstraction for infinite-dimensional optimization

Infinite-dimensional optimization (InfiniteOpt) problems involve modeling components (variables, objectives, and constraints) that are functions defined over infinite-dimensional domains. Examples include continuous-time dynamic optimization (time is an infinite domain and components are functions of time), PDE optimization problems (space and time are infinite domains and components are functions of space-time), as well as stochastic and semi-infinite optimization (random space is an infinite domain and components are a function of such random space). InfiniteOpt problems also arise from combinations of these problem classes (e.g., stochastic PDE optimization). Given the infinite-dimensional nature of objectives and constraints, one often needs to define appropriate quantities (measures) to properly pose the problem. Moreover, InfiniteOpt problems often need to be transformed into a finite dimensional representation so that they can be solved numerically. Here in this work, we present a unifying abstraction that facilitates the modeling, analysis, and solution of InfiniteOpt problems. The proposed abstraction enables a general treatment of infinite-dimensional domains and provides a measure-centric paradigm to handle associated variables, objectives, and constraints. This abstraction allows us to transfer techniques across disciplines and with this identify new, interesting, and useful modeling paradigms (e.g., event constraints and risk measures defined over time domains). Our abstraction serves as the backbone of an intuitive Julia-based modeling package that we call InfiniteOpt.jl. We demonstrate the developments using diverse case studies arising in engineering.

42 ENGINEERING↗
DOE OSTI2021

Majorana zero modes in impurity-assisted vortex of LiFeAs superconductor

The iron-based superconductor is emerging as a promising platform for Majorana zero mode, which can be used to implement topological quantum computation. One of the most significant advances of this platform is the appearance of large vortex level spacing that strongly protects Majorana zero mode from other low-lying quasiparticles. Despite the advantages in the context of physics research, the inhomogeneity of various aspects hampers the practical construction of topological qubits in the compounds studied so far. Here we show that the stoichiometric superconductor LiFeAs is a good candidate to overcome this obstacle. By using scanning tunneling microscopy, we discover that the Majorana zero modes, which are absent on the natural clean surface, can appear in vortices influenced by native impurities. Our detailed analysis reveals a new mechanism for the emergence of those Majorana zero modes, i.e. native tuning of bulk Dirac fermions. The discovery of Majorana zero modes in this homogeneous material, with a promise of tunability, offers an ideal material platform for manipulating and braiding Majorana zero modes, pushing one step forward towards topological quantum computation.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Real-space solution to the electronic structure problem for nearly a million electrons

We report a Kohn–Sham density functional theory calculation of a system with more than 200 000 atoms and 800 000 electrons using a real-space high-order finite-difference method to investigate the electronic structure of large spherical silicon nanoclusters. Our system of choice was a 20 nm large spherical nanocluster with 202 617 silicon atoms and 13 836 hydrogen atoms used to passivate the dangling surface bonds. To speed up the convergence of the eigenspace, we utilized Chebyshev-filtered subspace iteration, and for sparse matrix–vector multiplications, we used blockwise Hilbert space-filling curves, implemented in the PARSEC code. For this calculation, we also replaced our orthonormalization + Rayleigh–Ritz step with a generalized eigenvalue problem step. We utilized all of the 8192 nodes (458 752 processors) on the Frontera machine at the Texas Advanced Computing Center. We achieved two Chebyshev-filtered subspace iterations, yielding a good approximation of the electronic density of states. Our work pushes the limits on the capabilities of the current electronic structure solvers to nearly 106 electrons and demonstrates the potential of the real-space approach to efficiently parallelize large calculations on modern high-performance computing platforms.

Chemistry↗