Search NASA⌕ Search

SEARCH · Search NASA

Results for “blocked 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.

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

At least 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

NASA experimental airborne doppler radar and real time processor for wind shear detection

The topics are presented in viewgraph form and include the following: experimental radar system capabilities; an experimental radar system block diagram; wind shear radar signal and data processor (WRSDP); WRSDP hardware architecture; WRSDP system design goals; DSP software development tools; OS-9 software development tools; WRSDP digital signal processing; WRSDP display operational modes; WRSDP division of functions; structure of WRSDP signal and data processing algorithms; and the wind shear radar flight experiment.

Schaffner, Philip H.↗
NASA NTRS1994

Boundary element analysis on vector and parallel computers

Boundary element analysis (BEA) can be characterized as a numerical technique that generally shifts the computational burden in the analysis toward numerical integration and the solution of nonsymmetric and either dense or blocked sparse systems of algebraic equations. Researchers have explored the concept that the fundamental characteristics of BEA can be exploited to generate effective implementations on vector and parallel computers. In this paper, the results of some of these investigations are discussed. The performance of overall algorithms for BEA on vector supercomputers, massively data parallel single instruction multiple data (SIMD), and relatively fine grained distributed memory multiple instruction multiple data (MIMD) computer systems is described. Some general trends and conclusions are discussed, along with indications of future developments that may prove fruitful in this regard.

Kane, J. H.↗
NASA NTRS1996

Task 7: ADPAC User's Manual

The overall objective of this study was to develop a 3-D numerical analysis for compressor casing treatment flowfields. The current version of the computer code resulting from this study is referred to as ADPAC (Advanced Ducted Propfan Analysis Codes-Version 7). This report is intended to serve as a computer program user's manual for the ADPAC code developed under Tasks 6 and 7 of the NASA Contract. The ADPAC program is based on a flexible multiple- block grid discretization scheme permitting coupled 2-D/3-D mesh block solutions with application to a wide variety of geometries. Aerodynamic calculations are based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. Steady flow predictions are accelerated by a multigrid procedure. An iterative implicit algorithm is available for rapid time-dependent flow calculations, and an advanced two equation turbulence model is incorporated to predict complex turbulent flows. The consolidated code generated during this study is capable of executing in either a serial or parallel computing mode from a single source code. Numerous examples are given in the form of test cases to demonstrate the utility of this approach for predicting the aerodynamics of modem turbomachinery configurations.

Hall, E. J.↗
NASA NTRS2001

Band-Moment Compression of AVIRIS Hyperspectral Data and its Use in the Detection of Vegetation Stress

A remote sensing campaign was conducted over a U.S. Department of Agriculture test farm at Shelton, Nebraska. An experimental field was set off in plots that were differentially treated with anhydrous ammonia. Four replicates of 0-kg/ha to 200-kg/ha plots, in 50-kg/ha increments, were set out in a random block design. Low-altitude (GSD of 3 m) Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral data were collected over the site in 224 bands. Simultaneously, ground data were collected to support the airborne imagery. In an effort to reduce data load while maintaining or enhancing algorithm performance for vegetation stress detection, band-moment compression and analysis was applied to the AVIRIS image cube. The results indicated that band-moment techniques compress the AVIRIS dataset significantly while retaining the capability of detecting environmentally induced vegetation stress.

Estep, L.↗
NASA NTRS2010

Utilizing the MODIS 1.38 micrometer Channel for Cirrus Cloud Optical Thickness Retrievals: Algorithm and Retrieval Uncertainties

The cloud products from the Moderate Resolution Imaging Spectroradiometers (MODIS) on Terra and Aqua have been widely used within the atmospheric research community. The retrieval algorithms, however, oftentimes have difficulty detecting and retrieving thin cirrus, due to sensitivities to surface reflectance. Conversely, the 1.38 micron channel, located within a strong water vapor absorption band, is quite useful for detecting thin cirrus clouds since the signal from the surface can be blocked or substantially attenuated by the absorption of atmospheric water vapor below cirrus. This channel, however, suffers from nonnegligible attenuation due to the water vapor located above and within the cloud layer. Here we provide details of a new technique pairing the 1.38 micron and 1.24 micron channels to estimate the above/in-cloud water vapor attenuation and to subsequently retrieve thin cirrus optical thickness (tau) from attenuation-corrected 1.38 p.m reflectance measurements. In selected oceanic cases, this approach is found to increase cirrus retrievals by up to 38% over MOD06. For these cases, baseline 1.38 micron retrieval uncertainties are estimated to be between 15 and 20% for moderately thick cirrus (tau > 1), with the largest error source being the unknown cloud effective particle radius, which is not retrieved with the described technique. Uncertainties increase to around 90% for the thinnest clouds (tau < 0.5) where instrument and surface uncertainties dominate.

Meyer, Kerry↗
NASA NTRS2024

Ultra-Light, Strong, and Self-Reprogrammable Mechanical Metamaterials

Versatile programmable materials have long been envisioned that can reconfigure themselves to adapt to changing use cases in adaptive infrastructure, space exploration, disaster response, and more. We introduce a robotic structural system as an implementation of programmable matter, with mechanical performance and scale on par with conventional high-performance materials and truss systems. Fiber reinforced composite truss-like building-blocks form strong, stiff, and lightweight lattice structures as mechanical metamaterials. Two types of mobile robots operate over the exterior surface and through the interior of the system, performing transport, placement, and reversible fastening using the intrinsic lattice periodicity for indexing and metrology. Leveraging programmable matter algorithms to achieve scalability in size and complexity, this system design enables robust collective automated assembly and reconfiguration of large structures with simple robots. We describe the system design and experimental results from a 256-unit cell assembly demonstration and lattice mechanical testing, as well as demonstration of disassembly and reconfiguration. The assembled structural lattice material exhibits ultra-light mass density (0.0103 g/cc) with high strength and stiffness for its weight (0.01117 MPa and 1.1129 MPa, respectively), a material performance realm appropriate for applications like space structures. With simple robots and structure, high mass-specific structural performance, and competitive throughput, this system demonstrates potential for self-reconfiguring autonomous metamaterials for diverse applications.

Robotics↗
NASA NTRS1986

Numerical study of supersonic combustion using a finite rate chemistry model

The governing equations of two-dimensional chemically reacting flows are presented together with a global two-step chemistry model for H2-air combustion. The explicit unsplit MacCormack finite difference algorithm is used to advance the discrete system of the governing equations in time until convergence is attained. The source terms in the species equations are evaluated implicitly to alleviate stiffness associated with fast reactions. With implicit source terms, the species equations give rise to a block-diagonal system which can be solved very efficiently on vector-processing computers. A supersonic reacting flow in an inlet-combustor configuration is calculated for the case where H2 is injected into the flow from the side walls and the strut. Results of the calculation are compared against the results obtained by using a complete reaction model.

Chitsomboon, T.↗
NASA NTRS1999

Signal Prediction With Input Identification

A novel coding technique is presented for signal prediction with applications including speech coding, system identification, and estimation of input excitation. The approach is based on the blind equalization method for speech signal processing in conjunction with the geometric subspace projection theory to formulate the basic prediction equation. The speech-coding problem is often divided into two parts, a linear prediction model and excitation input. The parameter coefficients of the linear predictor and the input excitation are solved simultaneously and recursively by a conventional recursive least-squares algorithm. The excitation input is computed by coding all possible outcomes into a binary codebook. The coefficients of the linear predictor and excitation, and the index of the codebook can then be used to represent the signal. In addition, a variable-frame concept is proposed to block the same excitation signal in sequence in order to reduce the storage size and increase the transmission rate. The results of this work can be easily extended to the problem of disturbance identification. The basic principles are outlined in this report and differences from other existing methods are discussed. Simulations are included to demonstrate the proposed method.

Juang, Jer-Nan↗
NASA NTRS1992

Using neural networks and Dyna algorithm for integrated planning, reacting and learning in systems

The traditional AI answer to the decision making problem for a robot is planning. However, planning is usually CPU-time consuming, depending on the availability and accuracy of a world model. The Dyna system generally described in earlier work, uses trial and error to learn a world model which is simultaneously used to plan reactions resulting in optimal action sequences. It is an attempt to integrate planning, reactive, and learning systems. The architecture of Dyna is presented. The different blocks are described. There are three main components of the system. The first is the world model used by the robot for internal world representation. The input of the world model is the current state and the action taken in the current state. The output is the corresponding reward and resulting state. The second module in the system is the policy. The policy observes the current state and outputs the action to be executed by the robot. At the beginning of program execution, the policy is stochastic and through learning progressively becomes deterministic. The policy decides upon an action according to the output of an evaluation function, which is the third module of the system. The evaluation function takes the following as input: the current state of the system, the action taken in that state, the resulting state, and a reward generated by the world which is proportional to the current distance from the goal state. Originally, the work proposed was as follows: (1) to implement a simple 2-D world where a 'robot' is navigating around obstacles, to learn the path to a goal, by using lookup tables; (2) to substitute the world model and Q estimate function Q by neural networks; and (3) to apply the algorithm to a more complex world where the use of a neural network would be fully justified. In this paper, the system design and achieved results will be described. First we implement the world model with a neural network and leave Q implemented as a look up table. Next, we use a lookup table for the world model and implement the Q function with a neural net. Time limitations prevented the combination of these two approaches. The final section discusses the results and gives clues for future work.

Lima, Pedro↗
NASA NTRS1986

Novel measurement techniques (development and analysis of silicon solar cells near 20% effciency)

Work in identifying, developing, and analyzing techniques for measuring bulk recombination rates, and surface recombination velocities and rates in all regions of high-efficiency silicon solar cells is presented. The accuracy of the previously developed DC measurement system was improved by adding blocked interference filters. The system was further automated by writing software that completely samples the unkown solar cell regions with data of numerous recombination velocity and lifetime pairs. The results can be displayed in three dimensions and the best fit can be found numerically using the simplex minimization algorithm. Also described is a theoretical methodology to analyze and compare existing dynamic measurement techniques.

Wolf, M.↗
NASA NTRS1988

Further results on finite-state codes

A general construction for finite-state (FS) codes is applied to some well-known block codes. Subcodes of the (24,12) Golay code are used to generate two optimal FS codes with d sub free = 12 and 16. A partition of the (16,8) Nordstrom-Robinson code yields a d sub free = 10 FS code. Simulation results are shown and decoding algorithms are briefly discussed.

Pollara, F.↗
NASA NTRS2013

A Systems-Level Perspective on Engine Ice Accretion

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation sector. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. This work focuses on developing an accurate and reliable algorithm for detecting the accretion of ice in the low pressure compressor of a generic 40,000 lbf thrust class engine. The algorithm uses only the two shaft speed sensors and works regardless of engine age, operating condition, and power level. In a 10,000-case Monte Carlo simulation, the detection approach was found to have excellent capability at determining ice accretion from sensor noise with detection occurring when ice blocks an average of 6.8% of the low pressure compressor area. Finally, an initial study highlights a potential mitigation strategy that uses the existing engine actuators to raise the temperature in the low pressure compressor in an effort to reduce the rate at which ice accretes.

May, Ryan D.↗
NASA NTRS2013

An Approach to Detect and Mitigate Ice Particle Accretion in Aircraft Engine Compression Systems

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation sector. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. This work focuses on developing an accurate and reliable algorithm for detecting the accretion of ice in the low pressure compressor of a generic 40,000 lbf thrust class engine. The algorithm uses only the two shaft speed sensors and works regardless of engine age, operating condition, and power level. In a 10,000-case Monte Carlo simulation, the detection approach was found to have excellent capability at determining ice accretion from sensor noise with detection occurring when ice blocks an average of 6.8 percent of the low pressure compressor area. Finally, an initial study highlights a potential mitigation strategy that uses the existing engine actuators to raise the temperature in the low pressure compressor in an effort to reduce the rate at which ice accretes.

May, Ryan D.↗
NASA NTRS2013

An Approach to Detect and Mitigate Ice Particle Accretion in Aircraft Engine Compression Systems

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation sector. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. This work focuses on developing an accurate and reliable algorithm for detecting the accretion of ice in the low pressure compressor of a generic 40,000 lbf thrust class engine. The algorithm uses only the two shaft speed sensors and works regardless of engine age, operating condition, and power level. In a 10,000-case Monte Carlo simulation, the detection approach was found to have excellent capability at determining ice accretion from sensor noise with detection occurring when ice blocks an average of 6.8% of the low pressure compressor area. Finally, an initial study highlights a potential mitigation strategy that uses the existing engine actuators to raise the temperature in the low pressure compressor in an effort to reduce the rate at which ice accretes.

May, Ryan D.↗
NASA NTRSDate not supplied

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

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

UTM↗
NASA NTRS1981

Sensitivity of optimum solutions to problem parameters

In an aircraft configuration optimization, the information of interest is the sensitivity of optimal block fuel consumption and wing aspect ratio and area, to variations of required range and payload. The objectives of this study are: (1) to show how the equations capable of yielding the sensitivity derivatives (the sensitivity equations) can be obtained for a constrained optimum regardless of the type of optimization algorithm that was used to arrive at the optimum point, (2) to review the solvability of the sensitivity equations and (3) to report on applications on structural optimization. Numerical examples, which demonstrate the sensitivity analysis, include a tubular column and a three-bar truss for which closed form solutions are obtained, a ten-bar truss that requires the use of a finite element analysis, and a thin-walled beam characterized by strongly nonlinear constraints for local buckling. It is concluded that a practically significant extrapolation accuracy may be obtained for a reasonably broad range of parameter changes; and that accuracy does not depend strongly on the degree of convergence of the optimum solution from which the sensitivity derivatives are obtained.

Sobieszczanski-Sobieski, J.↗
NASA NTRS1982

On the inversion of block tridiagonals without storage constraints

A strategy was developed to permit trade-offs between the number of floating point operations required and the storage requirements for the solution of certain difference problems, such as block tridiagonal systems of equations. This is done by recomputing some intermediate results instead of storing them. Reducing the storage to the square root of the current requirement roughly doubles the number of computations. Reducing the storage more than this tends to make the number of computations prohibitively large. In theory, if m is the order of each sub-matrix in the block tridiagonal matrix, one can solve any linear system with only 5m(2) + 1 temporary storage cells. In many cases m is a constant and quite small. For example, in solving a factored form of the three-dimensional Navier-Stokes equations, the size m of the block tridiagonals is 5. This method lends itself to efficient use on computers with parallel processing or vector processing architectures. On these computers the larger number of floating point operations is more than offset by the decrease in I/O and the increased percentage of vector operations made possible by this algorithm.

Merriam, M. L.↗
NASA NTRS1992

Geometry modeling and multi-block grid generation for turbomachinery configurations

An interactive 3D grid generation code, Turbomachinery Interactive Grid genERation (TIGER), was developed for general turbomachinery configurations. TIGER features the automatic generation of multi-block structured grids around multiple blade rows for either internal, external, or internal-external turbomachinery flow fields. Utilization of the Bezier's curves achieves a smooth grid and better orthogonality. TIGER generates the algebraic grid automatically based on geometric information provided by its built-in pseudo-AI algorithm. However, due to the large variation of turbomachinery configurations, this initial grid may not always be as good as desired. TIGER therefore provides graphical user interactions during the process which allow the user to design, modify, as well as manipulate the grid, including the capability of elliptic surface grid generation.

Shih, Ming H.↗