Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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 1,621 records · Page 90

A split finite element algorithm for the compressible Navier-Stokes equations

An accurate and efficient numerical solution algorithm is established for solution of the high Reynolds number limit of the Navier-Stokes equations governing the multidimensional flow of a compressible essentially inviscid fluid. Finite element interpolation theory is used within a dissipative formulation established using Galerkin criteria within the Method of Weighted Residuals. An implicit iterative solution algorithm is developed, employing tensor product bases within a fractional steps integration procedure, that significantly enhances solution economy concurrent with sharply reduced computer hardware demands. The algorithm is evaluated for resolution of steep field gradients and coarse grid accuracy using both linear and quadratic tensor product interpolation bases. Numerical solutions for linear and nonlinear, one, two and three dimensional examples confirm and extend the linearized theoretical analyses, and results are compared to competitive finite difference derived algorithms.

Baker, A. J.↗

A time-split finite-volume algorithm for three-dimensional flow-field simulation

A general finite-volume algorithm is developed for solving three-dimensional, time-dependent, compressible Navier-Stokes equations for high Reynolds number flows over an arbitrary geometry. This algorithm adapts MacCormack's (1982) explicit-implicit scheme to a time-split, three-dimensional finite-volume concept in a general coordinate system. It is shown that the thin-layer approximation in all three spatial directions significantly reduces the evaluation of viscous terms and allows the algorithm to solve more complicated geometries with all boundaries in two or all three directions. The calculated results using this method are found to be in good agreement with the experimental measurements of a blunt-fin induced shock wave and boundary-layer interaction problems. Observations of the existence of peak pressure, primary horseshoe and secondary vortices, and reversed supersonic zones show that computational fluid dynamics can effectively supplement the wind tunnel tests for aerodynamic design as well as for understanding basic fluid dynamics.

Hung, C. M.↗

Design requirements and development of an airborne descent path definition algorithm for time navigation

The design requirements for a 4D path definition algorithm are described. These requirements were developed for the NASA ATOPS as an extension of the Local Flow Management/Profile Descent algorithm. They specify the processing flow, functional and data architectures, and system input requirements, and recommended the addition of a broad path revision (reinitialization) function capability. The document also summarizes algorithm design enhancements and the implementation status of the algorithm on an in-house PDP-11/70 computer. Finally, the requirements for the pilot-computer interfaces, the lateral path processor, and guidance and steering function are described.

Izumi, K. H.↗

Interdisciplinary Investigations in Support of Project DI-MOD

Various concepts from time series analysis are used as the basis for the development of algorithms to assist in the analysis and interpretation of remote sensed imagery. An approach to trend detection that is based upon the fractal analysis of power spectrum estimates is presented. Additionally, research was conducted toward the development of a software architecture to support processing tasks associated with databases housing a variety of data. An algorithmic approach which provides for the automation of the state monitoring process is presented.

Starks, Scott A.↗

International Low-Earth-Orbit Spacecraft Materials Test Program Initiated for Better Prediction of Durability and Performance

Spacecraft in low Earth orbit (LEO) are subjected to many components of the environment, which can cause them to degrade much more rapidly than intended and greatly shorten their functional life. The atomic oxygen, ultraviolet radiation, and cross contamination present in LEO can affect sensitive surfaces such as thermal control paints, multilayer insulation, solar array surfaces, and optical surfaces. The LEO Spacecraft Materials Test (LEO-SMT) program is being conducted to assess the effects of simulated LEO exposure on current spacecraft materials to increase understanding of LEO degradation processes as well as to enable the prediction of in-space performance and durability. Using ground-based simulation facilities to test the durability of materials currently flying in LEO will allow researchers to compare the degradation evidenced in the ground-based facilities with that evidenced on orbit. This will allow refinement of ground laboratory test systems and the development of algorithms to predict the durability and performance of new materials in LEO from ground test results. Accurate predictions based on ground tests could reduce development costs and increase reliability. The wide variety of national and international materials being tested represent materials being functionally used on spacecraft in LEO. The more varied the types of materials tested, the greater the probability that researchers will develop and validate predictive models for spacecraft long-term performance and durability. Organizations that are currently participating in the program are ITT Research Institute (USA), Lockheed Martin (USA), MAP (France), SOREQ Nuclear Research Center (Israel), TNO Institute of Applied Physics (The Netherlands), and UBE Industries, Ltd. (Japan). These represent some of the major suppliers of thermal control and sensor materials currently flying in LEO. The participants provide materials that are exposed to selected levels of atomic oxygen, vacuum ultraviolet radiation, contamination, or synergistic combined environments at the NASA Lewis Research Center. Changes in characteristics that could affect mission performance or lifetime are then measured. These characteristics include changes in mass, solar absorptance, and thermal emittance. The durability of spacecraft materials from U.S. suppliers is then compared with those of materials from other participating countries. Lewis will develop and validate performance and durability prediction models using this ground data and available space data. NASA welcomes the opportunity to consider additional international participants in this program, which should greatly aid future spacecraft designers as they select materials for LEO missions.

Rutledge, Sharon K.↗

A Rotor Tip Vortex Tracing Algorithm for Image Post-Processing

A neurite tracing algorithm, originally developed for medical image processing, was used to trace the location of the rotor tip vortex in density gradient flow visualization images. The tracing algorithm was applied to several representative test images to form case studies. The accuracy of the tracing algorithm was compared to two current methods including a manual point and click method and a cross-correlation template method. It is shown that the neurite tracing algorithm can reduce the post-processing time to trace the vortex by a factor of 10 to 15 without compromising the accuracy of the tip vortex location compared to other methods presented in literature.

Overmeyer, Austin D.↗

An Analysis of the Lightning Jump Algorithm Using Geostationary Lightning Mapper Flashes

This project aims to implement the two-sigma lightning jump algorithm (LJA) developed using Lightning Mapping Arrays (LMAs), with GOES-16 Geostationary Lightning Mapper (GLM) flashes, evaluate its performance, and identify any needed adjustments to the algorithm to optimize operational skill. The GLM is projected to have lower detection efficiency (DE) (70-90 percent) than operational LMAs (95-99 percent). The reduced GLM DE coupled with the coarser spatial resolution of the GLM could have impacts on flash rates and trends that could affect the LJA in various ways. Deep dives are conducted on four separate cases. Three of four cases show LMAs seeing two to three times as many flashes as the GLM. Only fifteen of twenty five GLM jumps saw increases in radar intensity while fourteen of nineteen LMA jumps did. These results suggest a larger sample sized study must be conducted to determine how to implement the LJA with the GLM.

Curtis, Nathan↗

20-Years of Atmospheric Temperature, Water Vapor, Cloud, and Surface Temperature Anomalies and Trends Derived From Operational Hyperspectral Ir Sounders

Hyperspectral IR sounders such as AIRS on Aqua, CrIS on S-NPP, NOAA20 and JPSS-2, IASI on Metop A, B, and C provide high-quality atmospheric temperature, water, vapor, and greenhouse gas vertical profiles. Additionally, they provide atmospheric cloud properties, surface emissivity, and surface skin temperatures. We have developed two algorithms which can consistently derive these products from multiple IR sounders. The first one is a Single Field-of-view Sounder Atmospheric Product (SIFSAP) algorithm and the second one is a Climate Fingerprinting Sounder Product (ClimFiSP) algorithm. Compared to current operational AIRS and CrIS Level-2 (L2) algorithms, which perform one retrieval for each 3 by 3 field of views (FOVs) using a cloud-clearing approach, the SiFSAP algorithm, on the other hand, performs one retrieval for each FOV using an all-sky optimal estimation approach. The SiFSAP algorithm retrieves all the above-mentioned atmosphere and surface properties simultaneously including cloud properties with 3-time higher spatial resolution and 9-times more products. The core of the SiFSAP algorithm is an accurate and fast Principal Component-based Radiative Transfer Model (PCRTM), which can calculate hyperspectral radiance spectra under both clear and cloudy conditions. The PCRTM was developed in the past decade using consistent reference line-by-line radiative transfer model and spectroscopy for hyperspectral sounders such as AIRS, CrIS, IASI, NAST-I, and S-HIS. The SiFSAP retrieval algorithm also uses the same climatology a priori and associated covariances, which makes it ideal for generating high quality products for both weather and climate applications. Climate products are typically derived by performing spatial and temporal averaging of L2 products. It is a time-consuming process to generate L2 data products since AIRS, CrIS, and IASI have millions of observations each day with thousands of spectral channels for each observation. Additionally, differences in L2 retrieval algorithms for different satellite sensors can lead to errors in the climate products. Our ClimFiSP algorithm, which performs retrievals from spatiotemporally averaged L1 hyperspectral radiances directly, will be orders of magnitude faster than traditional method. he ClimFiSP algorithm uses consistent radiative kernels and a robust spectral fingerprinting method. It provides accurate data climate data fusion products from multiple satellite sensors. We have applied this method to both AIRS and CrIS (on SNPP and on NOAA 20) data and generated two decades climate data records for atmospheric temperature, water vapor, cloud, trace gases, and surface skin temperature. Both SiFSAP and ClimFiSP will be available at NASA GES DISC data center for public access.

Xu Liu↗

Numerical analysis of discrete fractional integrodifferential structural dampers

This paper develops solution algorithms enabling the handling of the dynamic response of nonlinear structures contained discretely attached dampers modeled by fractional integrodifferential operators of the Grunwald-Liouville-Riemann type. The development consists of two levels of formulation, namely: (1) numerical approximations of fractional operators and, (2) the establishment of global level implicit schemes enabling the solution to nonlinear structural formulations. To generalize the overall results, error estimates are derived for the fractional operator approximation algorithm. These enable an ongoing optimization of solution efficiency for a given error tolerance. To benchmark the scheme, the results of several numerical experiments are presented. These illustrate the numerical characteristics of the overall formulation.

Padovan, Joseph↗

TPS In-Flight Health Monitoring Project Progress Report

Progress in the development of new thermal protection systems (TPS) is reported. New approaches use embedded lightweight, sensitive, fiber optic strain and temperature sensors within the TPS. Goals of the program are to develop and demonstrate a prototype TPS health monitoring system, develop a thermal-based damage detection algorithm, characterize limits of sensor/system performance, and develop ea methodology transferable to new designs of TPS health monitoring systems. Tasks completed during the project helped establish confidence in understanding of both test setup and the model and validated system/sensor performance in a simple TPS structure. Other progress included complete initial system testing, commencement of the algorithm development effort, generation of a damaged thermal response characteristics database, initial development of a test plan for integration testing of proven FBG sensors in simple TPS structure, and development of partnerships to apply the technology.

Kostyk, Chris↗

Qubit-efficient entanglement spectroscopy using qubit resets

One strategy to fit larger problems on NISQ devices is to exploit a tradeoff between circuit width and circuit depth. Unfortunately, this tradeoff still limits the size of tractable problems since the increased depth is often not realizable before noise dominates. Here, we develop qubit-efficient quantum algorithms for entanglement spectroscopy which avoid this tradeoff. In particular, we develop algorithms for computing the trace of the n -th power of the density operator of a quantum system, T r ( ρ n ) , (related to the Rényi entropy of order n ) that use fewer qubits than any previous efficient algorithm while achieving similar performance in the presence of noise, thus enabling spectroscopy of larger quantum systems on NISQ devices. Our algorithms, which require a number of qubits independent of n , are variants of previous algorithms with width proportional to n , an asymptotic difference. The crucial ingredient in these new algorithms is the ability to measure and reinitialize subsets of qubits in the course of the computation, allowing us to reuse qubits and increase the circuit depth without suffering the usual noisy consequences. We also introduce the notion of effective circuit depth as a generalization of standard circuit depth suitable for circuits with qubit resets. This tool helps explain the noise-resilience of our qubit-efficient algorithms and should aid in designing future algorithms. We perform numerical simulations to compare our algorithms to the original variants and show they perform similarly when subjected to noise. Additionally, we experimentally implement one of our qubit-efficient algorithms on the Honeywell System Model H0, estimating T r ( ρ n ) for larger n than possible with previous algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A least mean squares CUBIC algorithm for on-line differential of sampled analog signals

A digital computer algorithm is developed for on-line time differentiation of sampled analog voltage signals. The derivative is obtained by employing a least mean squares technique. The recursive algorithm results in a considerable reduction in computer time compared to a complete new solution of the normal equations each time a new data point is accepted. Implementation of the algorithm on a digital computer is discussed. Examples are simulated on a DEC PDP-8 computer.

Allum, J. H. J.↗

Time-derivative preconditioning for viscous flows

A time-derivative preconditioning algorithm that is effective over a wide range of flow conditions from inviscid to very diffusive flows and from low speed to supersonic flows was developed. This algorithm uses a viscous set of primary dependent variables to introduce well-conditioned eigenvalues and to avoid having a nonphysical time reversal for viscous flow. The resulting algorithm also provides a mechanism for controlling the inviscid and viscous time step parameters to be of order one for very diffusive flows, thereby ensuring rapid convergence at very viscous flows as well as for inviscid flows. Convergence capabilities are demonstrated through computation of a wide variety of problems.

Choi, Yunho↗

Time-derivative preconditioning for viscous flows

A time-derivative preconditioning algorithm that is effective over a wide range of flow conditions from inviscid to very diffusive flows and from low speed to supersonic flows was developed. This algorithm uses a viscous set of primary dependent variables to introduce well-conditioned eigenvalues and to avoid having a nonphysical time reversal for viscous flow. The resulting algorithm also provides a mechanism for controlling the inviscid and viscous time step parameters to be of order one for very diffusive flows, thereby ensuring rapid convergence at very viscous flows as well as for inviscid flows. Convergence capabilities are demonstrated through computation of a wide variety of problems.

Choi, Yunho↗

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

Optimal processor assignment for pipeline computations

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

Nicol, David M.↗

A general explicit or semi-explicit algorithm for compressible and incompressible flows

A unified finite element algorithm is developed which is applicable to a wide range of problems of fluid mechanics without recourse to artificial, empirically determined factors. In its explicit form, the algorithm is similar to the Taylor-Galerkin scheme and is easily adopted to standard codes. The scheme proposed here possesses sufficient natural balancing diffusion and thus reduces and sometimes eliminates the need for special 'shock capturing' diffusion. The efficiency of the algorithm is demonstrated using several examples ranging from incompressible through transonic regions to supersonic flows.

Zienkiewicz, O. C.↗

Evaluating some computer exhancement algorithms that improve the visibility of cometary morphology

Digital enhancement of cometary images is a necessary tool in studying cometary morphology. Many image processing algorithms, some developed specifically for comets, have been used to enhance the subtle, low contrast coma and tail features. We compare some of the most commonly used algorithms on two different images to evaluate their strong and weak points, and conclude that there currently exists no single 'ideal' algorithm, although the radial gradient spatial filter gives the best overall result. This comparison should aid users in selecting the best algorithm to enhance particular features of interest.

Larson, Stephen M.↗