Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics and Computing, Computer science”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

The Dark Energy Survey Supernova Program: an updated measurement of the Hubble constant using the inverse distance ladder

We measure the current expansion rate of the Universe, Hubble’s constant $H_0$, by calibrating the absolute magnitudes of supernovae to distances measured by baryon acoustic oscillations (BAO). This ‘inverse distance ladder’ technique provides an alternative to calibrating supernovae using nearby absolute distance measurements, replacing the calibration with a high-redshift anchor. We use the recent release of 1829 supernovae from the Dark Energy Survey spanning $0.01\lt z\lt 1.13$ anchored to the recent baryon acoustic oscillation measurements from Dark Energy Spectroscopic Instrument (DESI) spanning $0.30 \lt z_{\mathrm{eff}}\lt 2.33$. To trace cosmology to $z=0$, we use the third-, fourth-, and fifth-order cosmographic models, which, by design, are agnostic about the energy content and expansion history of the universe. With the inclusion of the higher redshift DESI-BAO data, the third-order model is a poor fit to both data sets, with the fourth-order model being preferred by the Akaike Information Criterion. Using the fourth-order cosmographic model, we find $H_0=67.19^{+0.66}_{-0.64}\mathrm{~km} \mathrm{~s}^{-1} \mathrm{~Mpc}^{-1}$, in agreement with the value found by Planck without the need to assume Flat-$\Lambda$CDM. However, the best-fitting expansion history differs from that of Planck, providing continued motivation to investigate these tensions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Providing performance portable numerics for Intel GPUs

Summary With discrete Intel GPUs entering the high‐performance computing landscape, there is an urgent need for production‐ready software stacks for these platforms. In this article, we report how we enable the Ginkgo math library to execute on Intel GPUs by developing a kernel backed based on the DPC++ programming environment. We discuss conceptual differences between the CUDA and DPC++ programming models and describe workflows for simplified code conversion. We evaluate the performance of basic and advanced sparse linear algebra routines available in Ginkgo's DPC++ backend in the hardware‐specific performance bounds and compare against routines providing the same functionality that ship with Intel's oneMKL vendor library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

SOMA: Observability, monitoring, and in situ analytics for exascale applications

With the rise of exascale systems and large, data-centric workflows, the need to observe and analyze high performance computing (HPC) applications during their execution is becoming increasingly important. HPC applications are typically not designed with online monitoring in mind, therefore, the observability challenge lies in being able to access and analyze interesting events with low overhead while seamlessly integrating such capabilities into existing and new applications. We explore how our service-based observation, monitoring, and analytics (SOMA) approach to collecting and aggregating both application-specific diagnostic data and performance data addresses these needs. Furthermore, we present our SOMA framework and demonstrate its viability with LULESH, a hydrodynamics proxy application. Then we focus on Astaroth, a multi-GPU library for stencil computations, highlighting the integration of the TAU and APEX performance tools and SOMA for application and performance data monitoring.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Image Distinguishability Analysis Testing Through Principal Components and Its Application to Hot Spot Scale Invariance

Hot spots are spatial regions of intense energy localization that govern initiation of secondary high explosives. Studies that characterize or compare simulated hot spots are frequently either qualitatively descriptive or resort to quantitative distribution functions that neglect stochastic variations and spatial correlations—effects that are also neglected in common comparison tests like the Kolmogorov–Smirnov test. To this end, we develop an image distinguishability analysis (IDA) test based on principal component (PC) analysis that makes pixel-by-pixel comparisons between small, for example, O(<10), image data sets. The IDA test makes comparisons through a generalized distance metric in the PC space and a test statistic that is derived to calculate mathematical equation-values. Here, we derive a statistical distribution and criticality criterion to determine whether images are distinguishable from established baselines. We apply the IDA test on images generated from molecular dynamics simulations of hot spots from pore collapse in TATB to assess scale invariance in the complex patterns of hot spots that form in a representative high explosive crystal. The IDA test shows that TATB hot spot spatial temperature fields and their derived temperature histograms exhibit scale-invariant features over specific intervals of shock orientation, strength, and initial pore diameter. However, the IDA test also shows that qualitatively different conclusions regarding invariance can be reached depending on whether the hot spot is treated as a spatially correlated field as opposed to a distribution function that lacks spatial information.

organic↗
DOE OSTI2023

Language model-accelerated deep symbolic optimization

Symbolic optimization methods have been used to solve varied challenging and relevant problems such as symbolic regression and neural architecture search. However, the current state of the art typically learns each problem from scratch and is unable to leverage pre-existing knowledge and datasets that are available for many applications. Here, inspired by the similarity between sequence representations learned in natural language processing and the formulation of symbolic optimization as a discrete sequence optimization problem, we propose language model-accelerated deep symbolic optimization (LA-DSO), a method that leverages language models to learn symbolic optimization solutions more efficiently. We demonstrate LA-DSO in two tasks: symbolic regression, which allows us to perform extensive experimentation due to its low computation requirements, and computational antibody optimization, which shows that our proposal accelerates learning in challenging real-world problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A direct transcription-based multiple shooting formulation for dynamic optimization

The growing need for fast and efficient solution techniques for solving dynamic optimization problems is driven by a broad spectrum of applications in scheduling and control. We suggest a novel framework for dynamic optimization that utilizes a multiple shooting “backbone” with discrete rather than continuous subproblems, thereby eliminating need for repeated time-integration. A Lagrangian relaxation (LR)-based decomposition scheme is proposed, which dualizes the state continuity requirements between subproblems and enables parallel solution of the problem. We demonstrate the applicability of our method on two case studies: the Van der Pol oscillator and a batch reactor.

42 ENGINEERING↗
DOE OSTI2020

Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick

An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.

42 ENGINEERING↗
DOE OSTI2020

Optimization-based control using input convex neural networks

Input convex neural networks (ICNNs) are a family of deep learning models where the outputs are constructed to be convex functions of the inputs. By parameterizing system models using ICNNs, optimization-based control problems can be solved as convex optimization problems, leading to improved performance and robustness. This work proposes a novel framework where the control objective function and constraints are modelled using ICNNs. A case study of optimization-based control with output constraints is conducted on a process with input multiplicity and nonminimum phase behavior. The simulation results demonstrate improved economic yield compared with normal neural networks. Additionally, the input convexity formulation is compared with simple regularization techniques, and unique benefits such as improved data efficiency and robustness of the proposed formulation are shown. Finally, by explicitly incorporating prior knowledge about convexity, this framework provides a good balance between the universal approximation power of deep learning and computational feasibility required by control.

42 ENGINEERING↗
DOE OSTI2022

ADAM: A web platform for graph-based modeling and optimization of supply chains

Modeling and optimization are essential tasks that arise in the analysis and design of supply chains (SCs). SC models are essential for understanding emergent behavior such as transactions between participants, inherent value of products exchanged, as well as impact of externalities (e.g., policy and climate) and of constraints. Unfortunately, most users of SC models have limited expertise in mathematical optimization, and this hinders the adoption of advanced decision-making tools. Here, in this work, we present ADAM, a web platform that enables the modeling and optimization of SCs. ADAM facilitates modeling by leveraging intuitive and compact graph-based abstractions that allow the user to express dependencies between locations, products, and participants. ADAM model objects serve as repositories of experimental, technology, and socio-economic data; moreover, the graph abstractions facilitate the organization and exchange of models and provides a natural framework for education and outreach. Here, we discuss the graph abstractions and software design principles behind ADAM, its key functional features and workflows, and application examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Effect of topology changes on the breakup of a periodic liquid jet

Here, the breakup of a periodic jet is examined computationally, using a front-tracking/finite-volume method, where the interface is represented by connected marker points moving with the fluid, while the governing equations are solved on a fixed grid. Tracking the interface allows control of whether topology changes take place or not. The Reynolds and Capillary numbers are kept relatively low ($Re = 150$ and $Ca = 2$) so most of the flow is well resolved. The effect of topology changes is examined by following the jet until it has mostly disintegrated, for different “coalescence criterion,” based on the thickness of thin films and threads. The evolution of both two-dimensional and fully three-dimensional flows is examined. It is found that although there is a significant difference between the evolution when no breakup takes place and when it does, once breakup takes place the evolution is relatively insensitive to exactly how it is triggered for a range of coalescence criterion, and any differences are mostly confined to the smallest scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Hydro-mechanical coupled modeling of hydraulic fracturing using the mesh fragmentation technique

The inclusion of special interface elements between standard finite elements is becoming a common technique to model discontinuities in porous media using the finite element method (FEM). Recently, it was proved that high aspect ratio (HAR) elements can reproduce very satisfactorily the main features of behavior observed in a single hydraulically-induced fracture. In this paper, the mesh fragmentation technique (MFT) is proposed to extend the application of HAR elements to simulate more general problems involving the formation of hydraulic fractures in rocks by introducing this type of element in-between the standard FE of a typical mesh. The proposed framework makes use of standard FE techniques. Therefore, it is relatively easy to upgrade an existing FE program for continuous porous media to deal with evolving discontinuities. The proposed approach is verified and validated against available analytical and numerical solutions. The crack patterns predicted by the MFT are also compared with the ones observed in the laboratory. The formation of multiple fractures is also analyzed. In all cases, the proposed technique was able to properly capture the main features of rock behavior subjected to hydraulic fracturing.

58 GEOSCIENCES↗
DOE OSTI2020

HTR solver: An open-source exascale-oriented task-based multi-GPU high-order code for hypersonic aerothermodynamics

In this study, the open-source Hypersonics Task-based Research (HTR) solver for hypersonic aerothermodynamics is described. The physical formulation of the code includes thermochemical effects induced by high temperatures (vibrational excitation and chemical dissociation). The HTR solver uses high-order TENO-based spatial discretization on structured grids and efficient time integrators for stiff systems, is highly scalable in GPU-based supercomputers as a result of its implementation in the Regent/Legion stack, and is designed for direct numerical simulations of canonical hypersonic flows at high Reynolds numbers. Additionally, the performance of the HTR solver is tested with benchmark cases including inviscid vortex advection, low- and high-speed laminar boundary layers, inviscid one-dimensional compressible flows in shock tubes, supersonic turbulent channel flows, and hypersonic transitional boundary layers of both calorically perfect gases and dissociating air.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Solving the Grad–Shafranov equation using spectral elements for tokamak equilibrium with toroidal rotation

The Grad–Shafranov equation is solved using spectral elements for tokamak equilibrium with toroidal rotation. The Grad–Shafranov solver builds upon and extends the NIMEQ code (Howell and Sovinec, 2014) previously developed for static tokamak equilibria. Both geometric and algebraic convergence are achieved as the polynomial degree of the spectral-element basis increases. A new analytical solution to the Grad–Shafranov equation is obtained for Solov’ev equilibrium in presence of rigid toroidal rotation, in addition to a previously obtained analytical solution for a different set of equilibrium and rotation profiles. The numerical solutions from the extended NIMEQ are benchmarked with the analytical solutions, with good agreements. Besides, the extended NIMEQ code is benchmarked with the FLOW code (Guazzotto et al., 2004). The modification of pressure profile induced by toroidal flow is investigated. The relative change of pressure profile is found significant around the edge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗