Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical methods”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

A Framework for Dynamic Constraint Reasoning Using Procedural Constraints

Many complex real-world decision and control problems contain an underlying constraint reasoning problem. This is particularly evident in a recently developed approach to planning, where almost all planning decisions are represented by constrained variables. This translates a significant part of the planning problem into a constraint network whose consistency determines the validity of the plan candidate. Since higher-level choices about control actions can add or remove variables and constraints, the underlying constraint network is invariably highly dynamic. Arbitrary domain-dependent constraints may be added to the constraint network and the constraint reasoning mechanism must be able to handle such constraints effectively. Additionally, real problems often require handling constraints over continuous variables. These requirements present a number of significant challenges for a constraint reasoning mechanism. In this paper, we introduce a general framework for handling dynamic constraint networks with real-valued variables, by using procedures to represent and effectively reason about general constraints. The framework is based on a sound theoretical foundation, and can be proven to be sound and complete under well-defined conditions. Furthermore, the framework provides hybrid reasoning capabilities, as alternative solution methods like mathematical programming can be incorporated into the framework, in the form of procedures.

Jonsson, Ari K.↗
NASA NTRS1997

Automated Reuse of Scientific Subroutine Libraries through Deductive Synthesis

Systematic software construction offers the potential of elevating software engineering from an art-form to an engineering discipline. The desired result is more predictable software development leading to better quality and more maintainable software. However, the overhead costs associated with the formalisms, mathematics, and methods of systematic software construction have largely precluded their adoption in real-world software development. In fact, many mainstream software development organizations, such as Microsoft, still maintain a predominantly oral culture for software development projects; which is far removed from a formalism-based culture for software development. An exception is the limited domain of safety-critical software, where the high-assuiance inherent in systematic software construction justifies the additional cost. We believe that systematic software construction will only be adopted by mainstream software development organization when the overhead costs have been greatly reduced. Two approaches to cost mitigation are reuse (amortizing costs over many applications) and automation. For the last four years, NASA Ames has funded the Amphion project, whose objective is to automate software reuse through techniques from systematic software construction. In particular, deductive program synthesis (i.e., program extraction from proofs) is used to derive a composition of software components (e.g., subroutines) that correctly implements a specification. The construction of reuse libraries of software components is the standard software engineering solution for improving software development productivity and quality.

Lowry, Michael R.↗
NASA NTRS2003

Modeling, Analyzing, and Mitigating Dissonance Between Alerting Systems

Alerting systems are becoming pervasive in process operations, which may result in the potential for dissonance or conflict in information from different alerting systems that suggests different threat levels and/or actions to resolve hazards. Little is currently available to help in predicting or solving the dissonance problem. This thesis presents a methodology to model and analyze dissonance between alerting systems, providing both a theoretical foundation for understanding dissonance and a practical basis from which specific problems can be addressed. A state-space representation of multiple alerting system operation is generalized that can be tailored across a variety of applications. Based on the representation, two major causes of dissonance are identified: logic differences and sensor error. Additionally, several possible types of dissonance are identified. A mathematical analysis method is developed to identify the conditions for dissonance originating from logic differences. A probabilistic analysis methodology is developed to estimate the probability of dissonance originating from sensor error, and to compare the relative contribution to dissonance of sensor error against the contribution from logic differences. A hybrid model, which describes the dynamic behavior of the process with multiple alerting systems, is developed to identify dangerous dissonance space, from which the process can lead to disaster. Methodologies to avoid or mitigate dissonance are outlined. Two examples are used to demonstrate the application of the methodology. First, a conceptual In-Trail Spacing example is presented. The methodology is applied to identify the conditions for possible dissonance, to identify relative contribution of logic difference and sensor error, and to identify dangerous dissonance space. Several proposed mitigation methods are demonstrated in this example. In the second example, the methodology is applied to address the dissonance problem between two air traffic alert and avoidance systems: the existing Traffic Alert and Collision Avoidance System (TCAS) vs. the proposed Airborne Conflict Management system (ACM). Conditions on ACM resolution maneuvers are identified to avoid dynamic dissonance between TCAS and ACM. Also included in this report is an Appendix written by Lee Winder about recent and continuing work on alerting systems design. The application of Markov Decision Process (MDP) theory to complex alerting problems is discussed and illustrated with an abstract example system.

Song, Lixia↗
NASA NTRS2002

Advances in space radiation shielding codes

Early space radiation shield code development relied on Monte Carlo methods and made important contributions to the space program. Monte Carlo methods have resorted to restricted one-dimensional problems leading to imperfect representation of appropriate boundary conditions. Even so, intensive computational requirements resulted and shield evaluation was made near the end of the design process. Resolving shielding issues usually had a negative impact on the design. Improved spacecraft shield design requires early entry of radiation constraints into the design process to maximize performance and minimize costs. As a result, we have been investigating high-speed computational procedures to allow shield analysis from the preliminary concept to the final design. For the last few decades, we have pursued deterministic solutions of the Boltzmann equation allowing field mapping within the International Space Station (ISS) in tens of minutes using standard Finite Element Method (FEM) geometry common to engineering design methods. A single ray trace in such geometry requires 14 milliseconds and limits application of Monte Carlo methods to such engineering models. A potential means of improving the Monte Carlo efficiency in coupling to spacecraft geometry is given.

manned↗
NASA NTRS1994

Space proton transport in one dimension

An approximate evaluation procedure is derived for a second-order theory of coupled nucleon transport in one dimension. An analytical solution with a simplified interaction model is used to determine quadrature parameters to minimize truncation error. Effects of the improved method on transport solutions with the BRYNTRN data base are evaluated. Comparisons with Monte Carlo benchmarks are given. Using different shield materials, the computational procedure is used to study the physics of space protons. A transition effect occurs in tissue near the shield interface and is most important in shields of high atomic number.

NASA Discipline Number 45-10↗
NASA NTRS1990

Rapid, bilateral changes in growth rate and curvature during gravitropism of cucumber hypocotyls: implications for mechanism of growth control

The growth response of etiolated cucumber (Cucumis sativus L.) hypocotyls to gravitropic stimulation was examined by means of time-lapse photography and high-resolution analysis of surface expansion and curvature. In comparison with video analysis, the technique described here has five- to 20-fold better resolution; moreover, the mathematical fitting method (cubic splines) allows direct estimation of local and integrated curvature. After switching seedlings from a vertical to horizontal position, both upper and lower surfaces of the stem reacted after a lag of about 11 min with a two- to three-fold increase in surface expansion rate on the lower side and a cessation of expansion, or slight compression, on the upper surface. This growth asymmetry was initiated simultaneously along the length of the hypocotyl, on both upper and lower surfaces, and did not migrate basipetally from the apex. Later stages in the gravitropic response involved a complex reversal of the growth asymmetry, with the net result being a basipetal migration of the curved region. This secondary growth reversal may reflect oscillatory and/or self-regulatory behaviour of growing cells. With some qualifications, the kinetics and pattern of growth response are consistent with a mechanism involving hormone redistribution, although they do not prove such a mechanism. The growth kinetics require a growth mechanism which can be stimulated by two- to three-fold or completely inhibited within a few minutes.

Non-NASA Center↗
NASA NTRS1996

LIbration Point Trajectory Design

Orbits about the Sun-Earth L1 and L2 libration points hve become very popular for space physics and astrophysics missions.

trajectory design mathematical methods libration l↗
NASA NTRS2009

Symbolic Processing Combined with Model-Based Reasoning

A computer program for the detection of present and prediction of future discrete states of a complex, real-time engineering system utilizes a combination of symbolic processing and numerical model-based reasoning. One of the biggest weaknesses of a purely symbolic approach is that it enables prediction of only future discrete states while missing all unmodeled states or leading to incorrect identification of an unmodeled state as a modeled one. A purely numerical approach is based on a combination of statistical methods and mathematical models of the applicable physics and necessitates development of a complete model to the level of fidelity required for prediction. In addition, a purely numerical approach does not afford the ability to qualify its results without some form of symbolic processing. The present software implements numerical algorithms to detect unmodeled events and symbolic algorithms to predict expected behavior, correlate the expected behavior with the unmodeled events, and interpret the results in order to predict future discrete states. The approach embodied in this software differs from that of the BEAM methodology (aspects of which have been discussed in several prior NASA Tech Briefs articles), which provides for prediction of future measurements in the continuous-data domain.

James, Mark↗
NASA NTRS2021

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail.

mission design↗
NASA NTRS2021

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail. GenETOC was developed in C# using the .NET framework with Windows Presentation Foundation (WPF) serving as the framework from which to create the graphical user interface (GUI). GenETOC user inputs can be categorized into three major data components: definition of the problem (areas of interest, satellite decision parameters, and sensor configurations), definition of performance objectives, and specification of the genetic algorithm (GA) parameters. In the problem definition component, the user is prompted to define the areas of interest against which the performance metrics will be computed, define the sensor parameters and attach them to specific spacecraft, select which satellite orbital parameters will be added to the decision space of the GA, and specify the range of desired values for each optimization parameter. For performance objectives, the user is presented with a list of available coverage and revisit performance based calculation options from which two metrics are chosen to serve as the objective functions that the GA will use to evaluate solutions during the optimization process. Finally, the definition of the GA parameters provides user control over the number of generations (number of optimization iterations), the population size (number of candidate constellations created in each generation), and the adaptive mutation and crossover threshold values (control parameters for how frequently each process occurs during the optimization). GenETOC has been extensively tested to verify the individual components of the optimization process. The GA has been tested against a suite of GA test problems to confirm convergence to the known two and three-dimensional Pareto fronts. The coverage and revisit performance metrics obtained in GenETOC are compared with STK desktop scenarios, confirming the constellations are being appropriately modeled within GenETOC simulations. A walkthrough of a simple, example problem is provided to illustrate the workings of GenETOC and to demonstrate the output available to the mission designer.

mission design↗
DOE OSTI2020

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗
DOE OSTI2021

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗
DOE OSTI2021

VERIFICATION MEASUREMENTS OF THE MASS AND ENRICHMENT OF URANIUM OXIDE CARD SOURCES

Measurements were performed to determine the mass and enrichment of 10 uranium oxide (U3O8) card sources. The measurements and analysis were completed as a verification of the card sources in support of Oak Ridge National Laboratory’s nuclear material control and accountability program. Although these cards are not nationally accredited as a nuclear standard, they are used as a working reference for measurements, such as holdup. The uranium card source measurements were taken with a broad energy germanium detector and the Genie 2000 Gamma Acquisition and Analysis software. A complete characterization of each of the 10 uranium card sources was performed using the 4 characteristic full energy peaks of 235U. Using the In Situ Object Counting System software to determine the mathematical efficiency of the measurement, the mass of 235U in each card was determined. The 235U mass in each card ranged from 10.42 to 12.63 g with a systematic error between 0.76 and 0.95 g and a random error of 0.01 g for each card source. The Multi-Group Analysis for Uranium (MGAU) software and the Fixed-Energy, Response Function Analysis with Multiple Efficiency (FRAM) isotopic analysis software were used to determine the isotopic composition of the uranium cards. The measured enrichment was compared to the declared enrichment for each card, with uncertainties ranging from 2.7% to 4.3% for the MGAU analysis and 2.3% to 4.1% for the FRAM analysis. This is a good example of how a well-benchmarked mathematical calibration method can be useful in characterizing uranium sources.

Hunneke, Rachel↗
DOE OSTI2023

Numerical Analysis of Regular Material Point Method and its Application to Multiphase Flows

The material point method (MPM) is gaining wide popularity in engineering research to model and simulate complex multiphase flow dynamics. The method relies on solving the governing equations of motion and transport in a Lagrangian framework using particles also known as material points. The fluid and kinematic properties are stored on the material points while the spatial gradient calculation and temporal integration are performed on a background grid. This Lagrangian framework allows for large deformations, easy integration of constitutive models, and direct import of complex geometries as particles. However, despite their increasing popularity, very few studies have addressed the issues of numerical resolution and stability of MPM techniques. The presence of additional factors such as the number of material points-per-cell, the location of the material points, the CFL-like condition used in time update, and the grid shape functions also increase the complexity of the error analysis when compared to other finite element methods. In this presentation, we analyze the various forms of error incurred in the application of MPM to continuum mechanics and multiphase flows. The effect of the previously mentioned factors on the error dynamics is studied. The application of these principles to canonical and industrial problems is also presented.

high pressure reverse osmosis↗
DOE OSTI2023

Simulation of Reverse Osmosis Membrane Compaction Using Material Point Method

Reverse Osmosis (RO) is a promising technology to address the impending water-crisis in the upcoming decades. RO at high salinities and high pressures is challenging due to membrane compaction that changes its porosity and permeability. In this study, we present a simulation methodology for membrane structural mechanics to understand pore size distribution and permeability variations under high pressure. We use the material point method (MPM), that solves the solid mechanics equations in a Lagrangian framework. MPM provides many features that make it well-suited for simulating mesoporous membranes. The Lagrangian framework allows for large deformations, easy integration of constitutive models and direct import of complex geometries as particles. The spatial discretization in our MPM solver is achieved using linear or cubic-spline shape functions while the time integration is carried out using the explicit Euler method. A series of images containing detailed pore structures obtained from X-ray tomography is first converted to a collection of material points. Compressive loads are applied to the top layer of the membrane to simulate the application of pressure. The membrane deformation and pore size distribution before and after load application are reported and compared with the experimental measurements. The presentation discusses the numerical methods used, the performance of the solver on high-performance computing machines, and the results of membrane compact in detail.

compaction↗
DOE OSTI2024

Spectral Analysis of Regular Material Point Method and its Application to Study High Pressure Reverse Osmosis Membrane Compaction and Embossing

Material Point Method (MPM) is gaining widespread interest in applied continuum mechanics. The fact that all the continuum properties are stored on the particles (or material points) and the governing equations are solved on these material points makes MPM extremely suited to problems involving severe material deformations, such as crack propagation, soil movement, and fluid flows. Despite its popularity, only a few studies have focused on the numerical properties of MPM. This presentation introduces a global spectral analysis of the regular material point method. Contrary to previous studies, the analysis focuses on the numerical properties of the method in the spectral space. The amplification factor is derived as a function of the non- dimensional wave numbers. It provides insights into the stability and dissipative properties of the method for various CFL and Fourier numbers. The effect of the grid shape functions, number of particles per cell and their locations inside the grid cell are also analyzed. The EXAGOOP MPM solver (https://github.com/NREL/Exagoop.git) is developed at the National Renewable Energy Laboratory as a part of the NAWI UHPRO project and is based on the AMReX framework. A single-level, uniform cartesian grid is used as the background mesh, while the particle class in AMReX is used to manage the material point operations. Linear hat and B-splines are used as grid shape functions, while the time integration is performed using explicit Euler time integration. EXAGOOP is both CPU and GPU compatible and has been demonstrated to work well on multiple compute architectures. The performance of EXAGOOP on various computing architectures is presented along with its application to study compaction and embossing of high-pressure reverse osmosis membranes. The MPM solution accurately reproduces the membrane deformation. The deformed pore size and structure simulated using MPM also agree well with experimental SEM images.

material point method↗
NASA NTRS1988

Prediction of incidence effects on oscillating airfoil aerodynamics by a locally analytical method

A complete mathematical model is formulated to analyze the effects of mean-flow incidence angle on the unsteady aerodynamics of an oscillating airfoil in an incompressible flow field. A velocity potential formulation is utilized. The steady flow is independent of the unsteady flow field but coupled to it through the boundary conditions on the oscillating airfoil. The numerical solution technique for both the steady and unsteady flow fields is based on a locally analytical method. The flow model and solution method are then verified through the excellent correlation obtained with the Theodorsen oscillating-flat-plate and Sears transverse-gust classical solutions. The effects of mean flow incidence on the steady and oscillating airfoil aerodynamics are then investigated.

Chiang, Hsiao-Wei D.↗