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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

FIDEX: An expert system for satellite diagnostics

A Fault Isolation and Diagnostic Expert system (FIDEX) was developed for communication satellite diagnostics. It was designed specifically for the 30/20 GHz satellite transponder. The expert system was designed with a generic structure and features that make it applicable to other types of space systems. FIDEX is a frame based system that enjoys many of the inherent frame base features, such as hierarchy that describes the transponder's components, with other hierarchies that provide structural and fault information about the transponder. This architecture provides a flexible diagnostic structure and enhances maintenance of the system. FIDEX also includes an inexact reasoning technique and a primitive learning ability. Inexact reasoning was an important feature for this system due to the sparse number of sensors available to provide information on the transponder's performance. FIDEX can determine the most likely faulted component under the constraint of limited information. FIDEX learns about the most likely faults in the transponder by keeping a record of past established faults. FIDEX also has the ability to detect anomalies in the sensors that provide information on the transponders performance.

Durkin, John↗
NASA NTRS1989

A Cerebellar-model Associative Memory as a Generalized Random-access Memory

A versatile neural-net model is explained in terms familiar to computer scientists and engineers. It is called the sparse distributed memory, and it is a random-access memory for very long words (for patterns with thousands of bits). Its potential utility is the result of several factors: (1) a large pattern representing an object or a scene or a moment can encode a large amount of information about what it represents; (2) this information can serve as an address to the memory, and it can also serve as data; (3) the memory is noise tolerant--the information need not be exact; (4) the memory can be made arbitrarily large and hence an arbitrary amount of information can be stored in it; and (5) the architecture is inherently parallel, allowing large memories to be fast. Such memories can become important components of future computers.

Kanerva, Pentti↗
NASA NTRS1991

Development of a steady potential solver for use with linearized, unsteady aerodynamic analyses

A full potential steady flow solver (SFLOW) developed explicitly for use with an inviscid unsteady aerodynamic analysis (LINFLO) is described. The steady solver uses the nonconservative form of the nonlinear potential flow equations together with an implicit, least squares, finite difference approximation to solve for the steady flow field. The difference equations were developed on a composite mesh which consists of a C grid embedded in a rectilinear (H grid) cascade mesh. The composite mesh is capable of resolving blade to blade and far field phenomena on the H grid, while accurately resolving local phenomena on the C grid. The resulting system of algebraic equations is arranged in matrix form using a sparse matrix package and solved by Newton's method. Steady and unsteady results are presented for two cascade configurations: a high speed compressor and a turbine with high exit Mach number.

Hoyniak, Daniel↗
NASA NTRS1992

Search for evidence of low energy protons in solar flares

We searched for linear polarization in the H alpha line using the Stokes Polarimeter at Mees Solar Observatory and present observations of a flare from NOAA active region 6659 which began at 01:30 UT on 14 Jun. 1991. Our dataset also includes H alpha spectra from the Mees charge coupled device (MCCD) imaging spectrograph as well as hard x ray observations from the Burst and Transient Source Experiment (BATSE) instrument on board the Gamma Ray Observatory (GRO). The polarimeter scanned a 40 x 40 inch field of view using 16 raster points in a 4 x 4 grid. Each scan took about 30 seconds with 2 seconds at each raster point. The polarimeter stopped 8.5 inches between raster points and each point covered a 6 inch region. This sparse sampling increased the total field of view without reducing the temporal cadence. At each raster point, an H alpha spectrum with 20 mA spectral sampling is obtained covering 2.6 A centered on H alpha line center. The preliminary conclusions from the research are presented.

Metcalf, Thomas R.↗
NASA NTRS1992

Interactive solution-adaptive grid generation procedure

TURBO-AD is an interactive solution adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution adaptive grid generation technique into a single interactive package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on the unit square in the parametric domain, and the new adapted grid is then mapped back to the physical domain. The grid adaption is achieved by adapting the control points to a numerical solution in the parametric domain using control sources obtained from the flow properties. Then a new modified grid is generated from the adapted control net. This process is efficient because the number of control points is much less than the number of grid points and the generation of the grid is an efficient algebraic process. TURBO-AD provides the user with both local and global controls.

Henderson, Todd L.↗
NASA NTRS1992

Interactive solution-adaptive grid generation

TURBO-AD is an interactive solution-adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution-adaptive grid generation technique into a single interactive solution-adaptive grid generation package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties that had been encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on a unit square in the parametric domain, and the new adapted grid in the parametric domain is then mapped back to the physical domain. The grid adaptation is achieved by first adapting the control points to a numerical solution in the parametric domain using control sources obtained from flow properties. Then a new modified grid is generated from the adapted control net. This solution-adaptive grid generation process is efficient because the number of control points is much less than the number of grid points and the generation of a new grid from the adapted control net is an efficient algebraic process. TURBO-AD provides the user with both local and global grid controls.

Choo, Yung K.↗
NASA NTRS1992

An incremental strategy for calculating consistent discrete CFD sensitivity derivatives

In this preliminary study involving advanced computational fluid dynamic (CFD) codes, an incremental formulation, also known as the 'delta' or 'correction' form, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods appear to be needed for future 3D applications; however, because direct solver methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form result in certain difficulties, such as ill-conditioning of the coefficient matrix, which can be overcome when these equations are cast in the incremental form; these and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two laminar sample problems: (1) transonic flow through a double-throat nozzle; and (2) flow over an isolated airfoil.

Korivi, Vamshi Mohan↗
NASA NTRS1992

Homogenization models for 2-D grid structures

In the past several years, we have pursued efforts related to the development of accurate models for the dynamics of flexible structures made of composite materials. Rather than viewing periodicity and sparseness as obstacles to be overcome, we exploit them to our advantage. We consider a variational problem on a domain that has large, periodically distributed holes. Using homogenization techniques we show that the solution to this problem is in some topology 'close' to the solution of a similar problem that holds on a much simpler domain. We study the behavior of the solution of the variational problem as the holes increase in number, but decrease in size in such a way that the total amount of material remains constant. The result is an equation that is in general more complex, but with a domain that is simply connected rather than perforated. We study the limit of the solution as the amount of material goes to zero. This second limit will, in most cases, retrieve much of the simplicity that was lost in the first limit without sacrificing the simplicity of the domain. Finally, we show that these results can be applied to the case of a vibrating Love-Kirchhoff plate with Kelvin-Voigt damping. We rely heavily on earlier results of (Du), (CS) for the static, undamped Love-Kirchhoff equation. Our efforts here result in a modification of those results to include both time dependence and Kelvin-Voigt damping.

Banks, H. T.↗
NASA NTRS1991

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

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 is presented. 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. It is shown 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.↗
NASA NTRS1992

Upper bounds for convergence rates of vector extrapolation methods on linear systems with initial iterations

The application of the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE) to a vector sequence obtained by the linear iterative technique x(sub j) + 1 = Ax(sub j) = b,j = 1,2,..., is considered. Both methods produce a two dimensional array of approximations s(sub n,k) to the solution of the system (I - A)x = b. Here, s(sub n,k) is obtained from the vectors x(sub j), n is less than or equal to j is less than or equal to n + k + 1. It was observed in an earlier publication by the first author that the sequence s(sub n,k), k = 1,2,..., for n greater than 0, but fixed, possesses better convergence properties than the sequence s(sub 0,k), k = 1,2,.... A detailed theoretical explanation for this phenomenon is provided in the present work. This explanation is heavily based on approximations by incomplete polynomials. It is demonstrated by numerical examples when the matrix A is sparse that cycling with s(sub n,k) for n greater than 0, but fixed, produces better convergence rates and costs less computationally than cycling with s(sub 0,k). It is also illustrated numerically with a convection-diffusion problem that the former may produce excellent results where the latter may fail completely. As has been shown in an earlier publication, the results produced by s(sub 0,k) are identical to the corresponding results obtained by applying the Arnoldi method or generalized minimal residual scheme (GMRES) to the system (I - A)x = b.

Sidi, Avram↗
NASA NTRS1992

Rational approximations from power series of vector-valued meromorphic functions

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Sidi, Avram↗
NASA NTRS1991

Eigenvalue calculation procedure for an Euler/Navier-Stokes solver with application to flows over airfoils

A Lanczos procedure is presently applied to a Navier-Stokes (N-S) solver for eigenvalues and eigenvectors associated with the small-perturbation analysis of the N-S equations' finite-difference representation for airfoil flows; the matrix used is very large, sparse, real, and nonsymmetric. The Lanczos procedure is shown to furnish complete spectral information for the eigenvalues, as required for transient-stability analysis of N-S solvers.

Mahajan, Aparajit J.↗
NASA NTRS1991

The fractional Fourier transform and applications

This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

Bailey, David H.↗
NASA NTRS1991

Evaporation over global oceans derived from satellite data and AGCM

Evaporation over ocean at 100 km has been estimated using operational satellite data. Recent satellite results are compared to data obtained through atmospheric general circulation models (AGCMs). A large systematic error is found in AGCM data which is considered to be due to overestimation of atmospheric moisture. It is suggested that the discrepancy may be caused by errors in operational infrared sounder data assimilated into the model. The error may also be caused by interpolation of very sparse in situ data in areas of sharp gradients.

Liu, W. T.↗
NASA NTRS1991

Comparing direct and iterative equation solvers in a large structural analysis software system

Two direct Choleski equation solvers and two iterative preconditioned conjugate gradient (PCG) equation solvers used in a large structural analysis software system are described. The two direct solvers are implementations of the Choleski method for variable-band matrix storage and sparse matrix storage. The two iterative PCG solvers include the Jacobi conjugate gradient method and an incomplete Choleski conjugate gradient method. The performance of the direct and iterative solvers is compared by solving several representative structural analysis problems. Some key factors affecting the performance of the iterative solvers relative to the direct solvers are identified.

Poole, E. L.↗
NASA NTRS1992

Deoxyribonucleoprotein structure and radiation injury - Cellular radiosensitivity is determined by LET-infinity-dependent DNA damage in hydrated deoxyribonucleoproteins and the extent of its repair

Until recently, OH radicals formed in bulk nuclear water were believed to be the major causes of DNA damage that results in cell death, especially for sparsely ionizing radiations. That hypothesis has now been challenged, if not refuted. Lethal genomic DNA damage is determined mainly by energy deposition in deoxyribonucleoproteins, and their hydration shells, and charge (energy) transfer processes within those structures.

Lett, J. T.↗
NASA NTRS1992

Modeling of solid/porous wall boundary conditions for the validation of computational fluid dynamics codes

A computational study has been undertaken to investigate method of modeling solid and porous wall boundary conditions in computational fluid dynamics (CFD) codes. The procedure utilizes experimental measurements at the walls to develop a flow field solution based on the method of singularities. This flow field solution is then imposed as a boundary condition in a CFD simulation of the internal flow field. The effectiveness of this method in describing the boundary conditions at the wind tunnel walls using only sparse experimental measurements has been investigated. Position and refinement of experimental measurement locations required to describe porous wall boundary conditions has also been considered.

Beutner, Thomas J.↗
NASA NTRS1992

Gravity field improvement using global positioning system data from TOPEX/Poseidon - A covariance analysis

The TOPEX/Poseidon satellite data can be used to improve the knowledge of the earth's gravitational field. The GPS data are especially useful for improving the gravity field over the world's oceans, where the current tracking data are sparse. Using realistic scenario for processing 10 days of GPS data, a covariance analysis is performed to obtain the expected improvement to the GEM-T2 gravity field. The large amount of GPS data and the large number of parameters (1979 parameters for the gravity field, plus carrier-phase biases, etc.) required special filtering techniques for efficient solution. The gravity-bin technique is used to compute the covariance matrix associated with the spherical harmonic gravity field. The covariance analysis shows that the GPS data from one 10-day arc of TOPEX/Poseidon with no a priori constraints can resolve medium degree and order (3-26) parameters with sigmas (standard deviations) that are an order of magnitude smaller than the corresponding sigmas of GEM-T2. When the information from GEM-T2 is combined with the TOPEX/Poseidon GPS measurements, an order-of-magnitude improvement is observed in low- and medium-degree terms with significant improvements spread over a wide range of degree and order.

Bertiger, Willy I.↗