Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

The distribution of maser emission in OH/IR stars

The 1612 MHz OH emission from five OH/IR stars has been mapped at three epochs over a 2.5 yr period of time. Although the stars were observed at very different phases in the radio light curve of each, there were no remarkable changes in the appearance of the maps. This probably implies that the properties of the masers do not range widely throughout a maser shell. The maps have been used to produce star-centered surface maps of the distribution of maser emission from each star. The surface maps generally are sparsely filled with OH emission and are dominated by relatively few (about 10) major clumps of emission. The presence of large regions of low intensity in the surface maps suggests that the number of individual emitting elements is relatively small or that there are a larger number of elements which are distributed in the shell in a distinctly nonrandom manner.

Welty, Alan D.↗
NASA NTRS1987

Directional scattering properties of a winter deciduous hardwood canopy

The unique directional scattering properties of a deciduous hardwood forest without leaves during the winter period was measured in a visible and near-infrared band. A radiative transfer model was used to explore the scattering properties of such a forest. The reflectance distributions look similar to sparse homogeneous vegetation canopies. The overall reflectance distribution is a combination of the extreme azimuthal scattering behavior of tree limbs and the more typical scattering behavior of understory litter.

Kimes, Daniel S.↗
NASA NTRS1987

Principles for problem aggregation and assignment in medium scale multiprocessors

One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior.

Nicol, David M.↗
NASA NTRS1987

Methods for design and evaluation of integrated hardware/software systems for concurrent computation

Two testbed programming environments to support the evaluation of a large range of parallel architectures have been implemented under the program Parallel Implementation of Scientific Computing Environments (PISCES). The PISCES 1 environment was applied to two areas of aerospace interest: a sparse matrix iterative equation solver and a dynamic scene analysis system. Currently, the NICE/SPAR testbed system for structural analysis is being modified for parallel operation under PISCES 2; the PISCES 1 applications are also being adapted for PISCES 2. A new formal model of concurrent computation has been developed, based on the mathematical system known as H graph semantics together with a timed Petri net model of the parallel aspects of a system.

Pratt, Terrence W.↗
NASA NTRS1987

Analysis of airborne imaging spectrometer data for the Ruby Mountains, Montana, by use of absorption-band-depth images

Airborne Imaging Spectrometer-1 (AIS-1) data were obtained for an area of amphibolite grade metamorphic rocks that have moderate rangeland vegetation cover. Although rock exposures are sparse and patchy at this site, soils are visible through the vegetation and typically comprise 20 to 30 percent of the surface area. Channel averaged low band depth images for diagnostic soil rock absorption bands. Sets of three such images were combined to produce color composite band depth images. This relative simple approach did not require extensive calibration efforts and was effective for discerning a number of spectrally distinctive rocks and soils, including soils having high talc concentrations. The results show that the high spectral and spatial resolution of AIS-1 and future sensors hold considerable promise for mapping mineral variations in soil, even in moderately vegetated areas.

Brickey, David W.↗
NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗
NASA NTRS1988

Nature and origin of mineral coatings on volcanic rocks of the Black Mountain, Stonewall Mountain, and Kane Springs Wash volcanic centers, Southern Nevada

Comparative lab spectra and Thematic Mapper imagery investigations at 3 Tertiary calderas in southern Nevada indicate that desert varnish is absorbant relative to underlying host rocks below about 0.7 to 1.3 microns, depending on mafic affinity of the sample, but less absorbant than mafic host rocks at higher wavelengths. Desert varnish occurs chiefly as thin impregnating films. Distribution of significant varnish accumulations is sparse and localized, occurring chiefly in surface recesses. These relationships result in the longer wavelength bands and high 5/2 values over felsic units with extensive desert varnish coatings. These lithologic, petrochemical, and desert varnish controlled spectral responses lead to characteristic TM band relationships which tend to correlate with conventionally mappable geologic formations. The concept of a Rock-Varnish Index (RVI) is introduced to help distinguish rocks with a potentially detectable varnish. Felsic rocks have a high RVI, and those with extensive desert varnish behave differently, spectrally, from those without extensive varnish. The spectrally distinctive volcanic formations at Stonewall Mountain provide excellent statistical class segregation on supervised classification images. A binary decision rule flow-diagram is presented to aid TM imagery analysis over volcanic terrane in semi-arid environments.

Taranik, James V.↗
NASA NTRS1988

Determination of the Venus flyby orbits of the Soviet Vega probes using VLBI techniques

In December 1984, the Soviet Union launched two identical Vega spacecraft with the dual objective of exploring Venus and continuing to rendezvous with the comet Halley. The two Vega spacecraft encountered Venus in mid-June 1985 and successfully deployed entry probes and wind-measuring balloons into the Venus atmosphere. An objective of the Venus Balloon experiment was to measure the Venus winds using differential VLBI from the balloon and the flyby bus. NASA's Deep Space 64 meter subnet was part of a world wide network organized to collect data from the Vega probes and balloons. A critical element of this experiment was an accurate determination of the Venus relative flyby orbits of the Vega spacecraft during the 46 hour balloon lifetime. Venus flyby solutions were independently determined by the Soviets using two-way range and Doppler from Soviet stations and by JPL using one-way Doppler and VLBI data collected from the DSN. The Vega flyby solutions determined by the Soviets using a sparse two-way tracking strategy with JPL solutions using the DSN VLBI data to complement the Soviet data and with solutions using only one-way data collected by the DSN were compared.

Ellis, J.↗
NASA NTRS1987

Monitoring global vegetation using Nimbus-7 37 GHz data - Some empirical relations

The difference of the vertically and horizontally polarized brightness temperatures observed by the 37 GHz channel of the SMMR on board the Nimbus-7 satellite are correlated temporally with three indicators of vegetation density, namely the temporal variation of the atmospheric CO2 concentration at Mauna Loa (Hawaii), rainfall over the Sahel and the normalized difference vegetation index derived from the AVHRR on board the NOAA-7 satellite. SMMR 37 GHz and AVHRR provide complementary data sets for monitoring global vegetation, the 37 GHz data being more suitable for arid and semiarid regions as these data are more sensitive to changes in sparse vegetation. The 37-GHz data might be useful for understanding desertification and indexing Co2 exchange between the biosphere and the atmosphere.

Choudhury, B. J.↗
NASA NTRS1987

A hypermatrix formulation for subspace iteration

The computational efficiency of subspace iteration is addressed relative to the data structures adopted for the very large and generally sparse coefficient matrices. The frequent triangulations and matrix multiplications demand that access to the terms in the coefficient matrices be unbiased. Reliance on virtual memory (paging) operating systems with no special considerations for localized data access is not adequate. Specific data structures must be designed that accommodate the needs of the numerical algorithm yet eliminate unnecessary paging. An implementation of the subspace iteration method using hypermatrix data structures is presented. Use of hypermatrices is shown to provide unbiased and localized data access. The various modifications to the conventional formulation are described and an example problem illustrates the potential benefits of the hypermatrix formulation. Possibilities for adapting hypermatrix data structures to new supercomputer architectures are discussed.

Schmidt, Richard J.↗
NASA NTRS1988

Newton solution of inviscid and viscous problems

The application of Newton iteration to inviscid and viscous airfoil calculations is examined. Spatial discretization is performed using upwind differences with split fluxes. The system of linear equations which arises as a result of linearization in time is solved directly using either a banded matrix solver or a sparse matrix solver. In the latter case, the solver is used in conjunction with the nested dissection strategy, whose implementation for airfoil calculations is discussed. The boundary conditions are also implemented in a fully implicit manner, thus yielding quadratic convergence. Complexities such as the ordering of cell nodes and the use of a far field vortex to correct freestream for a lifting airfoil are addressed. Various methods to accelerate convergence and improve computational efficiency while using Newton iteration are discussed. Results are presented for inviscid, transonic nonlifting and lifting airfoils and also for laminar viscous cases.

Venkatakrishnan, V.↗
NASA NTRS1987

Techniques of ground-truth measurements of desert-scrub structure

Inversion of remote sensing data taken over a desert scrub surface in Texas with a multidirectionally viewing field radiometer, PARABOLA, yields the value of 0.12 for the protrusion parameter, s, (the projection on a vertical plane of plants per unit area) if isotropy (Lambert law) is assumed for the underlying soil. However, a significantly higher value of s, in the range 0.15 to 0.20, can be inferred if the soil is assumed anisotropic. It is concluded that in remote sensing of sparse vegetation, it is important to know the reflectance characteristics of the underlying soil. Other techniques that can be used to infer desert scrub vegetation structure include various photographic techniques, and measurements of reflected radiance from zenith for a range of solar elevation angles on a clear day.

Ottermann, J.↗
NASA NTRS1988

Navigation with noncoherent data - A demonstration for VEGA Venus flyby phase

Deep Space navigation with noncoherent (one-way) data types is demonstrated for the VEGA Venus flyby phase under extreme conditions. Estimates and statistics are computed using one-way Doppler and wideband Very Long Baseline Interferometry (VLBI) data. The behavior of the onboard oscillator is modeled for both spacecraft to obtain useful orbit determination results. Even with this limitation, it is demonstrated that one-way data solutions are comparable with the solutions using both Soviet sparse coherent (two-way) and wideband VLBI data. During the useful life time of VEGA balloons, the two solutions differ by a maximum of 4.7 km in position and 7.6 cm/sec in velocity for VEGA 1 and by a maximum of 8 km and 42 cm/sec for VEGA 2.

Bhat, Ramachandra S.↗
NASA NTRS1988

Plasma acceleration, injection, and loss - Observational aspects

A history of the understanding of the sudden accelerations of charged particles noted in plasmas, and the accompanying intrusions of energized plasma into adjacent regions of space, is presented. It is pointed out that studies of the earth's magnetosphere are hampered by the lack of adequate sampling in space and time. Although the feature matching technique of building magnetic and electric field models can help compensate for the sparseness of experimental data, future studies will nonetheless require large numbers of spacecraft placed in carefully coordinated orbits. The notion that the ignition of portions of the auroral shell in association with earth flares results in the heating of ionospheric particles that are then convected inward to form the ring current is considered.

Mcilwain, C. E.↗
NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗
NASA NTRS1988

Interactive grid generation for turbomachinery flow field simulations

The control point form of algebraic grid generation presented provides the means that are needed to generate well structured grids for turbomachinery flow simulations. It uses a sparse collection of control points distributed over the flow domain. The shape and position of coordinate curves can be adjusted from these control points while the grid conforms precisely to all boundaries. An interactive program called TURBO, which uses the control point form, is being developed. Basic features of the code are discussed and sample grids are presented. A finite volume LU implicit scheme is used to simulate flow in a turbine cascade on the grid generated by the program.

Choo, Yung K.↗
NASA NTRS1988

On the constrained Chebyshev approximation problem on ellipses

Constrained Chebyshev approximation problems of the type with minimum (p is an element of Pi(sub n):p(c)=1) and maximum (z is an element of E) with /p(z)/ are considered. Here Pi(sub n) denotes the set of all complex polynomials of degree at most n, E is any ellipse in the complex plane, and c is an element of C/E. Such approximation problems arise in the context of optimizing semi-iterative methods for the solution of large, sparse systems of linear equations Ax=b with complex non-Hermitian coefficient matrices A. The problem of obtaining optimal polynomial preconditioners for conjugate gradient type methods for Ax=b also leads to problems of this type. A new family of polynomials -- q(sub n)(z;c), n is an element of N, and c is an element of C/E -- are introduced as the polynomials which are optimal for a modified version of the Chebyshev approximation problem with Pi(sub n) replaced by a certain subfamily. Some simple properties of q(sub n) are also listed. A necessary and sufficient condition for q(sub n) to be the extremal polynomial for the approximation problem is then derived. Finally, it is shown that q(sub n) is indeed optimal for the problem for all fixed n whenever the distance between c and E is sufficiently large. Results of some numerical tests are presented.

Freund, Roland↗
NASA NTRS1988

The solution of linear systems of equations with a structural analysis code on the NAS CRAY-2

Two methods for solving linear systems of equations on the NAS Cray-2 are described. One is a direct method; the other is an iterative method. Both methods exploit the architecture of the Cray-2, particularly the vectorization, and are aimed at structural analysis applications. To demonstrate and evaluate the methods, they were installed in a finite element structural analysis code denoted the Computational Structural Mechanics (CSM) Testbed. A description of the techniques used to integrate the two solvers into the Testbed is given. Storage schemes, memory requirements, operation counts, and reformatting procedures are discussed. Finally, results from the new methods are compared with results from the initial Testbed sparse Choleski equation solver for three structural analysis problems. The new direct solvers described achieve the highest computational rates of the methods compared. The new iterative methods are not able to achieve as high computation rates as the vectorized direct solvers but are best for well conditioned problems which require fewer iterations to converge to the solution.

Poole, Eugene L.↗