Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics and 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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Modeling Geometric Arrangements of TiO2-Based Catalyst Substrates and Isotropic Light Sources to Enhance the Efficiency of a Photocatalystic Oxidation (PCO) Reactor

The closed confined environments of the ISS, as well as in future spacecraft for exploration beyond LEO, provide many challenges to crew health. One such challenge is the availability of a robust, energy efficient, and re-generable air revitalization system that controls trace volatile organic contaminants (VOCs) to levels below a specified spacecraft maximum allowable concentration (SMAC). Photocatalytic oxidation (PCO), which is capable of mineralizing VOCs at room temperature and of accommodating a high volumetric flow, is being evaluated as an alternative trace contaminant control technology. In an architecture of a combined air and water management system, placing a PCO unit before a condensing heat exchanger for humidity control will greatly reduce the organic load into the humidity condensate loop ofthe water processing assembly (WPA) thereby enhancing the life cycle economics ofthe WPA. This targeted application dictates a single pass efficiency of greater than 90% for polar VOCs. ~ Although this target was met in laboratory bench-scaled reactors, no commercial or SBIR-developed prototype PCO units examined to date have achieved this goal. Furthermore, the formation of partial oxidation products (e.g., acetaldehyde) was not eliminated. It is known that single pass efficiency and partial oxidation are strongly dependent upon the contact time and catalyst illumination, hence the requirement for an efficient reactor design. The objective of this study is to maximize the apparent contact time and illuminated catalyst surface area at a given reactor volume and volumetric flow. In this study, a Ti02-based photocatalyst is assumed to be immobilized on porous substrate panels and illumination derived from linear isotropic light sources. Mathematical modeling using computational fluid dynamics (CFD) analyses were performed to investigate the effect of: 1) the geometry and configuration of catalyst-coated substrate panels, 2) porosity of the supporting substrate, and 3) varying the light source and spacing on contact time and illuminated catalyst area.

Richards, Jeffrey T.↗
NASA NTRS2019

Complex Dynamics of Air Traffic Flow

Air traffic in the United States has continued to grow at a steady pace since 1980, except for a dip immediately after the tragic events of September 11, 2001. There are different growth scenarios associated both with the magnitude and the composition of the future air traffic. The Terminal Area Forecast (TAF), prepared every year by the FAA, projects the growth of traffic in the United States. Both Boeing and Airbus publish market outlooks for air travel annually. Although predicting the future growth of traffic is difficult, there are two significant trends: heavily congested major airports continue to see an increase in traffic, and the emergence of regional jets and other smaller aircraft with fewer passengers operating directly between non-major airports. The interaction between air traffic demand and the ability of the system to provide the necessary airport and airspace resources can be modeled as a network. The size of the resulting network varies depending on the choice of its nodes. It would be useful to understand the properties of this network to guide future design and development. Many questions, such as the growth of delay with increasing traffic demand and impact of the en route weather on future air traffic, require a systematic understanding of the properties of the air traffic network. There has been a major advance in the understanding of the behavior of networks with a large number of components. Several theories have been advanced about the evolution of large biological and engineering networks by authors in diversified disciplines like physics, mathematics, biology and computer science. Several networks exhibit a scale-free property in the sense that the probabilistic distribution of their nodes as a function of connections decreases slower than an exponential. These networks are characterized by the fact that a small number of components have a disproportionate influence on the performance of the network. Scale-free networks are tolerant to random failure of components, but are vulnerable to selective attack on components. This paper examines two network representations for the baseline air traffic system. A network defined with the 40 major airports as nodes and with standard flight routes as links has a characteristic scale: all nodes have 60 or more links and no node has more than 460 links. Another network is defined with baseline aircraft routing structure exhibits an exponentially truncated scale-free behavior. Its degree ranges from 2 connections to 2900 connections, and 225 nodes have more than 250 connections. Furthermore, those high-degree nodes are homogeneously distributed in the airspace. A consequence of this scale-free behavior is that the random loss of a single node has little impact, but the loss of multiple high-degree nodes (such as occurs during major storms in busy airspace) can adversely impact the system. Two future scenarios of air traffic growth are used to predict the growth of air traffic in the United States. It is shown that a three-times growth in the overall traffic may result in a ten-times impact on the density of traffic in certain parts of the United States.

Scale-free Networks↗
NASA NTRSDate not supplied

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗
DOE OSTI2024

Improvements in Optical Surface Measurement Using Reflected Computer Vision Targets

Since 2021, NREL has been developing a system to measure heliostats by measuring the deflection of printed computer vision targets, called the Reflected Target Non-intrusive Assessment (ReTNA) [6], [7]. While this system will have lower resolution than a fringe deflectometry system, it has several important advantages that make it a complimentary technology: 2D surface slope measurement can be generated from a single image, it can operate in ambient lighting, target points can be directly located in 3D space with photogrammetry allowing for a non-flat target, and it's well suited to using a smaller target, and multiple images to measure larger optical surfaces. ReTNA has undergone several significant changes and improvements, described below. This talk will summarize new system layouts designed for commercial use, new computer vision algorithms used to automate the analysis process and validation campaigns for the ReTNA software.

computer vision↗
DOE OSTI2025

Performance Evaluation of Vertical Federated Machine Learning Against Adversarial Threats on Wide-Area Control System: Preprint

Federated machine learning (FL) is gaining significant popularity to develop cybersecurity solutions in power grids because of its advanced capability to support decentralized data handing at local devices, its privacy preservation, and its low-bandwidth requirement. However, the evolving adversarial machine learning (AML) threats raise significant concerns for the cybersecurity of FL architectures. The FL-based split neural network (SplitNN) achieves high performance through the decentralized training of local neural network models while preserving data privacy across multiple entities. In this paper, we propose a methodology for evaluating the performance of a vertical FLbased anomaly detector against different types of AML attacks, including denial-of-service attacks, adversarial data injection attacks, and replay attacks on the trained local models deployed in the grid network. For a case study, we consider the modified IEEE 13-bus system, and we develop SplitNN-based binary and multiclass classification models to detect, locate, and identify different types of data integrity attacks on the volt-watt control with two pooling layers: maximum pooling and AvgPool. Our experimental results, computed through performance metrics, reveal that the severity of these AML attacks varies with the integrated pooling mechanism, the type of classification model, and the nature of the cyberattack. Further, the AML attacks negatively impacted the prediction time per sample for the pretrained SplitNN during the online testing.

adversarial threats↗
NASA NTRS1975

Computer automation for feedback system design

Mathematical techniques and explanations of various steps used by an automated computer program to design feedback systems are summarized. Special attention was given to refining the automatic evaluation suboptimal loop transmission and the translation of time to frequency domain specifications.

Source record↗
DOE OSTI2025

Inference of phase field fracture models

The phase field approach to modeling fracture uses a diffuse damage field to represent cracks. This representation mollifies singularities that arise in computations with sharp interface models and some of the resultant difficulties in the mathematical and numerical treatment of fracture. Phase field fracture models have proven effective at representing crack propagation, branching, and merging. Specific formulations, beginning with brittle fracture, have also been shown to converge to classical solutions. Extensions to cover the range of material failure, including ductile and cohesive fracture, lead to an array of possible models. There exists a large body of literature focusing on this class of models and on the impact of model form on the predicted crack evolution. However, there have not been systematic studies into how optimal models may be chosen. Here, we take a first step in this direction by developing formal methods for identification of the best parsimonious model of phase field fracture given full-field data on the damage and deformation fields. We consider some of the main models that have been used for the degradation of elastic response due to damage and its propagation. Our approach builds upon Variational System Identification (VSI), a weak form variant of the Sparse Identification of Nonlinear Dynamics (SINDy). Furthermore, in this first communication we focus on synthetically generated data but we also consider central issues associated with the use of experimental full-field data, such as data sparsity and noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Modern chemical graph theory

Abstract Graph theory has a long history in chemistry. Yet as the breadth and variety of chemical data is rapidly changing, so too do graph encoding methods and analyses that yield qualitative and quantitative insights. Using illustrative cases within a basic mathematical framework, we showcase modern chemical graph theory's utility in Chemists' analysis and model development toolkit. The encoding of both experimental and simulation data is discussed at various levels of granularity of information. This is followed by a discussion of the two major classes of graph theoretical analyses: identifying connectivity patterns and partitioning methods. Measures, metrics, descriptors, and topological indices are then introduced with an emphasis upon enhancing interpretability and incorporation into physical models. Challenging data cases are described that include strategies for studying time dependence. Throughout, we incorporate recent advancements in computer science and applied mathematics that are propelling chemical graph theory into new domains of chemical study. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Structure and Mechanism > Computational Materials Science Structure and Mechanism > Molecular Structures

Leite, Leonardo S. G.↗
NASA NTRS1983

Review and verification of CARE 3 mathematical model and code

The CARE-III mathematical model and code verification performed by Boeing Computer Services were documented. The mathematical model was verified for permanent and intermittent faults. The transient fault model was not addressed. The code verification was performed on CARE-III, Version 3. A CARE III Version 4, which corrects deficiencies identified in Version 3, is being developed.

Rose, D. M.↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Kinetic Plasma Simulation in the MOOSE Framework: Verification of Electrostatic Particle In Cell Capabilities

In magnetic confinement nuclear fusion reactors, the interaction between the plasma edge and plasma facing components is extremely important. At the plasma edge, a kinetic representation such as particle-in-cell (rather than a fluid representation) is required to accurately capture the plasma behavior. General purpose particle-in-cell plasma simulation capabilities have been developed in the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework. This new capability is a part of the development of a new MOOSE-based framework for modeling plasma facing components, the Fusion ENergy Integrated multiphys-X (FENIX) framework. In this work, the verification of foundational particle-in-cell capabilities in FENIX is presented. This new plasma simulation capability has three main components: moving particles in discrete steps on the finite element mesh, mapping charge density from the particle's location to the finite element mesh, and solving for the electrostatic potential based on the charge density mapped from particles to the mesh. In this paper, simple verification problems demonstrating each of these new capabilities are presented, and future work includes electromagnetic capabilities and Monte Carlo collisions with neutral gas particles.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗
NASA NTRS1985

Transient Heat Transfer in Zero Gravity Environment

The objective is to provide computer codes and/or correlations for application in the design of transient heat transfer systems. The mathematical models in the computer codes are being tested by experimental data obtained in the laboratory using optical techniques. The elimination of natural convection (buoyancy) in the experimental data obtained in zero-g (KC-135) facilitates the study of thermal expansion effects which is of interest in the development and testing of the mathematical models of the transient heat transfer. Initial flight in the KC 135 (June 1983) suggested some modifications to the experimental apparatus and the data acquisition technique (high speed video will replace high speed movies for recording optical records generated during the experiments). A series of KC-135 flights with this experiment on board are scheduled for summer/fall 1984. The acquisition of the aforementioned data using interferometry and beam deflection optical techniques is anticipated. The measurements provide time dependent temperature fields above a horizontal heater surface submerged in a static fluid (Freon 13). The heater surface is electrically heated for a time interval approximately 0.100 sec. during which the data are optically recorded.

Giarratano, P. G.↗
DOE OSTI2024

Stochastic finite volume method for uncertainty quantification of transient flow in gas pipeline networks

We develop a weakly intrusive framework to simulate the propagation of uncertainty in solutions of generic hyperbolic partial differential equation systems on graph-connected domains with nodal coupling and boundary conditions. The method is based on the Stochastic Finite Volume (SFV) approach and can be applied for uncertainty quantification (UQ) of the dynamical state of fluid flow over actuated transport networks. The numerical scheme has specific advantages for modeling intertemporal uncertainty in time-varying boundary parameters, which cannot be characterized by strict upper and lower (interval) bounds. We describe the scheme for a single pipe, and then formulate the controlled junction Riemann problem (JRP) that enables the extension to general network structures. In conclusion, we demonstrate the method's capabilities and performance characteristics using a standard benchmark test network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A geometric perspective on kinetic matter–radiation interaction and moment systems

Here, in this paper, we provide a geometric perspective on the kinetic interaction of matter and radiation, based on a pair bracket approach. We discuss the interaction of kinetic theories via dissipative brackets, with our fundamental example being the coupling of matter, described by the Boltzmann equation, and radiation, described by the radiation transport equation. We explore the transition from kinetic systems to their corresponding moment systems, provide a Hamiltonian description of such moment systems, and give a geometric interpretation of the moment closure problem for kinetic theories. As an application, we discuss in detail diffusion radiation hydrodynamics as an example of a pair bracket formulation on a space of moments corresponding to kinetic matter–radiation interaction. Additionally, using the variable moment closure framework of Burby [J. W. Burby, Variable-moment fluid closures with Hamiltonian structure, Sci. Rep. 13 (2023) 18286, doi:10.1038/s41598-023-45416-5], we show how to construct Hamiltonian moment closures for kinetic transport equations with arbitrary Hamiltonian. Using this general construction, we derive novel Hamiltonian moment closures for pure radiation transport.

97 MATHEMATICS AND COMPUTING↗