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

nautilus : boosting Bayesian importance nested sampling with deep learning

ABSTRACT We introduce a novel approach to boost the efficiency of the importance nested sampling (INS) technique for Bayesian posterior and evidence estimation using deep learning. Unlike rejection-based sampling methods such as vanilla nested sampling (NS) or Markov chain Monte Carlo (MCMC) algorithms, importance sampling techniques can use all likelihood evaluations for posterior and evidence estimation. However, for efficient importance sampling, one needs proposal distributions that closely mimic the posterior distributions. We show how to combine INS with deep learning via neural network regression to accomplish this task. We also introduce nautilus, a reference open-source python implementation of this technique for Bayesian posterior and evidence estimation. We compare nautilus against popular NS and MCMC packages, including emcee, dynesty, ultranest, and pocomc, on a variety of challenging synthetic problems and real-world applications in exoplanet detection, galaxy SED fitting and cosmology. In all applications, the sampling efficiency of nautilus is substantially higher than that of all other samplers, often by more than an order of magnitude. Simultaneously, nautilus delivers highly accurate results and needs fewer likelihood evaluations than all other samplers tested. We also show that nautilus has good scaling with the dimensionality of the likelihood and is easily parallelizable to many CPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

50 Years of metabolic control analysis

It has been 50 years since the publication of the seminal works by Savageau, Kacser & Burns and Heinrich & Rapoport, on the control of biochemical networks. What is remarkable about these three publications (especially the two papers by Kacser et al. and Rapoport et al.) is that they independently developed almost the same approach and came to the same conclusions. This approach is today called metabolic control analysis (MCA), and is a body of work that uses mathematics to reason about the properties of biochemical pathways in a deductive manner. Although originally focused on metabolic pathways, it was realized early on that it could be equally applied to genetic and signalling networks. In fact anything that one could associate a stoichiometry matrix with. In recent years, others have reinvented MCA, using different notation, highlighting the fact that there has been a good deal of conceptual convergence in this area.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Assessment of Accelerated Stress Testing Data for Silicon Photovoltaics Using Tensor Decomposition Methods

In this work, we examine the use of high-order tensor decompositions to analyze degradation pathways emerging from accelerated stress testing of silicon photovoltaic (PV) modules. Matrix-based decompositions are powerful tools for studying two-dimensional data arrays and form the foundation of a host of classical data analysis techniques. Tensors are high-order extrapolations of matrices that are able to account for more parameter dimensions, and a variety of tensor decomposition methods have been developed that similarly seek to extend insights from matrix decompositions to higher dimensions. Applying and interpreting tensor decomposition methods to sequences of PV module image data, we seek to uncover and isolate different degradation modes occurring from accelerated stress testing procedures. Further, we consider the contributions of different modes to PV module performance degradations.

data analysis↗
DOE OSTI2020

Hypernetwork science via high-order hypergraph walks

We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods which then generalize to hypergraphs include connected component analyses, graph distance-based metrics such as closeness centrality, and motif-based measures such as clustering coefficients. We apply high-order analogs of these methods to real world hypernetworks, and show they reveal nuanced and interpretable structure that cannot be detected by graph-based methods. Lastly, we apply three generative models to the data and find that basic hypergraph properties, such as density and degree distributions, do not necessarily control these new structural measurements. Our work demonstrates how analyses of hypergraph-structured data are richer when utilizing tools tailored to capture hypergraph-native phenomena, and suggests one possible avenue towards that end.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Next-generation geospatial-temporal information technologies for disaster management

Traditional geographic information systems (GIS) have been disrupted by the emergence of Big Data in the form of geo-coded raster, vector, and time-series Internet-of-Things data. This article discusses the application of new scalable technologies that go far beyond relational databases and file-based storage on spinning disk or tape to incorporate both storage and processing data in the same platform. The roles of the Apache Hadoop Distributed File Systems and NoSQL key-value stores such as the Apache Hbase are discussed, along with indexing schemes that optimally support geospatial-temporal use. Here, we highlight how this new approach can rapidly search multiple GIS data layers to obtain insights in the context of early warning, impact evaluation, response, and recovery to earthquake and wildfire disasters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

MCNP6.3 Workshop [Slides]

This workshop presentation revisits several new features of MCNP6.2 and tools. Additionally, it offers a preview of the new features and improvements included in the upcoming MCNP6.3 code release that are most relevant to the nuclear radiation protection and shielding communities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Integrators

Many electromagnetic measurements detect signals that are the time derivative of the actual quantity of interest. Examples include so-called “B-dot” and “D-dot” detectors that are used for measuring transient magnetic and electric fields. Integration of these signals to recover the quantity of interest is performed either by hardware integrators in the signal line, or by software coding in the analysis programming. Hardware integration is usually done using a classic resistive-capacitive (RC) circuit, or internally in the detector by induction (L/R) or stray capacitance (RC). These hardware integration methods are only approximate, and must be corrected for distortion. This is usually called “droop correction.” In this note, we will examine this correction in some detail. Transient analysis via Laplace transforms will be used to simplify the mathematics. A rudimentary understanding of this method is assumed.

42 ENGINEERING↗
DOE OSTI2022

The Astropy Project: Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package

The Astropy Project supports and fosters the development of open-source and openly developed Python packages that provide commonly needed functionality to the astronomical community. A key element of the Astropy Project is the core package astropy, which serves as the foundation for more specialized projects and packages. In this article, we summarize key features in the core package as of the recent major release, version 5.0, and provide major updates on the Project. We then discuss supporting a broader ecosystem of interoperable packages, including connections with several astronomical observatories and missions. We also revisit the future outlook of the Astropy Project and the current status of Learn Astropy. We conclude by raising and discussing the current and future challenges facing the Project.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Weak Form Scientific Machine Learning: Test Function Construction for System Identification

Weak form Scientific Machine Learning (WSciML) is a recently developed framework for data-driven modeling and scientific discovery. It leverages the weak form of equation error residuals to provide enhanced noise robustness in system identification via convolving model equations with test functions, reformulating the problem to avoid direct differentiation of data. The performance, however, relies on wisely choosing a set of compactly supported test functions. In this work, we mathematically motivate a novel data-driven method for constructing Single-scale-Local reference functions for creating the set of test functions. Our approach numerically approximates the integration error introduced by the quadrature and identifies the support size for which the error is minimal, without requiring access to the model parameter values. Through numerical experiments across various models, noise levels, and temporal resolutions, we demonstrate that the selected supports consistently align with regions of minimal parameter estimation error. We also compare the proposed method against the strategy for constructing Multi-scale-Global (and orthogonal) test functions introduced in our prior work, demonstrating the improved computational efficiency.

FOS: Computer and information sciences↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
DOE OSTI2026

A Structure-Preserving Decorated Particle Method for the Vlasov-Poisson System

We revisit the Scovel-Weinstein framework (Scovel & Weinstein, CPAM 1994) for reducing the Vlasov-Poisson system while preserving its Hamiltonian structure. Standard particle-in-cell (PIC) algorithms approximate the distribution function by macro-particles with position and velocity. In contrast, Scovel-Weinstein decorated particles involve additional shape degrees of freedom, while maintaining a finite-dimensional reduction with Hamiltonian structure inherited from the continuum model. Although the original work established this structure three decades ago, its computational potential has remained largely unexplored. We present a practical implementation of the Scovel-Weinstein model and compare it with a standard PIC algorithm. Numerical experiments demonstrate that macro-particles in standard PIC can be replaced by far fewer decorated particles while retaining comparable accuracy. This decorated particle approach offers a new structure-preserving paradigm for kinetic plasma simulation.

65M75, 70H05, 70G65↗
DOE OSTI2021

Structure Perception in 3D Point Clouds: Preprint

Understanding human perception is critical to the design of ef- fective visualizations. The relative benefits of using 2D versus 3D techniques for data visualization is a complex decision space, with varying levels of uncertainty and disagreement in both the liter- ature and in practice. This study aims to add easily reproducible, empirical evidence on the role of depth cues in perceiving structures or patterns in 3D point clouds. We describe a method to synthesize a 3D point cloud that contains a 3D structure, where 2D projec- tions of the data strongly resemble a Gaussian distribution. We performed a within-subjects structure identification study with 128 participants that compared scatterplot matrices (canonical 2D projections) and 3D scatterplots under three types of motion: rota- tion, xy-translation, and z-translation. We found that users could consistently identify three separate hidden structures under ro- tation, while those structures remained hidden in the scatterplot matrices and under translation. This work contributes a set of 3D point clouds that provide definitive examples of 3D patterns per- ceptible in 3D scatterplots under rotation but imperceptible in 2D scatterplots.

data analysis↗
DOE OSTI2022

Grassmannian Shape Representations for Aerodynamic Applications: Preprint

Airfoil shape design is a classical problem in engineering, science, and manufacturing. Our motivation is to combine principled physics-based considerations for the shape design problem with modern computational techniques informed by a data-driven approach. Traditional analyses of airfoil shapes emphasize a flow-based sensitivity to deformations which can be represented generally by affine transformations (rotation, scaling, shearing, shifting). We present a novel representation of shapes which decouples affine-style deformations from a rich set of data-driven deformations over a submanifold of the Grassmannian. The Grassmannian representation, informed by a database of physically relevant airfoils, offers (i) a rich set of novel 2D airfoil deformations not previously captured in the data, (ii) improved low-dimensional parameter domain for inferential statistics, and (iii) consistent 3D blade representation and perturbation over a sequence of nominal shapes.

blade representation↗
DOE OSTI2022

Grassmannian Shape Representations for Aerodynamic Applications

Airfoil shape design is a classical problem in engineering, science, and manufacturing. Our motivation is to combine principled physics-based considerations for the shape design problem with modern computational techniques informed by a data-driven approach. Traditional analyses of airfoil shapes emphasize a flow-based sensitivity to deformations which can be represented generally by affine transformations (rotation, scaling, shearing, shifting). We present a novel representation of shapes which decouples affine-style deformations from a rich set of data-driven deformations over a submanifold of the Grassmannian. The Grassmannian representation, informed by a database of physically relevant airfoils, offers (i) a rich set of novel 2D airfoil deformations not previously captured in the data, (ii) improved low-dimensional parameter domain for inferential statistics, and (iii) consistent 3D blade representation and perturbation over a sequence of nominal shapes.

blade representation↗
DOE OSTI2022

Noodles: Cooking Up Collaborative Visualization

NOODLES is a new cross-domain collaborative visualization and analysis capability being developed at NREL. The NOODLES specification is a minimal protocol that can tie different software packages and platforms together. As an example, a simulation code that speaks this protocol could stream iso-surfaces to an immersive VR space and a web browser. Another example is a team (with some members across the country) classifying and discovering features in a statistical data plot, driven from a researcher's existing Python-based workflow. In this talk, we will discuss some background on the problems that this protocol intends to solve, basic principles of the specification, the current state of supporting libraries, and some demonstrations of the protocol in action.

3D↗