Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational paradigms”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Probabilistic Fatigue: Computational Simulation

Fatigue is a primary consideration in the design of aerospace structures for long term durability and reliability. There are several types of fatigue that must be considered in the design. These include low cycle, high cycle, combined for different cyclic loading conditions - for example, mechanical, thermal, erosion, etc. The traditional approach to evaluate fatigue has been to conduct many tests in the various service-environment conditions that the component will be subjected to in a specific design. This approach is reasonable and robust for that specific design. However, it is time consuming, costly and needs to be repeated for designs in different operating conditions in general. Recent research has demonstrated that fatigue of structural components/structures can be evaluated by computational simulation based on a novel paradigm. Main features in this novel paradigm are progressive telescoping scale mechanics, progressive scale substructuring and progressive structural fracture, encompassed with probabilistic simulation. These generic features of this approach are to probabilistically telescope scale local material point damage all the way up to the structural component and to probabilistically scale decompose structural loads and boundary conditions all the way down to material point. Additional features include a multifactor interaction model that probabilistically describes material properties evolution, any changes due to various cyclic load and other mutually interacting effects. The objective of the proposed paper is to describe this novel paradigm of computational simulation and present typical fatigue results for structural components. Additionally, advantages, versatility and inclusiveness of computational simulation versus testing are discussed. Guidelines for complementing simulated results with strategic testing are outlined. Typical results are shown for computational simulation of fatigue in metallic composite structures to demonstrate the versatility of this novel paradigm in predicting a priori fatigue life.

Chamis, Christos C.↗
NASA NTRS2002

Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(O) preconditioned CG (PCG) using different programming paradigms and architectures. Results show that for this class of applications: ordering significantly improves overall performance on both distributed and distributed shared-memory systems, that cache reuse may be more important than reducing communication, that it is possible to achieve message-passing performance using shared-memory constructs through careful data ordering and distribution, and that a hybrid MPI+OpenMP paradigm increases programming complexity with little performance gains. A implementation of CG on the Cray MTA does not require special ordering or partitioning to obtain high efficiency and scalability, giving it a distinct advantage for adaptive applications; however, it shows limited scalability for PCG due to a lack of thread level parallelism.

Oliker, Leonid↗
NASA NTRS1999

Aerodynamic Shape Optimization Using A Combined Distributed/Shared Memory Paradigm

Current parallel computational approaches involve distributed and shared memory paradigms. In the distributed memory paradigm, each processor has its own independent memory. Message passing typically uses a function library such as MPI or PVM. In the shared memory paradigm, such as that used on the SGI Origin 2000 machine, compiler directives are used to instruct the compiler to schedule multiple threads to perform calculations. In this paradigm, it must be assured that processors (threads) do not simultaneously access regions of memory in such away that errors would occur. This paper utilizes the latest version of the SGI MPI function library to combine the two parallelization paradigms to perform aerodynamic shape optimization of a generic wing/body.

Cheung, Samson↗
NASA NTRSDate not supplied

When the Eyes Don't Have It: Autonomous Control of Deep Space Vehicles for Human Spaceflight

NASA has been charged with expanding human presence into the solar system. The next phase of exploration will focus on learning how to develop and sustain habitats on the moon for eventual missions to Mars. The Gateway Lunar Orbiting Platform (G-LOP) is a modular spacecraft being built for cis-lunar orbit and offers a true deep space environment for gaining experience for human missions to Mars. The mission concept for Gateway involves long uncrewed periods between missions; therefore, Gateway requires increased self-reliance to separate the spacecraft from Earth-bound control and oversight. This complicates the human-in-the-loop (HITL) concept and requires major adjustments to the traditional automation human-computer interaction paradigm. This paper discusses the design, development, and verification of complex human-computer interactions with the autonomous systems managers which will control the Gateway spacecraft.

Julia M. Badger↗
NASA NTRS2006

The 'Biologically-Inspired Computing' Column

The field of Biology changed dramatically in 1953, with the determination by Francis Crick and James Dewey Watson of the double helix structure of DNA. This discovery changed Biology for ever, allowing the sequencing of the human genome, and the emergence of a "new Biology" focused on DNA, genes, proteins, data, and search. Computational Biology and Bioinformatics heavily rely on computing to facilitate research into life and development. Simultaneously, an understanding of the biology of living organisms indicates a parallel with computing systems: molecules in living cells interact, grow, and transform according to the "program" dictated by DNA. Moreover, paradigms of Computing are emerging based on modelling and developing computer-based systems exploiting ideas that are observed in nature. This includes building into computer systems self-management and self-governance mechanisms that are inspired by the human body's autonomic nervous system, modelling evolutionary systems analogous to colonies of ants or other insects, and developing highly-efficient and highly-complex distributed systems from large numbers of (often quite simple) largely homogeneous components to reflect the behaviour of flocks of birds, swarms of bees, herds of animals, or schools of fish. This new field of "Biologically-Inspired Computing", often known in other incarnations by other names, such as: Autonomic Computing, Pervasive Computing, Organic Computing, Biomimetics, and Artificial Life, amongst others, is poised at the intersection of Computer Science, Engineering, Mathematics, and the Life Sciences. Successes have been reported in the fields of drug discovery, data communications, computer animation, control and command, exploration systems for space, undersea, and harsh environments, to name but a few, and augur much promise for future progress.

Hinchey, Mike↗
DOE OSTI2024

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Comparison of plug flow and multi-node stratified tank modeling approaches regarding computational efficiency and accuracy

Residential water heaters contain water stratified by temperature-driven density differences. This implies that a water tank can reach a state in which the top and bottom sections have different temperatures, unless mixing happens. A high degree of thermal stratification can improve the efficiency of some water heaters, by saving the amount of energy required for the heat-up process. Studies of stratification became popular in the 1970s and it remains an active research topic today. The research has led to the development of different models and techniques to better predict and define a stratified tanks behavior. By comparing these models and techniques used previously to describe thermal stratification, the phenomenon could be better understood, exploited, and used to increase efficiency and thermal energy capacity in modern water tanks. From the existing models, we found the one-dimensional standard plug-flow and a multi node model to be appropriate for analyzing the processes of the heat up and cool-down in a water tank. These two models are based on energy balances. This work involved comparing the accuracy and computational effort needed to implement these models. To assess accuracy, we compared both types of existing models to experimental data (also collected in this work) which included a heat up process using an external heat pump. This external process included a layering process that has an eddy diffusivity at five times the rate of thermal diffusion. For this project, we implemented the models in MATLAB, the multi-paradigm numerical computing environment. We quantified model accuracy using the root mean squared error between modeled data and experimental data for six measured tank temperatures. Comparing the accuracy and the computational time taken to run the simulation provides a method to contrast the performance of each model and a way to rate it. The multi node model was run using from 6 to 96 spatial nodes; the plug flow model was run using 1 to 0.001 º C temperature bin sizes. Additionally, timesteps were varied from 4 to 236 s. The results quantify the tradeoff between accuracy and computational time, providing guidance for simulations to intelligently select the best model type and simulation parameters. This research can be used to validate the pre-existing models and possibly improve the modern water tank.

Bulnes, Fernando Karg↗
DOE OSTI2025

Quantum dynamics simulation of the advection-diffusion equation

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 −5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

Alipanah, Hirad [Univ. of Pittsburgh, PA (United S↗
DOE OSTI2021

An extended polynomial chaos expansion for PDF characterization and variation with aleatory and epistemic uncertainties

This paper presents an extended polynomial chaos formalism for epistemic uncertainties and a new framework for evaluating sensitivities and variations of output probability density functions (PDF) to uncertainty in probabilistic models of input variables. An ”extended” polynomial chaos expansion (PCE) approach is developed that accounts for both aleatory and epistemic uncertainties, modeled as random variables, thus allowing a unified treatment of both types of uncertainty. We explore in particular epistemic uncertainty associated with the choice of prior probabilistic models for input parameters. A PCE-based Kernel Density (KDE) construction provides a composite map from the PCE coefficients and germ to the PDF of quantities of interest (QoI). Here, the sensitivities of these PDF with respect to the input parameters are then evaluated. Input parameters of the probabilistic models are considered. By sampling over the epistemic random variable, a family of PDFs is generated and the failure probability is itself estimated as a random variable with its own PCE. Integrating epistemic uncertainties within the PCE framework results in a computationally efficient paradigm for propagation and sensitivity evaluation. Two typical illustrative examples are used to demonstrate the proposed approach.

Aleatory uncertainty↗
DOE OSTI2026

A mathematical framework for thermodynamic computing with applications to chemical reaction networks

The widespread adoption of energy-intensive computing applications has led to a growing need for energy-efficient computing approaches. Thermodynamic computing offers a promising approach for low-energy computation by leveraging the intrinsic computational capabilities of physical, chemical, or biological systems. However, the mathematical foundations of thermodynamic computing require further development to fully realize the potential energy efficiencies, as well as to assess factors like noise and operational speed. In this paper, we establish a mathematical framework for utilizing thermodynamic processes to perform fundamental operations, including addition, subtraction, multiplication, and division. We highlight the use of chemical reactions as potential computational units and explore synthetic chemical and biochemical systems as practical implementations. Additionally, we demonstrate how these principles can be applied to solving complex mathematical problems, such as ordinary differential equations (ODEs) and suggest the necessary components to implement the thermodynamic computing framework using chemical reactions based in a microfluidic device. This work enhances our understanding of thermodynamic processes for natural computing as a basis for scalable, energy-efficient computation in paradigm disruptive next-generation systems.

Cannon, William R. [Pacific Northwest National Lab↗
DOE OSTI2023

A high-resolution large-eddy simulation framework for wildland fire predictions using TensorFlow

Background: Wildfires are becoming more severe, so we need improved tools to predict them over a wide range of conditions and scales. One approach towards this goal entails the use of coupled fire/atmosphere modelling tools. Although significant progress has been made in advancing their physical fidelity, existing tools have not taken full advantage of emerging programming paradigms and computing architectures to enable high-resolution wildfire simulations. Aims: The aim of this study was to present a new framework that enables landscape-scale wildfire simulations with physical representation of combustion at an affordable cost. Methods: We developed a coupled fire/atmosphere simulation framework using TensorFlow, which enables efficient and scalable computations on Tensor Processing Units. Key Results: Simulation results for a prescribed fire were compared with experimental data. Predicted fire behavior and statistical analysis for fire spread rate, scar area, and intermittency showed overall reasonable agreement. Scalability analysis was performed, showing close to linear scaling. Conclusions: While mesh refinement was shown to have less impact on global quantities, such as fire scar area and spread rate, it benefits predictions of intermittent fire behavior, buoyancy-driven dynamics, and small-scale turbulent motion. Implications: This new simulation framework is efficient in capturing both global quantities and unsteady dynamics of wildfires at high spatial resolutions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Iterative multi-task learning and inference from seismic images

Seismic interpretation aims to extract quantitative and interpretable attributes from a seismic image produced using some migration method to inform characteristics of a subsurface reservoir or target of interest. Current paradigms for computing seismic attributes mostly rely on single-task algorithms. We develop an iterative, multi-task machine learning method to learn and infer multiple attributes from a seismic image. This method is composed of two stages: a multi-task inference stage and a multi-modal, multi-task refinement stage. The basic mechanism of this method is that we train a multi-task inference neural network (NN) to estimate a set of attributes, including a relative geological time (RGT), a denoised higher-resolution (DHR) seismic image, and multiple fault attributes (including probability, dip, and strike), from a low-resolution, noisy seismic image; then we input the inferred attributes to a multi-task refinement NN to enhance the raw inference results iteratively. The two multi-task NNs are trained separately based on synthetic seismic images and associated attributes generated by a geological modeling algorithm. The software we intend to release is a PyTorch implementation of this multi-task learning method for both 2D and 3D cases along with scripts to run the training/validation. The algorithm and software can be a useful tool for automatic seismic interpretation.

Gao, Kai↗
NASA NTRS1985

International Symposium on Remote Sensing of Environment, Third Thematic Conference: Remote Sensing for Exploration Geology, Colorado Springs, CO, April 16-19, 1984, Proceedings. Volumes 1 & 2

A photogeologic and remote sensing model of porphyry type mineral sytems is considered along with a Landsat application to development of a tectonic model for hydrocarbon exploration of Devonian shales in west-central Virginia, remote sensing and the funnel philosophy, Landsat-based tectonic and metallogenic synthesis of the southwest United States, and an evolving paradigm for computer vision. Attention is given to the neotectonics of the Tibetan plateau deduced from Landsat MSS image interpretation, remote sensing in northern Arizona, the use of an airborne laser system for vegetation inventories and geobotanical prospecting, an evaluation of Thematic Mapper data for hydrocarbon exploration in low-relief basins, and an evaluation of the information content of high spectral resolution imagery. Other topics explored are related to a major source of new radar data for exploration research, the accuracy of geologic maps produced from Landsat data, and an approach for the geometric rectification of radar imagery.

Source record↗
NASA NTRS2003

Changing the Paradigm: Preparing Students for the Computing Profession in the 21st Century

The dramatic technological developments of the past decade have led to a tremendous growth in the demand for computer science professionals well-versed in advanced technology and techniques. NASA, traditionally a haven for cutting-edge innovators, is now competing with every industrial and government sector for computer science talent. The computer science program at University of Texas at San Antonio (UTSA) faces challenges beyond those intrinsically presented by rapid technological change, because a significant number of UTSA students come from low-income families with no Internet or computer access at home. An examination of enrollment statistics for the computer science program at UTSA showed that very few students who entered as freshmen successfully graduated. The upper division courses appeared to be populated by graduate students removing deficiencies and by transfer students. The faculty was also concerned that the students who did graduate from the program did not have the strong technical and programming skills that the CS program had been noted for in the community during the 1980's.

Robbins, Kay A.↗
NASA NTRS1994

VLSI Neuroprocessors

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques.

computing↗
NASA NTRSDate not supplied

Computer In The Loop: A Paradigm For Software Augmentation Of Terrestrial Medical Support In Asynchronous Communication Environments

As humans plan for missions beyond the reach of real-time communication supported by terrestrially-based crews (i.e., increasingly earth-independent spaceflight missions), we need to consider how to maximize this effectiveness despite asynchronous communication with Earth. Medical events – especially those involving the sparing of life, limb, or eyesight - often need to be acted on immediately, in real-time. Often the expertise necessary to successfully complete such action covers an enormous range of training that is unrealistic to expect from crews engaged in exploration spaceflight. Thus, the medical support paradigm for asynchronous environments must account for both the limitations and coordinate seamlessly among ground-based expertise, the need for real-time interventions, and the limited crew time and knowledge resources.

D R Levin↗
DOE OSTI2020

Real-Time Distributed Control of Smart Inverters for Network-level Optimization

The limitations of centralized optimization methods in managing electric power distribution systems operations have led to the distributed paradigm of computing and decision-making. Unfortunately, the existing distributed optimization algorithms are limited in their applicability to managing fast varying phenomena such as those resulting from highly variable Distributed Energy Resource (DER) generation patterns. They require a large number of communication rounds (in the order of 10 2 to 10 3 ) among the computing agents to solve one instance of the optimization problem. Related real-time distributed control methods are equally limited in their applications to power distribution systems with fast-changing DER generation; they require hundreds of rounds of communication and thus are slow in tracking the network-level optimal solutions. In this paper, we propose a novel distributed voltage controller that provides a fast-tracking of rapidly varying DER generation profiles while simultaneously converging to network-level optimal solutions within a few communication rounds. The proposed control algorithm leverages the radial topology of the system, which reduces the required communication rounds to reach the network-level optimum solution by order of magnitude. The novelty lies in carefully reducing the electrical network model from the perspective of each distributed controller and enabling appropriate data sharing among upstream and downstream nodes to achieve fast convergence. The simulation results demonstrate the effectiveness of the proposed approach in minimizing the feeder losses while maintaining the node voltage within the pre-specified limits.

voltage control, optimization, reactive power, inv↗