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 559 records · Page 31

How well can gravity be recovered using Topex and GPS data?

When Topex is launched in mid-1992 it will carry a high quality GPS receiver which will operate in concert with a worldwide network of precision GPS ground receivers. The data from these receivers can be used to recover new information about the earth's gravity field at longer wavelengths. Software and algorithms have been developed which will allow this gravity field information to be recovered with much greater efficiency than with traditional techniques. The basis for these algorithms is the gravity bin formulation and related filtering techniques that exploit the repeat orbit of Topex and the sparse matrix structure of the problem. This new software has been used to evaluate the expected improvement in the gravity field using multiple ten-day arcs of GPS data from Topex.

Bertiger, Willy↗

Discrete integration of continuous Kalman filtering equations for time invariant second-order structural systems

A general form for the first-order representation of the continuous second-order linear structural-dynamics equations is introduced to derive a corresponding form of first-order continuous Kalman filtering equations. Time integration of the resulting equations is carried out via a set of linear multistep integration formulas. It is shown that a judicious combined selection of computational paths and the undetermined matrices introduced in the general form of the first-order linear structural systems leads to a class of second-order discrete Kalman filtering equations involving only symmetric sparse N x N solution matrices.

Park, K. C.↗

Australian topography from Seasat overland altimetry

Retracking of overland returns from the Seasat altimeter using algorithms originally developed for recovering elevations over ice has led to the successful recovery of high quality continental topography over Australia and other continents. Cross-over analysis both before and after orbit adjustment shows the altimetric data over land to have a 2-3 m quality. Direct comparison of gridded Seasat data with surface data re-averaged in the same way shows excellent agreement except where Seasat data are sparse, due either to poor track spacing or to dropouts caused by loss of tracker lock over steeply sloping ground. These results suggest that useful topographic data can be derived from Seasat and the more recent Geosat altimeters for parts of the world where surface data are few or of poor quality.

Frey, Herbert↗

Computing Gravitational Bumps From Repeating-Orbit Data

Iterative, least-squares algorithm efficiently computes estimates of both position errors indicative of irregularities in gravitational field of Earth and trajectory of satellite in orbit repeating along same ground track. Exploits sparse-matrix techniques. Useful in surveying, navigation, and geophysical research. Particularly useful for processing data on trajectory of satellite in low orbit tracked via Global Positioning System (GPS).

Wu, Jiun-Tsong↗

Generation Of Surface Grids From Data Points

Computational procedure generates grids on complicated three-dimensional surfaces from sets of data points that lie on and specify those surfaces. Starting with grouping of possibly sparse surface points into lines and/or patches, procedure involves interpolation within and blending of lines and/or patches and possibly redistribution and reassembly of patches to obtain finished system of zonal patch grids that match at boundaries between them. Procedure semiautomated via computer program that performs all steps except selection of patches and interpolation points, left to discretion of user.

Luh, Raymond Ching-Chung↗

A manual for PARTI runtime primitives

Primitives are presented that are designed to help users efficiently program irregular problems (e.g., unstructured mesh sweeps, sparse matrix codes, adaptive mesh partial differential equations solvers) on distributed memory machines. These primitives are also designed for use in compilers for distributed memory multiprocessors. Communications patterns are captured at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗

Contribution of cool dust to the FIR brightness distribution of NGC 6946 Sc(s)2

A few galaxies have been observed at submillimeter wavelengths (Stark et al., 1988; Eales, Wynn-Williams, and Duncan, 1988). These observations do not support the hypothesis that there exist substantial amounts of cool dust generating submillimeter radiation in excess of predictions from modified blackbody curves of the form (1/lambda)exp 1.5 B sub v (v, T) fit to total 100 and 160 micron fluxes. However, researchers find relatively cold dust (approx. 17 to 23 degrees K) at several interarm locations in the central 5 minute by 5 minute region of NGC 6946 Sc(s)II. Since molecular gas is the predominate constituent of the interstellar medium (ISM) in this region, such low dust temperatures are indicative of quiescent molecular clouds and low star formation rates. Based on the contribution of cool grains to the 160 micron surface brightness distribution, regions of low star formation activity can be identified. A 1/lambda exp 1.5 emissivity law is assumed for this analysis. Researchers assumed a two temperature grain model in an effort to decompose the far infrared surface brightness distribution of NGC 6946 into contributions from cool, quiescent and active, star forming regions. This model has some validity; although an oversimplification of the dust energetics, researchers find from it that, where giant HII regions are sparse, a significant fraction of the 160 micron emission is emitted by a cool grain component which the Infrared Astronomy Satellite (IRAS) could barely detect.

Engargiola, Greg↗

Demonstration of precise estimation of polar motion parameters with the global positioning system: Initial results

Data from the Global Positioning System (GPS) were used to determine precise polar motion estimates. Conservatively calculated formal errors of the GPS least squares solution are approx. 10 cm. The GPS estimates agree with independently determined polar motion values from very long baseline interferometry (VLBI) at the 5 cm level. The data were obtained from a partial constellation of GPS satellites and from a sparse worldwide distribution of ground stations. The accuracy of the GPS estimates should continue to improve as more satellites and ground receivers become operational, and eventually a near real time GPS capability should be available. Because the GPS data are obtained and processed independently from the large radio antennas at the Deep Space Network (DSN), GPS estimation could provide very precise measurements of Earth orientation for calibration of deep space tracking data and could significantly relieve the ever growing burden on the DSN radio telescopes to provide Earth platform calibrations.

Lichten, S. M.↗

A pressure flux-split technique for computation of inlet flow behavior

A method for calculating the flow field in aircraft engine inlets is presented. The phenomena of inlet unstart and restart are investigated. Solutions of the reduced Navier-Stokes (RNS) equations are obtained with a time consistent direct sparse matrix solver that computes the transient flow field both internal and external to the inlet. Time varying shocks and time varying recirculation regions can be efficiently analyzed. The code is quite general and is suitable for the computation of flow for a wide variety of geometries and over a wide range of Mach and Reynolds numbers.

Pordal, H. S.↗

Solution of three-dimensional afterbody flow using reduced Navier-Stokes equations

The flow over afterbody geometries was investigated using the reduced Navier-Stokes (RNS) approximation. Both pressure velocity flux-split and composites velocity primitive variable formulations were considered. Pressure or pseudopotential relaxation procedures are combined with sparse matrix or coupled strongly implicit algorithms to form a three-dimensional solver for general non-orthogonal coordinates. Three-dimensional subsonic and transonic viscous/inviscid interacting flows were evaluated. Solutions with and without regions of recirculation were obtained.

Almahroos, H. M. H.↗

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↗

Implicit solvers for unstructured meshes

Implicit methods were developed and tested for unstructured mesh computations. The approximate system which arises from the Newton linearization of the nonlinear evolution operator is solved by using the preconditioned GMRES (Generalized Minimum Residual) technique. Three different preconditioners were studied, namely, the incomplete LU factorization (ILU), block diagonal factorization, and the symmetric successive over relaxation (SSOR). The preconditioners were optimized to have good vectorization properties. SSOR and ILU were also studied as iterative schemes. The various methods are compared over a wide range of problems. Ordering of the unknowns, which affects the convergence of these sparse matrix iterative methods, is also studied. Results are presented for inviscid and turbulent viscous calculations on single and multielement airfoil configurations using globally and adaptively generated meshes.

Venkatakrishnan, V.↗

Heart-Lung Interactions in Aerospace Medicine

Few of the heart-lung interactions that are discussed have been studied in any detail in the aerospace environment, but is seems that many such interactions must occur in the setting of altered accelerative loadings and pressure breathing. That few investigations are in progress suggests that clinical and academic laboratory investigators and aerospace organizations are further apart than during the pioneering work on pressure breathing and acceleration tolerance in the 1940s. The purpose is to reintroduce some of the perennial problems of aviation physiology as well as some newer aerospace concerns that may be of interest. Many possible heart-lung interactions are pondered, by necessity often drawing on data from within the aviation field, collected before the modern understanding of these interactions developed, or on recent laboratory data that may not be strictly applicable. In the field of zero-gravity effects, speculation inevitably outruns the sparse available data.

Guy, Harold J. B.↗

A manual for PARTI runtime primitives, revision 1

Primitives are presented that are designed to help users efficiently program irregular problems (e.g., unstructured mesh sweeps, sparse matrix codes, adaptive mesh partial differential equations solvers) on distributed memory machines. These primitives are also designed for use in compilers for distributed memory multiprocessors. Communications patterns are captured at runtime, and the appropriate send and receive messages are automatically generated.

Das, Raja↗

Planetary surface structure and evolution of Mars

The surface of the planet Mars is characterized by two different hemispheres: old densely cratered structures in the Southern Uplands, and sparsely cratered younger topographically lower regions covering approximately the northern third of the planet's surface. The model for explaining these global surface structures is characterized by the following features: (1) homogeneous accretion of Mars; (2) formation of a metal melt layer; (3) northward translation of the undifferentiated core due to a Rayleigh-Taylor instability; (4) vigorous convection in the southern parts and formation of the Southern Uplands' crust; (5) fragmentation of the primordial core, slowly dissolving rockbergs, beginning of Tharsis uplift and volcanism; (6) formation of the Northern Lowlands' crust from only weakly differentiated silicatic material; and (7) reaching of the present state with symmetrically placed core and further thermal evolution.

Franck, Siegfried↗

Lanczos eigensolution method for high-performance computers

The theory, computational analysis, and applications are presented of a Lanczos algorithm on high performance computers. The computationally intensive steps of the algorithm are identified as: the matrix factorization, the forward/backward equation solution, and the matrix vector multiples. These computational steps are optimized to exploit the vector and parallel capabilities of high performance computers. The savings in computational time from applying optimization techniques such as: variable band and sparse data storage and access, loop unrolling, use of local memory, and compiler directives are presented. Two large scale structural analysis applications are described: the buckling of a composite blade stiffened panel with a cutout, and the vibration analysis of a high speed civil transport. The sequential computational time for the panel problem executed on a CONVEX computer of 181.6 seconds was decreased to 14.1 seconds with the optimized vector algorithm. The best computational time of 23 seconds for the transport problem with 17,000 degs of freedom was on the the Cray-YMP using an average of 3.63 processors.

Bostic, Susan W.↗

Distributed memory approaches for robotic neural controllers

The suitability is explored of two varieties of distributed memory neutral networks as trainable controllers for a simulated robotics task. The task requires that two cameras observe an arbitrary target point in space. Coordinates of the target on the camera image planes are passed to a neural controller which must learn to solve the inverse kinematics of a manipulator with one revolute and two prismatic joints. Two new network designs are evaluated. The first, radial basis sparse distributed memory (RBSDM), approximates functional mappings as sums of multivariate gaussians centered around previously learned patterns. The second network types involved variations of Adaptive Vector Quantizers or Self Organizing Maps. In these networks, random N dimensional points are given local connectivities. They are then exposed to training patterns and readjust their locations based on a nearest neighbor rule. Both approaches are tested based on their ability to interpolate manipulator joint coordinates for simulated arm movement while simultaneously performing stereo fusion of the camera data. Comparisons are made with classical k-nearest neighbor pattern recognition techniques.

Jorgensen, Charles C.↗