Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical analysis”

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,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

User’s Manual for RESRAD-RDD&IND Code Version 2: Vol. 2—User’s Guide for RESRAD-RDD&IND Code

Version 2.0 of the RESRAD-RDD&IND computer code is designed to support the implementation of protective action guides (PAGs) after a nuclear emergency incident including a radiological dispersal device (RDD) and/or an improvised nuclear device (IND) incident (EPA 2017). Eight different group types, addressing various decisions, are available for selection. The RESRAD-RDD&IND code calculates radiological doses, stay times, etc., for the selected group that the user wishes to focus on. (That is, the results for all the groups are not calculated simultaneously, and the input for those other groups do not matter, although some parameter values are shared between groups.) Version 2.0 has a user-friendly interface so that the RESRAD-RDD&IND code can be used with minimal training. For example, the user can select the major characteristics of the problem-event type, source term, and decision type from the left side of the interface and then calculate the results with the default assumptions for the exposure scenarios. More in-depth analysis would include specifying site-specific exposure scenario characteristics in the right side of the interface. The procedures for data entry and results viewing are self-explanatory. This is because common window maneuvering features and text instructions were incorporated in the interface design. General and context-specific help are available to aid users entering parameter values, as well. The RESRAD-RDD&IND computer code gives the user the option to select either an RDD or IND incident for analysis. For an RDD event analysis, 11 radionuclides (Am-241, Cf-252, Cm-244, Co-60, Cs-137, Ir-192, Po-210, Pu-238, Pu-239, Ra-226, and Sr-90) are included. These 11 radionuclides are the radionuclides most likely used for an RDD. More than 90 radionuclides can be selected for an IND event analysis. Initial default concentrations are provided for 44 radionuclides for a uranium-fueled IND event. These 44 radionuclides are those that would contribute significantly to the radiation dose associated with a uranium-fueled bomb detonation. The radionuclides generated from ingrowth of these 44 initial radionuclides are also automatically included in the analysis. Pu-239, Cs-134m, Ru-105, and Rb-89 and their progeny can be selected for analysis if they are detected and their concentrations are determined. This user’s guide, which is Volume 2 of the User’s Manual for RESRAD-RDD&IND Code Version 2, provides instructions to users on how to install the RESRAD-RDD&IND code, navigate the interface, and use the various features, including those discussed above, to set up an analysis and view/print the results in text outputs. Volume 1 of the User’s Manual for RESRAD-RDD&IND Code Version 2 (Yu et al. 2026), which contains descriptions of the methodology and theoretical basis for dose modeling and the mathematical equations implemented in the code, can be accessed and viewed through the Help menu in the code or can be downloaded from the RESRAD website (https://resrad.evs.anl.gov).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Quantifying the basic reproduction number and underestimated fraction of Mpox cases worldwide at the onset of the outbreak

In 2022, there was a global resurgence of mpox, with different clinical-epidemiological features compared with previous outbreaks. Sexual contact was hypothesized as the primary transmission route, and the community of men having sex with men (MSM) was disproportionately affected. Because of the stigma associated with sexually transmitted infections, the real burden of mpox could be masked. We quantified the basic reproduction number (R 0 ) and the underestimated fraction of mpox cases in 16 countries, from the onset of the outbreak until early September 2022, using Bayesian inference and a compartmentalized, risk-structured (high-/low-risk populations) and two-route (sexual/non-sexual transmission) mathematical model. Machine learning (ML) was harnessed to identify underestimation determinants. Estimated R 0 ranged between 1.37 (Canada) and 3.68 (Germany). The underestimation rates for the high- and low-risk populations varied between 25–93% and 65–85%, respectively. The estimated total number of mpox cases, relative to the reported cases, is highest in Colombia (3.60) and lowest in Canada (1.08). In the ML analysis, two clusters of countries could be identified, differing in terms of attitudes towards the 2SLGBTQIAP+ community and the importance of religion. Given the substantial mpox underestimation, surveillance should be enhanced, and country-specific campaigns against the stigmatization of MSM should be organized, leveraging community-based interventions.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Extended isogeometric analysis of multi-material and multi-physics problems using hierarchical B-splines

Here, this paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate conformal meshes, this work uses an extended finite element method (XFEM) to discretize the governing equations on non-conforming, embedding meshes. A flexible approach to create truncated hierarchical B-splines discretizations is presented. This approach enables the refinement of each state variable field individually to meet field-specific accuracy requirements. To obtain an immersed geometry representation that is consistent across all hierarchically refined B-spline discretizations, the geometry is immersed into a single mesh, the XFEM background mesh, which is constructed from the union of all hierarchical B-spline meshes. An extraction operator is introduced to represent the truncated hierarchical B-spline bases in terms of Lagrange shape functions on the XFEM background mesh without loss of accuracy. The truncated hierarchical B-spline bases are enriched using a generalized Heaviside enrichment strategy to accommodate small geometric features and multi-material problems. The governing equations are augmented by a formulation of the face-oriented ghost stabilization enhanced for locally refined B-spline bases. We present examples for two- and three-dimensional linear elastic and thermo-elastic problems. The numerical results validate the accuracy of our framework. The results also demonstrate the applicability of the proposed framework to large, geometrically complex problems.

42 ENGINEERING↗
DOE OSTI2022

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Using advanced data structures to enable responsive security monitoring

Write-optimized data structures (WODS), offer the potential to keep up with cyberstream event rates and give sub-second query response for key items like IP addresses. These data structures organize logs as the events are observed. To work in a real-world environment and not fill up the disk, WODS must efficiently expire older events. As the basis for our research into organizing security monitoring data, we implemented a tool, called Diventi, to index IP addresses in connection logs using RocksDB (a write-optimized LSM tree). In this work, we extended Diventi to automatically expire data as part of the data structures’ normal operations. We guarantee that Diventi always tracks the N most recent events and tracks no more than N + k events for a parameter k < N, while ensuring the index is opportunistically pruned. To test Diventi at scale in a controlled environment, we used anonymized traces of IP communications collected at SuperComputing 2019. We synthetically extended the 2.4 billion connection events to 100 billion events. We tested Diventi vs. Elasticsearch, a common log indexing tool. In our test environment, Elasticsearch saw an ingestion rate of at best 37,000 events/s while Diventi sustained ingestion rates greater than 171,000 events/s. Our query response times were as much as 100 times faster, typically answering queries in under 80 ms. Furthermore, we saw no noticeable degradation in Diventi from expiration. We have deployed Diventi for many months where it has performed well and supported new security analysis capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

MADLens, a python package for fast and differentiable non-Gaussian lensing simulations

Here, we present MADLens a python package for producing non-Gaussian lensing convergence maps at arbitrary source redshifts with unprecedented precision. MADLens is designed to achieve high accuracy while keeping computational costs as low as possible. A MADLens simulation with only particles produces convergence maps whose power agrees with theoretical lensing power spectra up to within the accuracy limits of HaloFit. This is made possible by a combination of a highly parallelizable particle-mesh algorithm, a sub-evolution scheme in the lensing projection, and a machine-learning inspired sharpening step. Further, MADLens is fully differentiable with respect to the initial conditions of the underlying particle-mesh simulations and a number of cosmological parameters. These properties allow MADLens to be used as a forward model in Bayesian inference algorithms that require optimization or derivative-aided sampling. Another use case for MADLens is the production of large, high resolution simulation sets as they are required for training novel deep-learning-based lensing analysis tools. We make the MADLens package publicly available under a Creative Commons License

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Database development and exploration of process–microstructure relationships using variational autoencoders

The paper demonstrates graphical representation of a large database containing process–microstructure relationships using an unsupervised machine learning algorithm. Correlating microstructural features to processing is an essential first step to answer the difficult problem of process sequence design. Here, a large database of 346,200 orientation distribution functions resulting from a variety of process sequences is constructed, where each sequence comprises up to four stages of tension, compression and rolling along different directions in various permutations. This open-source database is constructed for collaborative development of process design algorithms. The paper demonstrates a novel application of the large database: graphical representation of texture–process relationships. A variational autoencoder is used to reduce the entire database to a two dimensional latent space where variations in processes and properties can be visualized. Using proximity analysis in this latent space, we can quickly unearth multiple process solutions to the problem of texture or property design.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Chemically Fueled Transient Geometry Changes in Diphenic Acids

Transient changes in molecular geometry are key to the function of many important biochemical systems. Here, we show that diphenic acids undergo out-of-equilibrium changes in dihedral angle when reacted with a carbodiimide chemical fuel. Treatment of appropriately functionalized diphenic acids with EDC (N-(3-(dimethylamino)propyl)-N'-ethylcarbodiimide hydrochloride) yields the corresponding diphenic anhydrides, reducing the torsional angle about the biaryl bond by ~45°, regardless of substitution. In the absence of steric resistance, the reaction is well-described by a simple mechanism; the resulting kinetic parameters can be used to derive important properties of the system, such as yields and lifetimes. In conclusion, the reaction tolerates steric hindrance ortho to the biaryl bond, although the competing formation of (transient) byproducts complicates quantitative analysis.

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

Differentiable Simulation of a Liquid Argon Time Projection Chamber

Liquid argon time projection chambers (LArTPCs) are widely used in particle detection for their tracking and calorimetric capabilities. The particle physics community actively builds and improves high-quality simulators for such detectors in order to develop physics analyses in a realistic setting. The ability of these simulators to mimic real, measured data is limited by the modeling of the physical detectors used for data collection. This modeling can be improved by performing dedicated calibration measurements. Conventional approaches calibrate individual detector parameters or processes one at a time. However, the impact of detector processes is entangled, making this a poor description of the underlying physics. We introduce a differentiable simulator that enables a gradient-based optimization, allowing for the first time a simultaneous calibration of all detector parameters. We describe the procedure of making a differentiable simulator, highlighting the challenges of retaining the physics quality of the standard, non-differentiable version while providing meaningful gradient information. We further discuss the advantages and drawbacks of using our differentiable simulator for calibration. Finally, we provide a starting point for extensions to our approach, including applications of the differentiable simulator to physics analysis pipelines.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Non-asymptotic analysis of ensemble Kalman updates: effective dimension and localization

Many modern algorithms for inverse problems and data assimilation rely on ensemble Kalman updates to blend prior predictions with observed data. Ensemble Kalman methods often perform well with a small ensemble size, which is essential in applications where generating each particle is costly. This paper develops a non-asymptotic analysis of ensemble Kalman updates, which rigorously explains why a small ensemble size suffices if the prior covariance has moderate effective dimension due to fast spectrum decay or approximate sparsity. Here, we present our theory in a unified framework, comparing everal implementations of ensemble Kalman updates that use perturbed observations, square root filtering and localization. As part of our analysis, we develop new dimension-free covariance estimation bounds for approximately sparse matrices that may be of independent interest.

Mathematics↗
DOE OSTI2021

FPGA Computing

The articles in this special section focus on cutting-edge research on topics that relate to field programmable gate arrays (FPGA) in computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Enabling Scalable and Extensible Memory-mapped Datastores in Userspace

Exascale workloads are expected to incorporate data-intensive processing in close coordination with traditional physics simulations. These emerging scientific, data-analytics and machine learning applications need to access a wide variety of datastores in flat files and structured databases. Programmer productivity is greatly enhanced by mapping datastores into the application process's virtual memory space to provide a unified “in-memory” interface. Currently, memory mapping is provided by system software primarily designed for generality and reliability. However, scalability at high concurrency is a formidable challenge on exascale systems. Also, there is a need for extensibility to support new datastores potentially requiring HPC data transfer services. In this article, we present UMap , a scalable and extensible userspace service for memory-mapping datastores. Furthermore, through decoupled queue management, concurrency aware adaptation, and dynamic load balancing, UMap enables application performance to scale even at high concurrency. We evaluate UMap in data-intensive applications, including sorting, graph traversal, database operations, and metagenomic analytics. Our results show that UMap as a userspace service outperforms an optimized kernel-based service across a wide range of intra-node concurrency by 1.22-1.9 × . We performed two case studies to demonstrate UMap 's extensibility. First, a new datastore residing in remote memory is incorporated into UMap as an application-specific plugin. Second, we present a persistent memory allocator Metall built atop UMap for unified storage/memory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

IRIS: A Performance-Portable Framework for Cross-Platform Heterogeneous Computing

From edge to exascale, computer architectures are becoming more heterogeneous and complex. The systems typically have fat nodes, with multicore CPUs and multiple hardware accelerators such as GPUs, FPGAs, and DSPs. This complexity is causing a crisis in programming systems and performance portability. Several programming systems are working to address these challenges, but the increasing architectural diversity is forcing software stacks and applications to be specialized for each architecture. As we show, all of these approaches critically depend on their software framework for discovery, execution, scheduling, and data orchestration. To address this challenge, we believe that a more agile and proactive software framework is essential to increase performance portability and improve user productivity. To this end, we have designed and implemented IRIS: a performance-portable framework for cross-platform heterogeneous computing. IRIS can discover available resources, manage multiple diverse programming platforms (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, OpenMP) simultaneously in the same execution, respect data dependencies, orchestrate data movement proactively, and provide for user-configurable scheduling. To simplify data movement, IRIS introduces a shared virtual device memory with relaxed consistency among different heterogeneous devices. IRIS also adds an automatic kernel workload partitioning technique using the polyhedral model so that it can resize kernels for a wide range of devices. Our evaluation on three architectures, ranging from Qualcomm Snapdragon to a Summit supercomputer node, shows that IRIS improves portability across a wide range of diverse heterogeneous architectures with negligible overhead.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

On the continuity of solutions to anisotropic elliptic operators in the limiting case

Abstract We show that local weak solutions to anisotropic elliptic equations with bounded and measurable coefficients, whose prototype is are continuous. Our analysis exploits a particular intrinsic geometry that, within the limiting case on the exponents, allows for a reduction of the oscillation of the solution.

Ciani, Simone [Department of Mathematics, Universi↗
DOE OSTI2021

Data-Driven Learning of Nonautonomous Systems

In this work, we present a numerical framework for recovering unknown nonautonomous dynamical systems with time-dependent inputs. To circumvent the difficulty presented by the nonautonomous nature of the system, our method transforms the solution state into piecewise integration of the system over a discrete set of time instances. The time-dependent inputs are then locally parameterized by using a proper model, for example, polynomial regression, in the pieces determined by the time instances. This transforms the original system into a piecewise parametric system that is locally time invariant. We then design a deep neural network structure to learn the local models. Once the network model is constructed, it can be iteratively used over time to conduct global system prediction. We provide theoretical analysis of our algorithm and present a number of numerical examples to demonstrate the effectiveness of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Review of Bayesian Networks for Spatial Data

We report Bayesian networks are a popular class of multivariate probabilistic models as they allow for the translation of prior beliefs about conditional dependencies between variables to be easily encoded into their model structure. Due to their widespread usage, they are often applied to spatial data for inferring properties of the systems under study and also generating predictions for how these systems may behave in the future. We review published research on methodologies for representing spatial data with Bayesian networks and also summarize the application areas for which Bayesian networks are employed in the modeling of spatial data. We find that a wide variety of perspectives are taken, including a GIS-centric focus on efficiently generating geospatial predictions, a statistical focus on rigorously constructing graphical models controlling for spatial correlation, as well as a range of problem-specific heuristics for mitigating the effects of spatial correlation and dependency arising in spatial data analysis. Special attention is also paid to potential future directions for integration of Bayesian networks with spatial processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Simulation process and data flow for a large system dynamics model

This paper documents the workflow and supporting technologies that a large system dynamics model, the biomass scenario model, employs to streamline the data preparation, simulation, quality control, and analysis process at the National Renewable Energy Laboratory. The workflow centers on automation of routine aspects of the flow of data between data stores, simulations, and visualizations. It enforces quality checks on data, reproducibility of computations, and traceability of results, while maintaining complete archives of modeling and analysis artifacts. The resulting frictionless simulation/analysis environment supports large-scale sensitivity analysis, interactive creation of ensembles of simulations, and rapid visualization-based exploration of simulation results.

09 BIOMASS FUELS↗
DOE OSTI2020

Multiple Degradation Mechanisms in Reinforced Concrete Structures, Modeling and Risk Analysis

The overarching goal of this project is to complement ongoing Department of Energy (DOE) Light Water Reactor Sustainability (LWRS)-funded Grizzly concrete modeling development efforts by providing improved multi-physics models for incorporation into the Grizzly and BlackBear codes. Objectives of this work identified at the outset of this project include: 1. Coupling between mechanical damage and transport processes. The mechanical damage will be characterized by nonlinear mechanical constitutive models appropriate for concrete used in nuclear power plants (NPPs). 2. Improved representation of the coupling among the transport process, building on the current moisture and thermal transport models in Grizzly. The parameters for coupling among heat and mass transport in the multi-physics model will be experimentally determined. 3. Coupling among different scale levels of concrete constituents, fine and coarse aggregates, cement paste, hydration products, and pore structure. 4. Probabilistic analysis of the random nature of the heterogeneous concrete structure and the environmental factors (ambient temperature and humidity) and their multiple effects on concrete deterioration. 5. Benchmark verification, validation and uncertainty quantification of the thermo-hygro- chemo-mechanical (THCM) concrete formulation. The end goal of this work was to provide a comprehensive and robust simulation capability that can be applied at the engineering scale for analysis of realistic deterioration scenarios in NPP concrete structures.

36 MATERIALS SCIENCE↗