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 595 records · Page 33

Iterative solution techniques in boundary element analysis

Iterative techniques for the solution of the algebraic equations associated with the direct boundary element analysis (BEA) method are discussed. Continuum structural response analysis problems are considered, employing single- and multizone boundary element models with and without zone condensation. The impact on convergence rate and computer resource requirements associated with the sparse and blocked matrices, resulting in multizone BEA, is studied. Both conjugate gradient and generalized minimum residual preconditioned iterative solvers are applied for these problems and the performance of these algorithms is reported. Included is a quantification of the impact of the preconditioning utilized to render the boundary element matrices solvable by the respective iterative methods in a time competitive with direct methods.

Kane, J. H.↗

A quantitative measure of phase correlations in density fields

A quantitative measure of the phase correlations in a density field is presented based on the location of the maxima of the Fourier components of that field. It is found that this measue can easily detect non-Gaussian behavior either in artificially constructed density fields or those that become non-Gaussian from gravitational clustering of Gaussian initial conditions. It is found that different initial power spectra produce somewhat distinguishable signals, and the signals are robust against sparse sampling.

Scherrer, Robert J.↗

X-ray emission from normal stars

The paper addresses the potential for future X-ray missions to determine the fundamental cause of stellar X-ray emissions based on available results and existing analyses. The determinants of stellar X-ray emission are listed, and the relation of stellar X-ray emissions to the 'universal' activity-rotation connection is discussed. The specific rotation-activity connection for evolved stars is mentioned, and the 'decay' of stellar activity at the low-mass end of the main sequence is related to observational data. The data from Einstein and EXOSAT missions that correspond to these issues are found to be sparse, and more observational work is found to be necessary. Also, it is concluded that some issues need to be addressed, such as the X-ray dividing line in evolved stars and the absence of X-ray emission from dA stars. The related observational requirements and instrumental capabilities are given for each significant research focus.

Rosner, Robert↗

Pluto-Charon stellar occultation candidates - 1990-1995

A search to identify stars that might be occulted by Pluto or Charon during the period 1990-1995 and part of 1996 is studied. This search was made with an unfiltered CCD camera operated in the strip scanning mode, and it reaches an R magnitude of approximately 17.5 - about 1.5 mag fainter than previous searches. Circumstances for each of the 162 potential occultations are given, including an approximate R magnitude of the star, which allows estimation of the signal-to-noise ratio (S/N) for observation of each occultation. The faintest stars in the list would yield an S/N of about 20 for a 1 s integration when observed with a CCD detector on an 8 m telescope under a dark sky. The astrometric precision (+/- 0.2 arcsec, with larger systematic errors possible for individual cases) is insufficient to serve as a final prediction for these potential occultations, but is sufficient to identify stars deserving of further, more accurate, astrometric observations. Statistically, about 32 of these events to be observable somewhere on earth are expected. The number of events actually observed will be substantially smaller because of clouds and the sparse distribution of large telescopes. Finder charts for each of the 91 stars involved are presented.

Dunham, E. W.↗

Performance effects of irregular communications patterns on massively parallel multiprocessors

A detailed study of the performance effects of irregular communications patterns on the CM-2 was conducted. The communications capabilities of the CM-2 were characterized under a variety of controlled conditions. In the process of carrying out the performance evaluation, extensive use was made of a parameterized synthetic mesh. In addition, timings with unstructured meshes generated for aerodynamic codes and a set of sparse matrices with banded patterns on non-zeroes were performed. This benchmarking suite stresses the communications capabilities of the CM-2 in a range of different ways. Benchmark results demonstrate that it is possible to make effective use of much of the massive concurrency available in the communications network.

Saltz, Joel↗

Digital Correlation In Laser-Speckle Velocimetry

Periodic recording helps to eliminate spurious results. Improved digital-correlation process extracts velocity field of two-dimensional flow from laser-speckle images of seed particles distributed sparsely in flow. Method which involves digital correlation of images recorded at unequal intervals, completely automated and has potential to be fastest yet.

Gilbert, John A.↗

Monitoring Global Temperatures From Satellites

Report provides evidence that passive microwave radiometry from satellites provides more-precise information on atmospheric temperatures than sparse distribution of thermometers. Accurate temperatures needed for detection of "greenhouse" warming, evaluation of computer models of change in climate, and for understanding important factors in climate system.

Spencer, Roy W.↗

Nonequilibrium Effects In Hypervelocity Flow

Report presents theoretical analysis of chemical and thermal nonequilibrium phenomena in stagnation region of blunt body traveling through sparse atmosphere at many times speed of sound. Analysis employs continuum-theory approach and based on viscous-layer and incipient-merged-layer regimes of rarefied flow.

Brown, Kevin G.↗

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 2

It is shown how the look-ahead Lanczos process (combined with a quasi-minimal residual QMR) approach) can be used to develop a robust black box solver for large sparse non-Hermitian linear systems. Details of an implementation of the resulting QMR algorithm are presented. It is demonstrated that the QMR method is closely related to the biconjugate gradient (BCG) algorithm; however, unlike BCG, the QMR algorithm has smooth convergence curves and good numerical properties. We report numerical experiments with our implementation of the look-ahead Lanczos algorithm, both for eigenvalue problem and linear systems. Also, program listings of FORTRAN implementations of the look-ahead algorithm and the QMR method are included.

Freund, Roland W.↗

A geometrical model for shepherding

Shepherding is the process by which a satellite secularly exchanges angular momentum with a nearby particle or gaseous disk. The sense of the torque is such that the separation between the orbits of the particles and the shepherd increases secularly with time. I devised a new technique to analyze the physical nature of shepherding through study of evolution of the vector eccentricity of the particles. This method appears to analyze the physical nature of shepherding in sparse particle disks. Thus, it may be very useful in calculating the torque on Neptune's rings and on protoplanets in the solar nebula. Moreover, the techniques are useful in estimating how long numerical simulations of resonant processes must be run in order to reach a quasi-steady state.

Lissauer, Jack J.↗

Weather prediction using a genetic memory

Kanaerva's sparse distributed memory (SDM) is an associative memory model based on the mathematical properties of high dimensional binary address spaces. Holland's genetic algorithms are a search technique for high dimensional spaces inspired by evolutional processes of DNA. Genetic Memory is a hybrid of the above two systems, in which the memory uses a genetic algorithm to dynamically reconfigure its physical storage locations to reflect correlations between the stored addresses and data. This architecture is designed to maximize the ability of the system to scale-up to handle real world problems.

Rogers, David↗

Distributed memory compiler methods for irregular problems: Data copy reuse and runtime partitioning

Outlined here are two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long as it can be verified that the values assigned to off-processor memory locations remain unmodified, we show that we can effectively reuse stored off-processor data. We present experimental data from a 3-D unstructured Euler solver run on iPSC/860 to demonstrate the usefulness of our methods.

Das, Raja↗

Neural networks and MIMD-multiprocessors

Two artificial neural network models are compared. They are the Hopfield Neural Network Model and the Sparse Distributed Memory model. Distributed algorithms for both of them are designed and implemented. The run time characteristics of the algorithms are analyzed theoretically and tested in practice. The storage capacities of the networks are compared. Implementations are done using a distributed multiprocessor system.

Vanhala, Jukka↗

Total recall in distributive associative memories

Iterative error correction of asymptotically large associative memories is equivalent to a one-step learning rule. This rule is the inverse of the activation function of the memory. Spectral representations of nonlinear activation functions are used to obtain the inverse in closed form for Sparse Distributed Memory, Selected-Coordinate Design, and Radial Basis Functions.

Danforth, Douglas G.↗

Optimal Chebyshev polynomials on ellipses in the complex plane

The design of iterative schemes for sparse matrix computations often leads to constrained polynomial approximation problems on sets in the complex plane. For the case of ellipses, we introduce a new class of complex polynomials which are in general very good approximations to the best polynomials and even optimal in most cases.

Fischer, Bernd↗

Numerical methods in Markov chain modeling

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Philippe, Bernard↗

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Freund, Roland↗

Evidence of chaotic pattern in solar flux through a reproducible sequence of period-doubling-type bifurcations

Presented here is a preliminary study of the limits to solar flux intensity prediction, and of whether the general lack of predictability in the solar flux arises from the nonlinear chaotic nature of the Sun's physical activity. Statistical analysis of a chaotic signal can extract only its most gross features, and detailed physical models fail, since even the simplest equations of motion for a nonlinear system can exhibit chaotic behavior. A recent theory by Feigenbaum suggests that nonlinear systems that can be led into chaotic behavior through a sequence of period-doubling bifurcations will exhibit a universal behavior. As the control parameter is increased, the bifurcation points occur in such a way that a proper ratio of these will approach the universal Feigenbaum number. Experimental evidence supporting the applicability of the Feigenbaum scenario to solar flux data is sparse. However, given the hypothesis that the Sun's convection zones are similar to a Rayleigh-Bernard mechanism, we can learn a great deal from the remarkable agreement observed between the prediction by theory (period doubling - a universal route to chaos) and the amplitude decrease of the signal's regular subharmonics. The authors show that period-doubling-type bifurcation is a possible route to a chaotic pattern of solar flux that is distinguishable from the logarithm of its power spectral density. This conclusion is the first positive step toward a reformulation of solar flux by a nonlinear chaotic approach. The ultimate goal of this research is to be able to predict an estimate of the upper and lower bounds for solar flux within its predictable zones. Naturally, it is an important task to identify the time horizons beyond which predictability becomes incompatible with computability.

Ashrafi, S.↗