Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration method”

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 955 records · Page 53

Application of Machine Learning Techniques in Calibration and Data Reduction of Multi-Hole Probes

This work presents procedures to implement machine learning methods in the existing algorithms for multi-hole probe calibrations and data reduction. It is shown here, that utilizing artificial neural networks (ANNs) can reduce the amount of calibration data that needs to be acquired in order to obtain a specific calibration uncertainty, by more than 50% while simultaneously reducing data reduction times significantly. ANNs were used instead of the surface fitting methods, where first, the directional calibration coefficients related to the flow angles are calculated based on the pressure measurements, and then the flow angles are used as a set of the input parameters for the following ANNs to define Mach number and static and total pressure iteratively. In a second approach, novel calibration coefficients were used to directly relate the pressure measurements from five-hole probe to the quantities of interest thus, eliminating the need for iterative algorithms used in the conventional surface fitting methods. The advantageous features of this method are an average increase of less than 1% in the calibration uncertainty for flow angles and significant reduction of the data reduction times (few seconds). In addition, we confirmed the methodology to avoid over-fitting and under-fitting.

Machine Learning↗

Improving the numerical integration solution of satellite orbits in the presence of solar radiation pressure using modified back differences

The method of modified back differences, a technique that significantly reduces the numerical integration errors associated with crossing shadow boundaries using a fixed-mesh multistep integrator without a significant increase in computer run time, is presented. While Hubbard's integral approach can produce significant improvements to the trajectory solution, the interpolation method provides the best overall results. It is demonstrated that iterating on the point mass term correction is also important for achieving the best overall results. It is also shown that the method of modified back differences can be implemented with only a small increase in execution time.

Lundberg, J. B.↗

The multigrid method: Fast relaxation

A multi-level grid method was studied as a possible means of accelerating convergence in relaxation calculations for transonic flows. The method employs a hierarchy of grids, ranging from very coarse (e.g. 4 x 2 mesh cells) to fine (e.g. 64 x 32); the coarser grids are used to diminish the magnitude of the smooth part of the residuals, hopefully with far less total work than would be required with optimal iterations on the finest grid. To date the method was applied quite successfully to the solution of the transonic small-disturbance equation for the velocity potential in conservation form. Nonlifting transonic flow past a parabolic arc airfoil is the example studied, with meshes of both constant and variable step size.

South, J. C., Jr.↗

An implementation of the QMR method based on coupled two-term recurrences

The authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term recurrences. It has been observed that, in finite precision arithmetic, vector iterations based on three-term recursions are usually less robust than mathematically equivalent coupled two-term vector recurrences. This paper presents a look-ahead algorithm that constructs the Lanczos basis vectors by means of coupled two-term recursions. Implementation details are given, and the look-ahead strategy is described. A new implementation of the QMR method, based on this coupled two-term algorithm, is described. A simplified version of the QMR algorithm without look-ahead is also presented, and the special case of QMR for complex symmetric linear systems is considered. Results of numerical experiments comparing the original and the new implementations of the QMR method are reported.

Freund, Roland W.↗

Parallel linear equation solvers for finite element computations

The overall objective of this research is to develop efficient methods for the solution of linear and nonlinear systems of equations on parallel and supercomputers, and to apply these methods to the solution of problems in structural analysis. Attention has been given so far only to linear equations. The methods considered for the solution of the stiffness equation Kx=f have been Choleski factorization and the conjugate gradient iteration with SSOR and Incomplete Choleski preconditioning. More detail on these methods will be given on subsequent slides. These methods have been used to solve for the static displacements for the mast and panel focus problems in conjunction with the CSM testbed system based on NICE/SPAR.

Ortega, James M.↗

Reconfigurable Flight Control Designs With Application to the X-33 Vehicle

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the right body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗

Two Reconfigurable Flight-Control Design Methods: Robust Servomechanism and Control Allocation

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the fight body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗

Reconstruction of coded aperture images

Balanced correlation method and the Maximum Entropy Method (MEM) were implemented to reconstruct a laboratory X-ray source as imaged by a Uniformly Redundant Array (URA) system. Although the MEM method has advantages over the balanced correlation method, it is computationally time consuming because of the iterative nature of its solution. Massively Parallel Processing, with its parallel array structure is ideally suited for such computations. These preliminary results indicate that it is possible to use the MEM method in future coded-aperture experiments with the help of the MPP.

Bielefeld, Michael J.↗

Computer modification reduces time of performing iterative division

Time reduction in performing iterative division results from using a serial-by-parallel divider employing a look-ahead feature that predetermines the sign relationships of several iterations before the computer cycle begins. This method can be employed in any data handling system performing high-speed division.

Source record↗

Performance Analysis and Design Synthesis (PADS) computer program. Volume 2: Program description, part 2

The QL module of the Performance Analysis and Design Synthesis (PADS) computer program is described. Execution of this module is initiated when and if subroutine PADSI calls subroutine GROPE. Subroutine GROPE controls the high level logical flow of the QL module. The purpose of the module is to determine a trajectory that satisfies the necessary variational conditions for optimal performance. The module achieves this by solving a nonlinear multi-point boundary value problem. The numerical method employed is described. It is an iterative technique that converges quadratically when it does converge. The three basic steps of the module are: (1) initialization, (2) iteration, and (3) culmination. For Volume 1 see N73-13199.

Source record↗

On the computation of the generalized inverse by classical minimization.

An alternative method for deriving the generalized inverse of an arbitrary rectangular matrix with real or complex coefficients is described. The method applies a classical minimization procedure without iteration processes and is readily applicable in digital computer programming.

Voith, R. P.↗

Analytical model of the combustion of multicomponent solid propellants

Multiple flame models derived for simple composite propellants are extended to describe the combustion of propellants containing multimodal particle sizes, mixed oxidizers and monopropellant binders. Models combining the component contributions to propellant surface structure, flame structure and energy distribution are based in part upon experimental observations and in part upon hypotheses constrained to provide reasonable agreement with measured burning rate characteristics. The methods employed consist of superposition, interaction and iteration. The computerized model is applied to explain the effects of multiple ingredients and to discuss burning rate tailoring problems of current interest.

Cohen, N. S.↗

Finite-element solutions for geothermal systems

Vector potential and scalar potential are used to formulate the governing equations for a single-component and single-phase geothermal system. By assuming an initial temperature field, the fluid velocity can be determined which, in turn, is used to calculate the convective heat transfer. The energy equation is then solved by considering convected heat as a distributed source. Using the resulting temperature to compute new source terms, the final results are obtained by iterations of the procedure. Finite-element methods are proposed for modeling of realistic geothermal systems; the advantages of such methods are discussed. The developed methodology is then applied to a sample problem. Favorable agreement is obtained by comparisons with a previous study.

Chen, J. C.↗

A family of solution algorithms for nonlinear structural analysis based on relaxation equations

A family of hierarchical algorithms for nonlinear structural equations are presented. The algorithms are based on the Davidenko-Branin type homotopy and shown to yield consistent hierarchical perturbation equations. The algorithms appear to be particularly suitable to problems involving bifurcation and limit point calculations. An important by-product of the algorithms is that it provides a systematic and economical means for computing the stepsize at each iteration stage when a Newton-like method is employed to solve the systems of equations. Some sample problems are provided to illustrate the characteristics of the algorithms.

Park, K. C.↗

Evaluation and development of new VAS remote sensing algorithms

An algorithm, developed to permit the simultaneous retrieval of temperature/moisture profiles and surface skin temperature by direct analytical solution of the radiative transfer equation, alleviates the problem associated with the interdependencies of water vapor retrieval on temperature retrieval and their dependencies on surface emissions. Simultaneous solution of all these quantities is achieved in one calculation using the available radiance observations. Since only a single matrix inversion is required for the specification of all parameters, the solution is computationally efficient. Ancillary observations of temperature and/or moisture from surface sensors on aircraft can be readily incorporated into the solution. Simulation tests of the method indicate improved performance over the previous iterative technique, particularly for the lower troposphere and for water vapor.

Smith, W. L.↗

Some iterative schemes for transonic potential flows

The minimal residual (MR) method for the numerical solution of transonic potential flows is closely related to the conjugate gradient method, which has found widespread use in the solution of large sparse, symmetric, and positive-definite linear equations. The primary advantage of the MR method is its applicability to both symmetric and nonsymmetric matrices.

Wong, Y. S.↗