Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Applications of Parallel Computation in Micro-Mechanics and Finite Element Method

This project discusses the application of parallel computations related with respect to material analyses. Briefly speaking, we analyze some kind of material by elements computations. We call an element a cell here. A cell is divided into a number of subelements called subcells and all subcells in a cell have the identical structure. The detailed structure will be given later in this paper. It is obvious that the problem is "well-structured". SIMD machine would be a better choice. In this paper we try to look into the potentials of SIMD machine in dealing with finite element computation by developing appropriate algorithms on MasPar, a SIMD parallel machine. In section 2, the architecture of MasPar will be discussed. A brief review of the parallel programming language MPL also is given in that section. In section 3, some general parallel algorithms which might be useful to the project will be proposed. And, combining with the algorithms, some features of MPL will be discussed in more detail. In section 4, the computational structure of cell/subcell model will be given. The idea of designing the parallel algorithm for the model will be demonstrated. Finally in section 5, a summary will be given.

Tan, Hui-Qian↗
NASA NTRS2003

Robot Tracking of Human Subjects in Field Environments

Future planetary exploration will involve both humans and robots. Understanding and improving their interaction is a main focus of research in the Intelligent Systems Branch at NASA's Johnson Space Center. By teaming intelligent robots with astronauts on surface extra-vehicular activities (EVAs), safety and productivity can be improved. The EVA Robotic Assistant (ERA) project was established to study the issues of human-robot teams, to develop a testbed robot to assist space-suited humans in exploration tasks, and to experimentally determine the effectiveness of an EVA assistant robot. A companion paper discusses the ERA project in general, its history starting with ASRO (Astronaut-Rover project), and the results of recent field tests in Arizona. This paper focuses on one aspect of the research, robot tracking, in greater detail: the software architecture and algorithms. The ERA robot is capable of moving towards and/or continuously following mobile or stationary targets or sequences of targets. The contributions made by this research include how the low-level pose data is assembled, normalized and communicated, how the tracking algorithm was generalized and implemented, and qualitative performance reports from recent field tests.

Graham, Jeffrey↗
NASA NTRS1992

Recent developments of the NESSUS probabilistic structural analysis computer program

The NESSUS probabilistic structural analysis computer program combines state-of-the-art probabilistic algorithms with general purpose structural analysis methods to compute the probabilistic response and the reliability of engineering structures. Uncertainty in loading, material properties, geometry, boundary conditions and initial conditions can be simulated. The structural analysis methods include nonlinear finite element and boundary element methods. Several probabilistic algorithms are available such as the advanced mean value method and the adaptive importance sampling method. The scope of the code has recently been expanded to include probabilistic life and fatigue prediction of structures in terms of component and system reliability and risk analysis of structures considering cost of failure. The code is currently being extended to structural reliability considering progressive crack propagation. Several examples are presented to demonstrate the new capabilities.

Millwater, H.↗
NASA NTRSDate not supplied

Performance Analysis of SmallSat Aerocapture at Venus

Aerocapture is a method of spacecraft orbital insertion that has the potential to provide mass savings as compared to aerobraking. In particular, aerocapture at Venus is desirable due to high atmospheric density and potential for science return. While promising, accurate orbital insertion by means of aerocapture requires an active guidance, navigation, and control architecture. This paper documents the initial assessment of the performance of two guidance algorithms, a generalized numerical predictor corrector and the Fully-Numeric Predictor- corrector for Aerocapture Guidance, applied to smallsat aerocapture at Venus using two different simulation environments with equivalent simulation inputs. Nominal trajectory performance is assessed. In addition, Monte Carlo analysis is performed to compare each guidance algorithm’s performance under uncertainty.

aerocapture↗
NASA NTRSDate not supplied

Performance Analysis of SmallSat Aerocapture at Venus

Aerocapture is a method of spacecraft orbital insertion that has the potential to provide mass savings as compared to aerobraking. In particular, aerocapture at Venus is desirable due to high atmospheric density and potential for science return. While promising, accurate orbital insertion by means of aerocapture requires an active guidance, navigation, and control architecture. This paper documents the initial assessment of the performance of two guidance algorithms, a generalized numerical predictor corrector and the Fully-Numeric Predictor-corrector for Aerocapture Guidance, applied to smallsat aerocapture at Venus using two different simulation environments with equivalent simulation inputs. Nominal trajectory performance is assessed. In addition, Monte Carlo analysis is performed to compare each guidance algorithm’s performance under uncertainty.

aerocapture↗
NASA NTRS1989

Rapid calculation of radiative heating rates and photodissociation rates in inhomogeneous multiple scattering atmospheres

The solution of the generalized two-stream approximation for radiative transfer in homogeneous multiple scattering atmospheres is extended to vertically inhomogeneous atmospheres in a manner which is numerically stable and computationally efficient. It is shown that solar energy deposition rates, photolysis rates, and infrared cooling rates all may be calculated with the simple modifications of a single algorithm. The accuracy of the algorithm is generally better than 10 percent, so that other uncertainties, such as in absorption coefficients, may often dominate the error in calculation of the quantities of interest to atmospheric studies.

Toon, Owen B.↗
NASA NTRS1989

Two novel automatic frequency tracking loops

Two automatic-frequency-control (AFC) loops are introduced and analyzed in detail. The algorithms are generalizations of the well known cross-product AFC loop with improved performance. The first estimator uses running overlapping discrete Fourier transforms to create a discriminator curve proportional to the frequency estimation error, whereas the second one preprocesses the received data and then uses an extended Kalman filter to estimate the input frequency. The algorithms are tested by computer simulations in a highly dynamic environment at low carrier/noise ratio (CNR). The algorithms are suboptimum tracking schemes with a larger frequency-error variance compared to an optimum strategy, but they offer simplicity of mechanization and a CNR with a very low operating threshold.

Aguirre, Sergio↗
NASA NTRS1996

Stochastic Filtering of Rain Profiles Using Radar, Surface-Referenced Radar, or Combined Radar-Radiometer Measurements

This paper describes a computationally efficient nearly optimal Bayesian algorithm to estimate rain (and drop size distribution) profiles, given a radar reflectivity profile at a single attenuating wavelength. In addition to estimating the averages of all the mutually ambiguous combinations of rain parameters that can produce the data observed, the approach also calculates the n-ns uncertainty in its estimates (this uncertainty thus quantifies "the amount of ambiguity" in the "solution"). The paper also describes a more general approach that can make estimates based on a radar reflectivity profile together with an approximate measurement of the path-integrated attenuation, or a radar reflectivity profile and a set of passive microwave brightness temperatures. This more general "combined" algorithm is currently being adapted for the Tropical Rainfall Measuring Mission.

Haddad, Ziad S.↗
NASA NTRS1995

Examination of a Practical Aerobraking Guidance Algorithm

A practical real time guidance algorithm has been developed for aerobraking vehicles that minimizes the post-aeropass Delta V requirements for orbit insertion while nearly minimizing the maximum heating rate and the maximum structural loads. The algorithm is general in the sense that a minimum of assumptions is made, thus greatly reducing the number of parameters that must be determined prior to a given mission. An interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency, and ease of use. The algorithm is designed for, but not restricted to, a trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm during flight in Earth's atmosphere is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗
NASA NTRS1985

The Caltech Concurrent Computation Program - Project description

The Caltech Concurrent Computation Program wwhich studies basic issues in computational science is described. The research builds on initial work where novel concurrent hardware, the necessary systems software to use it and twenty significant scientific implementations running on the initial 32, 64, and 128 node hypercube machines have been constructed. A major goal of the program will be to extend this work into new disciplines and more complex algorithms including general packages that decompose arbitrary problems in major application areas. New high-performance concurrent processors with up to 1024-nodes, over a gigabyte of memory and multigigaflop performance are being constructed. The implementations cover a wide range of problems in areas such as high energy and astrophysics, condensed matter, chemical reactions, plasma physics, applied mathematics, geophysics, simulation, CAD for VLSI, graphics and image processing. The products of the research program include the concurrent algorithms, hardware, systems software, and complete program implementations.

Fox, G.↗
NASA NTRS1989

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗
NASA NTRS1984

An algorithm for maximum likelihood estimation using an efficient method for approximating sensitivities

An algorithm for maximum likelihood (ML) estimation is developed primarily for multivariable dynamic systems. The algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). The method determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared with integrating the analytically determined sensitivity equations or using a finite-difference method. Different surface-fitting methods are discussed and demonstrated. Aircraft estimation problems are solved by using both simulated and real-flight data to compare MNRES with commonly used methods; in these solutions MNRES is found to be equally accurate and substantially faster. MNRES eliminates the need to derive sensitivity equations, thus producing a more generally applicable algorithm.

Murphy, P. C.↗
NASA NTRS1978

A high order accurate finite element algorithm for high Reynolds number flow prediction

A Galerkin-weighted residuals formulation is employed to establish an implicit finite element solution algorithm for generally nonlinear initial-boundary value problems. Solution accuracy, and convergence rate with discretization refinement, are quantized in several error norms, by a systematic study of numerical solutions to several nonlinear parabolic and a hyperbolic partial differential equation characteristic of the equations governing fluid flows. Solutions are generated using selective linear, quadratic and cubic basis functions. Richardson extrapolation is employed to generate a higher-order accurate solution to facilitate isolation of truncation error in all norms. Extension of the mathematical theory underlying accuracy and convergence concepts for linear elliptic equations is predicted for equations characteristic of laminar and turbulent fluid flows at nonmodest Reynolds number. The nondiagonal initial-value matrix structure introduced by the finite element theory is determined intrinsic to improved solution accuracy and convergence. A factored Jacobian iteration algorithm is derived and evaluated to yield a consequential reduction in both computer storage and execution CPU requirements while retaining solution accuracy.

Baker, A. J.↗
NASA NTRS1972

Automated aircraft scheduling methods in the near terminal area.

A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.

Tobias, L.↗
NASA NTRS1972

Solution of eigenvalue problems by Sturm sequence method.

A generalized eigenvalue algorithm is presented herein along with the complete listing of the associated computer program, which may be conveniently utilized for the efficient solution of certain broad classes of eigenvalue problems. Extensive applications of the procedure are envisaged in the analysis of many important engineering problems, such as stability and natural frequency analysis of practical discrete structural systems, idealized by the finite element technique. The procedure based on the Sturm sequence method is accurate and fast, possessing several significant advantages over other known methods of such analysis. Numerical results are also presented for two representative structural engineering problems.

Gupta, K. K.↗
NASA NTRS1973

Structural optimization by methods of feasible directions.

A general design algorithm based on methods of feasible directions is presented. Zoutendijk's method of feasible directions is first presented as applied to structural design. This method is modified to improve numerical stability of the design process and is then further modified to deal efficiently with infeasible designs. The algorithm requires the analytic gradient of the objective function and the constraint functions which are active at a given stage in the design process. Gradient information is not required for nonactive constraints. Complex constraint functions may be ignored in the initial design stages because violation of these constraints is efficiently overcome later in the design process. The algorithm is demonstrated with elastic design of redundant trusses.

Vanderplaats, G. N.↗
NASA NTRS1975

Certain aspects of the psychological analysis of programmer activity

The psychological analysis of programmer activity showed that one of its basic characteristics is the need to employ formal languages. In determining ways of effectively mastering the capacity to write algorithms in the algorithmic language, it is expedient to proceed from its similarity to the living languages and the language of mathematical formulas, and to choose certain psychological principles of mastering foreign languages and mathematical symbols in teaching the algorithmic language. General models of the input language significantly increase the effectiveness of its mastery and permit the development of thinking on the part of the students.

Bondarovskaya, V. M.↗