SEARCH · Search NASA

Results for “CONNECT algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

NASA NTRS1989

The paradigm compiler: Mapping a functional language for the connection machine

The Paradigm Compiler implements a new approach to compiling programs written in high level languages for execution on highly parallel computers. The general approach is to identify the principal data structures constructed by the program and to map these structures onto the processing elements of the target machine. The mapping is chosen to maximize performance as determined through compile time global analysis of the source program. The source language is Sisal, a functional language designed for scientific computations, and the target language is Paris, the published low level interface to the Connection Machine. The data structures considered are multidimensional arrays whose dimensions are known at compile time. Computations that build such arrays usually offer opportunities for highly parallel execution; they are data parallel. The Connection Machine is an attractive target for these computations, and the parallel for construct of the Sisal language is a convenient high level notation for data parallel algorithms. The principles and organization of the Paradigm Compiler are discussed.

Dennis, Jack B.↗

NASA NTRS2011

High-Performance Data Analysis Tools for Sun-Earth Connection Missions

The data analysis tool of choice for many Sun-Earth Connection missions is the Interactive Data Language (IDL) by ITT VIS. The increasing amount of data produced by these missions and the increasing complexity of image processing algorithms requires access to higher computing power. Parallel computing is a cost-effective way to increase the speed of computation, but algorithms oftentimes have to be modified to take advantage of parallel systems. Enhancing IDL to work on clusters gives scientists access to increased performance in a familiar programming environment. The goal of this project was to enable IDL applications to benefit from both computing clusters as well as graphics processing units (GPUs) for accelerating data analysis tasks. The tool suite developed in this project enables scientists now to solve demanding data analysis problems in IDL that previously required specialized software, and it allows them to be solved orders of magnitude faster than on conventional PCs. The tool suite consists of three components: (1) TaskDL, a software tool that simplifies the creation and management of task farms, collections of tasks that can be processed independently and require only small amounts of data communication; (2) mpiDL, a tool that allows IDL developers to use the Message Passing Interface (MPI) inside IDL for problems that require large amounts of data to be exchanged among multiple processors; and (3) GPULib, a tool that simplifies the use of GPUs as mathematical coprocessors from within IDL. mpiDL is unique in its support for the full MPI standard and its support of a broad range of MPI implementations. GPULib is unique in enabling users to take advantage of an inexpensive piece of hardware, possibly already installed in their computer, and achieve orders of magnitude faster execution time for numerically complex algorithms. TaskDL enables the simple setup and management of task farms on compute clusters. The products developed in this project have the potential to interact, so one can build a cluster of PCs, each equipped with a GPU, and use mpiDL to communicate between the nodes and GPULib to accelerate the computations on each node.

Messmer, Peter↗

NASA NTRS1995

Algorithms for high aspect ratio oriented triangulations

Grid generation plays an integral part in the solution of computational fluid dynamics problems for aerodynamics applications. A major difficulty with standard structured grid generation, which produces quadrilateral (or hexahedral) elements with implicit connectivity, has been the requirement for a great deal of human intervention in developing grids around complex configurations. This has led to investigations into unstructured grids with explicit connectivities, which are primarily composed of triangular (or tetrahedral) elements, although other subdivisions of convex cells may be used. The existence of large gradients in the solution of aerodynamic problems may be exploited to reduce the computational effort by using high aspect ratio elements in high gradient regions. However, the heuristic approaches currently in use do not adequately address this need for high aspect ratio unstructured grids. High aspect ratio triangulations very often produce the large angles that are to be avoided. Point generation techniques based on contour or front generation are judged to be the most promising in terms of being able to handle complicated multiple body objects, with this technique lending itself well to adaptivity. The eventual goal encompasses several phases: first, a partitioning phase, in which the Voronoi diagram of a set of points and line segments (the input set) will be generated to partition the input domain; second, a contour generation phase in which body-conforming contours are used to subdivide the partition further as well as introduce the foundation for aspect ratio control, and; third, a Steiner triangulation phase in which points are added to the partition to enable triangulation while controlling angle bounds and aspect ratio. This provides a combination of the advancing front/contour techniques and refinement. By using a front, aspect ratio can be better controlled. By using refinement, bounds on angles can be maintained, while attempting to minimize the number of Steiner points.

Posenau, Mary-Anne K.↗

NASA NTRS2000

Mixed Element Type Unstructured Grid Generation for Viscous Flow Applications

A procedure is presented for efficient generation of high-quality unstructured grids suitable for CFD simulation of high Reynolds number viscous flow fields. Layers of anisotropic elements are generated by advancing along prescribed normals from solid boundaries. The points are generated such that either pentahedral or tetrahedral elements with an implied connectivity can be be directly recovered. As points are generated they are temporarily attached to a volume triangulation of the boundary points. This triangulation allows efficient local search algorithms to be used when checking merging layers, The existing advancing-front/local-reconnection procedure is used to generate isotropic elements outside of the anisotropic region. Results are presented for a variety of applications. The results demonstrate that high-quality anisotropic unstructured grids can be efficiently and consistently generated for complex configurations.

Marcum, David L.↗

NASA NTRS2006

Cargo-Positioning System for Next-Generation Spacecraft

A report discusses a proposed system for mounting loaded pallets in the cargo bay of a next-generation space-shuttle-like spacecraft, such that the center of mass of the cargo would lie within a 1-in. (2.54-cm) cube that would also contain the center of mass of the spacecraft. The system would include (1) an algorithm for planning the locations of the pallets, given the geometric and weight properties of the pallets, and the geometric restrictions of the cargo bay; (2) quick-connect/quick-disconnect mounting mechanisms similar to those now used on air hoses; (3) other mounting mechanisms, comprising mostly spring-loaded pins, in a locking subsystem that would prevent shifting of the pallets under load; and (4) mechanisms for performing fine position adjustments to satisfy the center-of-mass requirement. The position- adjusting mechanisms would be motor-driven lead-screw mechanisms in groups of three - one for positioning each pin of the locking subsystem along each of three mutually perpendicular coordinate axes. The system also would include a triple-threaded screw that would provide compensation for thermal expansion or contraction of the spacecraft.

Holladay, Jon↗

NASA NTRSDate not supplied

Optimization Algorithms as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) have the potential to demonstrate significant run-time performance benefits over current state-of-the-art solutions. Using existing methods for characterizing classical optimization algorithms, we analyze solution quality obtained by solving Max-Cut problems using a quantum annealing device and gate-model quantum simulators and devices. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through effective visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. The framework is an enhancement to the existing open-source QED-C Application-Oriented Benchmark suite and can connect to the open-source analysis libraries. The suite can be executed on various quantum simulators and quantum hardware systems.

benchmarking↗

NASA NTRSDate not supplied

Biological Research and Space Health Enabled by Machine Learning to Support Deep Space Missions

A key science goal of the NASA “Moon to Mars” campaign is to understand how biology responds to the Lunar, Martian, and deep space environments in order to advance fundamental knowledge and support human space missions. Through artificial intelligence (AI) and machine learning (ML), a paradigm shift has begun in space biosciences and engineered astronaut health systems, to enable Earth-independence and mission operations autonomy. We describe current AI/ML methods to support 1) fundamental biology, 2) in situ analytics, 3) high performance computing, 4) automated science, 5) self-driving labs, 6) remote data management, 7) integrated mission biomonitoring, and 8) a Precision Space Health system. AI/ML approaches that can be integrated to support these domains include active learning, explainable AI, adaptive learning, causal inference, knowledge graphs, federated learning, transfer learning, and large language models. Finally, we present results from several current ML projects that are underway in the space biology field to address key challenges of small sample n, high feature count, heterogeneity, and sparse data. These include 1) connecting omics to phenotypic data using an ensemble model to infer causality of rodent liver health disruption, 2) usage of explainable ML to interrogate muscular underpinnings of muscle atrophy, 3) ML models analyzing and determining directed acyclic graphs of human health risk leveraging rodent bone datasets, 4) usage of large pre-trained models connecting biomedical knowledgebases with small spaceflight datasets to understand gene-to-gene interactions, and 5) a suite of benchmarked open science datasets enabling programmers to identify best algorithms to answer space biology questions.

space biology↗

NASA NTRS2026

Satellite Optical Remote Sensing of Clouds and Aerosols: From Particle Single-Scattering and Gaseous Absorption Through Radiative Transfer to Retrieval Products

Clouds and aerosols are fundamental regulators of Earth’s radiation budget and climate system, influencing both solar and terrestrial radiation through scattering, absorption, and emission processes. Accurate characterization of their physical and radiative properties from space requires a rigorous understanding of particle single-scattering, gaseous absorption, and radiative transfer in the atmosphere, as well as reliable inversion methods. This review synthesizes the physical foundations and algorithmic implementations of satellite-based passive optical remote sensing of clouds and aerosols, spanning the ultraviolet to thermal infrared spectral range. Beginning with electromagnetic scattering theory and state-of-the-art methods for computing single-scattering by nonspherical particles and computationally efficient methods for accounting for atmospheric absorption, we discuss the radiative transfer framework underpinning cloud and aerosol retrievals. The connection between single-scattering and multiple-scattering is rigorously formulated. We then summarize operational and research-grade retrieval techniques, including cloud masking and thermodynamic phase determination, CO₂ slicing for cloud-top pressure, the Nakajima-King shortwave bi-spectral, and infrared split-window approaches for cloud optical thickness and effective particle size, inversion algorithms for determining aerosol properties from multi-spectral and/or multi-angle radiometric and polarimetric measurements, and active-passive sensing synergy. Examples of the global cloud and aerosol climatologies are illustrated using observations from the Moderate Resolution Imaging Spectroradiometer (MODIS) and the Multi-angle Imaging SpectroRadiometer (MISR). Furthermore, the unique strengths of active remote sensing techniques based on spaceborne lidar observations are briefly elaborated in the context of studying ice clouds composed of randomly and horizontally oriented ice crystals, which is a significant challenge for conventional passive remote sensing techniques. By connecting physical theory to practical retrievals, this review highlights both the maturity of current methodologies and the remaining challenges in reducing uncertainties in particle morphology, vertical structure, absorption, and aerosol-cloud interactions. Furthermore, the impact of artificial intelligence (AI) on atmospheric remote sensing is briefly addressed.

Aerosols↗

NASA NTRS1981

Model error estimation for large flexible spacecraft

The basic model obtained for spacecraft control system design applications is used to develop the control and estimation algorithms which constitute integral elements of the control system. The performance of this system is limited on account of modeling errors. The presence of such errors is inevitable in connection with truncated dynamics, parameter uncertainties, neglected nonlinearities, and external disturbances. In many cases, an approximate knowledge of the model errors can only be established by means of an estimation procedure. The present investigation has the objective to outline an approach to estimate errors inherent in a reduced-order model and to illustrate its application to modeling problems arising in spacecraft control system design. The considered procedure makes use of the principle of least-squares. In the discussed application this principle is employed to minimize a quadratic functional of the model errors.

Rodriguez, G.↗

NASA NTRS2006

DCS-Neural-Network Program for Aircraft Control and Testing

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Jorgensen, Charles C.↗

NASA NTRS1982

Evaluation of automated decisionmaking methodologies and development of an integrated robotic system simulation. Volume 2, Part 2: Appendixes B, C, D and E

The derivation of the equations is presented, the rate control algorithm described, and simulation methodologies summarized. A set of dynamics equations that can be used recursively to calculate forces and torques acting at the joints of an n link manipulator given the manipulator joint rates are derived. The equations are valid for any n link manipulator system with any kind of joints connected in any sequence. The equations of motion for the class of manipulators consisting of n rigid links interconnected by rotary joints are derived. A technique is outlined for reducing the system of equations to eliminate contraint torques. The linearized dynamics equations for an n link manipulator system are derived. The general n link linearized equations are then applied to a two link configuration. The coordinated rate control algorithm used to compute individual joint rates when given end effector rates is described. A short discussion of simulation methodologies is presented.

Lowrie, J. W.↗

NASA NTRS1996

Finding New Math Identities by Computer

Recently a number of interesting new mathematical identities have been discovered by means of numerical searches on high performance computers, using some newly discovered algorithms. These include the following: pi = ((sup oo)(sub k=0))(Sigma) (1 / 16) (sup k) ((4 / 8k+1) - (2 / 8k+4) - (1 / 8k+5) - (1 / 8k+6)) and ((17 pi(exp 4)) / 360) = ((sup oo)(sub k=1))(Sigma) (1 + (1/2) + (1/3) + ... + (1/k))(exp 2) k(exp -2), zeta(3, 1, 3, 1, ..., 3, 1) = (2 pi(exp 4m) / (4m+2)! where m = number of (3,1) pairs. and where zeta(n1,n2,...,nr) = (sub k1 (is greater than) k2 (is greater than) ... (is greater than) kr)(Sigma) (1 / (k1 (sup n1) k2 (sup n2) ... kr (sup nr). The first identity is remarkable in that it permits one to compute the n-th binary or hexadecimal digit of pu directly, without computing any of the previous digits, and without using multiple precision arithmetic. Recently the ten billionth hexadecimal digit of pi was computed using this formula. The third identity has connections to quantum field theory. (The first and second of these been formally established; the third is affirmed by numerical evidence only.) The background and results of this work will be described, including an overview of the algorithms and computer techniques used in these studies.

Bailey, David H.↗

NASA NTRS1986

On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations

Substructuring methods are in common use in mechanics problems where typically the associated linear systems of algebraic equations are positive definite. Here these methods are extended to problems which lead to nonpositive definite, nonsymmetric matrices. The extension is based on an algorithm which carries out the block Gauss elimination procedure without the need for interchanges even when a pivot matrix is singular. Examples are provided wherein the method is used in connection with finite element solutions of the stationary Stokes equations and the Helmholtz equation, and dual methods for second-order elliptic equations.

Gunzburger, M. D.↗

NASA NTRS2018

An Interplay between Photons, Canopy Structure, and Recollision Probability: A Review of the Spectral Invariants Theory of 3D Canopy Radiative Transfer Processes

Earth observations collected by remote sensors provide unique information to our ever-growing knowledge of the terrestrial biosphere. Yet, retrieving information from remote sensing data requires sophisticated processing and demands a better understanding of the underlying physics. This paper reviews research efforts that lead to the developments of the stochastic radiative transfer equation (RTE) and the spectral invariants theory. The former simplifies the characteristics of canopy structures with a pair-correlation function so that the 3D information can be succinctly packed into a 1D equation. The latter indicates that the interactions between photons and canopy elements converge to certain invariant patterns quantifiable by a few wavelength independent parameters, which satisfy the law of energy conservation. By revealing the connections between plant structural characteristics and photon recollision probability, these developments significantly advance our understanding of the transportation of radiation within vegetation canopies. They enable a novel physically-based algorithm to simulate the “hot-spot” phenomenon of canopy bidirectional reflectance while conserving energy, a challenge known to the classic radiative transfer models. Therefore, these theoretical developments have a far-reaching influence in optical remote sensing of the biosphere.

vegetation remote sensing; stochastic radiative tr↗

NASA NTRS2016

Spline Trajectory Algorithm Development: Bezier Curve Control Point Generation for UAVs

A greater need for sophisticated autonomous piloting systems has risen in direct correlation with the ubiquity of Unmanned Aerial Vehicle (UAV) technology. Whether surveying unknown or unexplored areas of the world, collecting scientific data from regions in which humans are typically incapable of entering, locating lost or wanted persons, or delivering emergency supplies, an unmanned vehicle moving in close proximity to people and other vehicles, should fly smoothly and predictably. The mathematical application of spline interpolation can play an important role in autopilots' on-board trajectory planning. Spline interpolation allows for the connection of Three-Dimensional Euclidean Space coordinates through a continuous set of smooth curves. This paper explores the motivation, application, and methodology used to compute the spline control points, which shape the curves in such a way that the autopilot trajectory is able to meet vehicle-dynamics limitations. The spline algorithms developed used to generate these curves supply autopilots with the information necessary to compute vehicle paths through a set of coordinate waypoints.

Howell, Lauren R.↗

NASA NTRS1993

Liquid propellant rocket engine combustion simulation with a time-accurate CFD method

Time-accurate computational fluid dynamics (CFD) algorithms are among the basic requirements as an engineering or research tool for realistic simulations of transient combustion phenomena, such as combustion instability, transient start-up, etc., inside the rocket engine combustion chamber. A time-accurate pressure based method is employed in the FDNS code for combustion model development. This is in connection with other program development activities such as spray combustion model development and efficient finite-rate chemistry solution method implementation. In the present study, a second-order time-accurate time-marching scheme is employed. For better spatial resolutions near discontinuities (e.g., shocks, contact discontinuities), a 3rd-order accurate TVD scheme for modeling the convection terms is implemented in the FDNS code. Necessary modification to the predictor/multi-corrector solution algorithm in order to maintain time-accurate wave propagation is also investigated. Benchmark 1-D and multidimensional test cases, which include the classical shock tube wave propagation problems, resonant pipe test case, unsteady flow development of a blast tube test case, and H2/O2 rocket engine chamber combustion start-up transient simulation, etc., are investigated to validate and demonstrate the accuracy and robustness of the present numerical scheme and solution algorithm.

Chen, Y. S.↗

NASA NTRS1983

Progress in computational physics

Recent progress in computational methods for time dependent fluid dynamics is presented. The emphasis is on advances applicable to large scale systems with the connection between the numerics and the physics of the code stressed. All aspects of a working code are discussed including such topics as initialization, boundary conditions, grid generation in addition to algorithmic advances. One sometimes uses a time dependent method as an iteration procedure to reach a steady state solution. Work in accelerating the convergence to the steady state is also surveyed.

Turkel, E.↗

NASA NTRS1988

Analysis of pre-flight modulator voltage calibration data for the Voyager plasma science experiment

The Voyager Plasma Science (PLS) modulator calibration (MVM) data analysis was undertaken in order to check the correctness of the fast A/D converter formulas that connect low voltage monitor signals (MV) with digital outputs (DN), to determine the proportionality constants between the actual modulator grid potential (V) and the monitor voltage (MV), and to establish an algorithm to link the digitized readouts (DN) with the actual grid potential (V). The analysis results are surprising in that the derived conversion constants deviate by fairly significant amounts from their nominal values. However, it must be kept in mind that the test results which were used for analysis may be very imprecise. Even if it is assumed that the test result errors are very large, they do no appear to be capable to account for all discrepancies between the theoretical expectations and the results of the analysis. Measurements with the flight spare instrument appear to be the only means of investigating these effects further.

Nastov, Ognen↗