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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

Algorithms for computing the geopotential using a simple density layer

Several algorithms have been developed for computing the potential and attraction of a simple density layer. These are numerical cubature, Taylor series, and a mixed analytic and numerical integration using a singularity-matching technique. A computer program has been written to combine these techniques for computing the disturbing acceleration on an artificial earth satellite. A total of 1640 equal-area, constant surface density blocks on an oblate spheroid are used. The singularity-matching algorithm is used in the subsatellite region, Taylor series in the surrounding zone, and numerical cubature on the rest of the earth.

Morrison, F.↗
NASA NTRS1996

A Structured Grid Based Solution-Adaptive Technique for Complex Separated Flows

The objective of this work was to enhance the predictive capability of widely used computational fluid dynamic (CFD) codes through the use of solution adaptive gridding. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. In order to study the accuracy and efficiency improvements due to the grid adaptation, it is necessary to quantify grid size and distribution requirements as well as computational times of non-adapted solutions. Flow fields about launch vehicles of practical interest often involve supersonic freestream conditions at angle of attack exhibiting large scale separate vortical flow, vortex-vortex and vortex-surface interactions, separated shear layers and multiple shocks of different intensity. In this work, a weight function and an associated mesh redistribution procedure is presented which detects and resolves these features without user intervention. Particular emphasis has been placed upon accurate resolution of expansion regions and boundary layers. Flow past a wedge at Mach=2.0 is used to illustrate the enhanced detection capabilities of this newly developed weight function.

Thornburg, Hugh↗
NASA NTRS1992

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗
NASA NTRS1993

A parallel adaptive mesh refinement algorithm

Over recent years, Adaptive Mesh Refinement (AMR) algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block-structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developer's viewpoint, this class of scheme is quite involved; these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirk's AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm.

Quirk, James J.↗
NASA NTRS1992

Least reliable bits coding (LRBC) for high data rate satellite communications

LRBC, a bandwidth efficient multilevel/multistage block-coded modulation technique, is analyzed. LRBC uses simple multilevel component codes that provide increased error protection on increasingly unreliable modulated bits in order to maintain an overall high code rate that increases spectral efficiency. Soft-decision multistage decoding is used to make decisions on unprotected bits through corrections made on more protected bits. Analytical expressions and tight performance bounds are used to show that LRBC can achieve increased spectral efficiency and maintain equivalent or better power efficiency compared to that of BPSK. The relative simplicity of Galois field algebra vs the Viterbi algorithm and the availability of high-speed commercial VLSI for block codes indicates that LRBC using block codes is a desirable method for high data rate implementations.

Vanderaar, Mark↗
NASA NTRS2012

Experimental Validation of Pulse Phase Tracking for X-Ray Pulsar Based

Pulsars are a form of variable celestial source that have shown to be usable as aids for autonomous, deep space navigation. Particularly those sources emitting in the X-ray band are ideal for navigation due to smaller detector sizes. In this paper X-ray photons arriving from a pulsar are modeled as a non-homogeneous Poisson process. The method of pulse phase tracking is then investigated as a technique to measure the radial distance traveled by a spacecraft over an observation interval. A maximum-likelihood phase estimator (MLE) is used for the case where the observed frequency signal is constant. For the varying signal frequency case, an algorithm is used in which the observation window is broken up into smaller blocks over which an MLE is used. The outputs of this phase estimation process were then looped through a digital phase-locked loop (DPLL) in order to reduce the errors and produce estimates of the doppler frequency. These phase tracking algorithms were tested both in a computer simulation environment and using the NASA Goddard Space flight Center X-ray Navigation Laboratory Testbed (GXLT). This provided an experimental validation with photons being emitted by a modulated X-ray source and detected by a silicon-drift detector. Models of the Crab pulsar and the pulsar B1821-24 were used in order to generate test scenarios. Three different simulated detector trajectories were used to be tracked by the phase tracking algorithm: a stationary case, one with constant velocity, and one with constant acceleration. All three were performed in one-dimension along the line of sight to the pulsar. The first two had a constant signal frequency and the third had a time varying frequency. All of the constant frequency cases were processed using the MLE, and it was shown that they tracked the initial phase within 0.15% for the simulations and 2.5% in the experiments, based on an average of ten runs. The MLE-DPLL cascade version of the phase tracking algorithm was used in the varying frequency case. This resulted in tracking of the phase and frequency by the DPLL outputs in both the simulation and experimental environments. The crab pulsar was experimentally tested with a trajectory with a higher acceleration. In this case the phase error tended toward zero as the observation extended to 250 seconds and the doppler frequency error tended to zero in under 100 seconds.

Experimental↗
NASA NTRS1973

Diagnostics of sources of disturbances and distribution of vibrations over the width of a tape in tape-feed mechanisms

Disturbances created by certain assemblies and components of tape-feed mechanisms (TFM) and acting on a moving magnetic tape are studied. The method, based on elements of digital logic, is established by stress-strain diagrams of the longitudinal deformations and vibrations across the width of a magnetic tape. Experimental studies were carried out for determination of the functional relationships of longitudinal deformations in a section of magnetic tape to the magnitude of roller play, tension vibrations rate of movement, and elasticity of magnetic tapes. A block diagram of the measurements is shown. Appropriate digital computer algorithms and programs were proposed for statistical analysis of the data obtained. Estimates of the mathematical expectation, dispersion, intercorrelation function, energy spectral density, and distribution pattern of the random process values were calculated.

Kenstavichyus, A. B. B.↗
NASA NTRS1975

Diagonalization and simultaneous symmetrization of the gas-dynamic matrices

The hyperbolic nature of the unsteady, inviscid, gas-dynamic equations implies the existence of a similarity transformation for diagonalizing an arbitrary linear combination of coefficient matrices. It is shown that the individual matrices are simultaneously symmetrized by the similarity transformation. The transformations and their norms can be applied to the well-posedness of the Cauchy problem, linear stability theory for finite-difference approximations, and simplification of block-tridiagonal systems that arise in implicit time-split algorithms.

Warming, R. F.↗
NASA NTRS1986

Implicit, vectorizable schemes for the flux-difference split, three-dimensional Navier-Stokes equations

Two hybrid upwind models are defined for solving the Euler equations. The algorithms both employ approximate factorization (AF) in crossplane and symmetric block Gauss-Seidel relaxation in the third direction. One approach adds an additional factorization step to lower the number of required grid point operations for inversion of the block tridiagonal matrices; however, the move permits only one third of the operations to be vectorized. Finite difference solutions are calculated on a C-H-type grid, in this case enveloping a slender, sharp-edged delta wing. Sample data are provided for the calculated vortex flow for Re of 10,000, at a 20.5 deg angle of attack, represented in a crossflow velocity vector plot and in a spanwise pressure coefficient distribution. The AF scheme, without additional factorization, when used with a grid covering 51 x 51 x 72 points provides a convergent solution with no time step lasting longer than 0.00001 sec.

Liu, C. H.↗
NASA NTRS1988

The development of flux-split algorithms for flows with non-equilibrium thermodynamics and chemical reactions

A finite-volume method for the numerical computation of flows with nonequilibrium thermodynamics and chemistry is presented. A thermodynamic model is described which simplifies the coupling between the chemistry and thermodynamics and also results in the retention of the homogeneity property of the Euler equations (including all the species continuity and vibrational energy conservation equations). Flux-splitting procedures are developed for the fully coupled equations involving fluid dynamics, chemical production and thermodynamic relaxation processes. New forms of flux-vector split and flux-difference split algorithms are embodied in a fully coupled, implicit, large-block structure, including all the species conservation and energy production equations. Several numerical examples are presented, including high-temperature shock tube and nozzle flows. The methodology is compared to other existing techniques, including spectral and central-differenced procedures, and favorable comparisons are shown regarding accuracy, shock-capturing and convergence rates.

Grossman, B.↗
NASA NTRS1990

New multi-level codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗
NASA NTRS1990

Demand Assignment in the ACTS LBR System

On the Advanced Communications Technology Satellite (ACTS) being developed at NASA Lewis, low-burst-rate (LBR) traffic stations will access the ACTS multibeam package via two hopping beams that can be directed at certain areas in the continental U.S. An onboard baseband processor (BBP) demodulates uplink traffic, switches it between uplink and downlink beams at baseband, and then remodulates it for retransmission at 20 GHz. This study describes the demand-assigned operation of the ACTS LBR system, where the onboard switch is remote from both traffic stations and master control station (MCS). Network control uses inbound and outbound orderwire channels and a BBP control channel, allowing the MCS to coordinate assignment of individual 64-kb/s spacecraft channels. Models are developed to simulate the dynamics of the assignment process and verify the call blocking behavior, to predict control channel loads, and to evaluate algorithms for burst time plan rearrangement.

White, Lawrence W.↗
NASA NTRS1992

New multilevel codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗
NASA NTRS2004

Interactive Terascale Particle Visualization

This paper describes the methods used to produce an interactive visualization of a 2 TB computational fluid dynamics (CFD) data set using particle tracing (streaklines). We use the method introduced by Bruckschen et al. [2001] that pre-computes a large number of particles, stores them on disk using a space-filling curve ordering that minimizes seeks, and then retrieves and displays the particles according to the user's command. We describe how the particle computation can be performed using a PC cluster, how the algorithm can be adapted to work with a multi-block curvilinear mesh, and how the out-of-core visualization can be scaled to 296 billion particles while still achieving interactive performance on PG hardware. Compared to the earlier work, our data set size and total number of particles are an order of magnitude larger. We also describe a new compression technique that allows the lossless compression of the particles by 41% and speeds the particle retrieval by about 30%.

Ellsworth, David↗
NASA NTRS2014

A Semiautomated Multilayer Picking Algorithm for Ice-sheet Radar Echograms Applied to Ground-Based Near-Surface Data

Snow accumulation over an ice sheet is the sole mass input, making it a primary measurement for understanding the past, present, and future mass balance. Near-surface frequency-modulated continuous-wave (FMCW) radars image isochronous firn layers recording accumulation histories. The Semiautomated Multilayer Picking Algorithm (SAMPA) was designed and developed to trace annual accumulation layers in polar firn from both airborne and ground-based radars. The SAMPA algorithm is based on the Radon transform (RT) computed by blocks and angular orientations over a radar echogram. For each echogram's block, the RT maps firn segmented-layer features into peaks, which are picked using amplitude and width threshold parameters of peaks. A backward RT is then computed for each corresponding block, mapping the peaks back into picked segmented-layers. The segmented layers are then connected and smoothed to achieve a final layer pick across the echogram. Once input parameters are trained, SAMPA operates autonomously and can process hundreds of kilometers of radar data picking more than 40 layers. SAMPA final pick results and layer numbering still require a cursory manual adjustment to correct noncontinuous picks, which are likely not annual, and to correct for inconsistency in layer numbering. Despite the manual effort to train and check SAMPA results, it is an efficient tool for picking multiple accumulation layers in polar firn, reducing time over manual digitizing efforts. The trackability of good detected layers is greater than 90%.

Antarctic Ice-Sheet↗
NASA NTRSDate not supplied

Hardware Autonomy for Space Infrastructure

NASA prioritizes autonomous systems development with the expectation that it will continue to drive significant improvements in human and science exploration capability. Crew operations benefit from a spectrum of machine assistance to complete replacement of dangerous or highly repetitive tasks. Many science operations have a teleoperation component, and similarly benefit from a range of autonomy implementations that make long distance applications feasible. As we consider longer duration deep space missions, we also consider higher levels of autonomy in order meet emergent safety, maintenance, and logistics needs. One of the challenges within this scope is installation and maintenance of infrastructure, such as large scale instrumentation and communications equipment, crew habitats, and operational facilities. We describe how a programmable meta-material architecture may shift the paradigm of how we design, build, and operate future space infrastructure and assets. A primary objective of this strategy is to free the design space from launch vehicle constraints and fundamentally shift how a mission is designed and conducted. This integrates advances in materials (mechanical meta-materials), manufacturing (cooperative mobile robotics), and autonomy (multi-agent planning algorithms). Engineering systems that utilize a modular and reconfiguration building block approach, such as digital communication and computation systems, currently lead in terms of size and complexity scalability. NASA is extending the benefits and flexibility of digital systems to hardware systems, to optimize materials life-cycle management and expand our space exploration mission capabilities to meet long duration and deep space infrastructure needs, in accordance with long term NASA goals of "in-space reliance" and "mass-less exploration."

In space assembly↗
NASA NTRS1991

Derivative interface conditions for multiblock grids

Methods are developed for computing numerical solutions along block boundaries, even when there is a discontinuity in the grid lines or slopes. The technique is based on matching derivatives and does not require overlapping and interpolation of solution values at block boundaries. The comparison of block boundary values is implicit and has proven to be stable for both implicit and explicit numerical algorithms. Examples are included for the numerical solution of the Euler equations for compressible flow on grids with both grid line discontinuities and discontinuous slopes at block boundaries.

Mastin, C. W.↗
NASA NTRS2015

Enhancements of Bayesian Blocks; Application to Large Light Curve Databases

Bayesian Blocks are optimal piecewise linear representations (step function fits) of light-curves. The simple algorithm implementing this idea, using dynamic programming, has been extended to include more data modes and fitness metrics, multivariate analysis, and data on the circle (Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations, Scargle, Norris, Jackson and Chiang 2013, ApJ, 764, 167), as well as new results on background subtraction and refinement of the procedure for precise timing of transient events in sparse data. Example demonstrations will include exploratory analysis of the Kepler light curve archive in a search for "star-tickling" signals from extraterrestrial civilizations. (The Cepheid Galactic Internet, Learned, Kudritzki, Pakvasa1, and Zee, 2008, arXiv: 0809.0339; Walkowicz et al., in progress).

Kepler light curve archive↗