Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton 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 91 records · Page 5

A global path planning approach for redundant manipulators

A new approach for global path planning of redundant manipulators is proposed. It poses the path planning problem as a finite time nonlinear control problem. The solution is found by a Newton-Raphson type algorithm. This technique is capable of handling various goal task descriptions as well as incorporating both joint and task space constraints. The algorithm has shown promising preliminary results in planning joint path sequences for 3R and 4R planar robots to meet Cartesian tip tracking and goal endpoint planning. It is robust with respect to local path planning problems such as singularity considerations and local minimum problems. Repetitive joint path solutions for cyclic end-effector tasks are also generated. Eventual goals of this work include implementation on full spatial robots, as well as provision of an interface for supervisory input to aid in path planning for more complex problems.

Seereeram, Sanjeev↗

A kinematically driven anisotropic viscoelastic constitutive model applied to tires

Aircraft tires are composite structures manufactured with viscoelastic materials such as carbon black filled rubber and nylon cords. When loaded they experience large deflections and moderately large strains. Detailed structural models of tires require the use of either nonlinear shell or nonlinear three dimensional solid finite elements. Computational predictions of the dynamic response of tires must consider the composite viscoelastic material behavior in a realistic fashion. We describe a modification to a nonlinear anisotropic shell finite element so it can be used to model viscoelastic stresses during general deformations. The model is developed by introducing internal variables of the type used to model elastic strain energy. The internal variables are strains, curvatures, and transverse shear angles which are in a one-to-one correspondence with the generalized coordinates used to model the elastic strain energy for nonlinear response. A difference-relaxation equation is used to relate changes in the observable strain field to changes in the internal strain field. The internal stress state is introduced into the equilibrium equations by converting it to nodal loads associated with the element's displacement degrees of freedom. In this form the tangent matrix in the Newton-Raphson solution algorithm is not modified from its form for the nonlinear statics problem. Only the gradient vector is modified and the modification is not computationally costly. The existing finite element model for the Space Shuttle nose gear tire is used to provide examples of the algorithm. In the first example, the tire's rim is displaced at a constant rate up to a fixed value. In the second example, the tire's rim is enforced to follow a saw tooth load and unload curve to generate hysteresis loops.

Johnson, Arthur R.↗

Aerodynamic shape optimization using control theory

Aerodynamic shape design has long persisted as a difficult scientific challenge due its highly nonlinear flow physics and daunting geometric complexity. However, with the emergence of Computational Fluid Dynamics (CFD) it has become possible to make accurate predictions of flows which are not dominated by viscous effects. It is thus worthwhile to explore the extension of CFD methods for flow analysis to the treatment of aerodynamic shape design. Two new aerodynamic shape design methods are developed which combine existing CFD technology, optimal control theory, and numerical optimization techniques. Flow analysis methods for the potential flow equation and the Euler equations form the basis of the two respective design methods. In each case, optimal control theory is used to derive the adjoint differential equations, the solution of which provides the necessary gradient information to a numerical optimization method much more efficiently then by conventional finite differencing. Each technique uses a quasi-Newton numerical optimization algorithm to drive an aerodynamic objective function toward a minimum. An analytic grid perturbation method is developed to modify body fitted meshes to accommodate shape changes during the design process. Both Hicks-Henne perturbation functions and B-spline control points are explored as suitable design variables. The new methods prove to be computationally efficient and robust, and can be used for practical airfoil design including geometric and aerodynamic constraints. Objective functions are chosen to allow both inverse design to a target pressure distribution and wave drag minimization. Several design cases are presented for each method illustrating its practicality and efficiency. These include non-lifting and lifting airfoils operating at both subsonic and transonic conditions.

Reuther, James↗

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

Hughes, Steven P.↗

Self-adaptive Solution Strategies

The development of enhancements to current generation nonlinear finite element algorithms of the incremental Newton-Raphson type was overviewed. Work was introduced on alternative formulations which lead to improve algorithms that avoid the need for global level updating and inversion. To quantify the enhanced Newton-Raphson scheme and the new alternative algorithm, the results of several benchmarks are presented.

Padovan, J.↗

A study of equation solvers for linear and non-linear finite element analysis on parallel processing computers

Concurrent computing environments provide the means to achieve very high performance for finite element analysis of systems, provided the algorithms take advantage of multiple processors. The authors have examined several algorithms for both linear and nonlinear finite element analysis. The performance of these algorithms on an Alliant FX/80 parallel supercomputer has been studied. For single load case linear analysis, the optimal solution algorithm is strongly problem dependent. For multiple load cases or nonlinear analysis through a modified Newton-Raphson method, decomposition algorithms are shown to have a decided advantage over element-by-element preconditioned conjugate gradient algorithms.

Watson, Brian C.↗

Luminous Binary Supersoft X-Ray Sources

This has been a remarkably productive year. We have completed an algorithm to select SSSs in external galaxies which have been observed by Chandru or XMM-Newton. By applying this algorithm to new data, we have discovered an extension of the class of SSSs to sources that are somewhat harder (100 - 300 eV, instead of tens of eV), but which are nevertheless much softer than canonical X-ray sources. We have completed a study of SSSs in M31 and have also considered several other galaxies. From these studies, some population characteristics are beginning to emerge; these provide clues to the natures of the systems. We have considered ultraluminous SSSs in M1O1 and NGC 300. It is possible that these may correspond to accreting intermediate-mass black holes, rather than accreting white dwarfs. We have also studied individual systems, such as CAL 83, and have followed up on additional sources in fields we have studied, such as in the galaxy NGC 1313. NASA has released a press release on some of our work.

DiStefano, Rosanne↗

Luminous Binary Supersoft X-Ray Sources

One of the key accomplishments of the two preceding years was our development of an algorithm to select SSSs in external galaxies which have been observed by Chandra or XMM-Newton. By applying this algorithm to data from a number of galaxies, we discovered an extension of the class of SSSs to sources that are somewhat harder (100 - 300 eV, instead of tens of eV), but which are nevertheless much softer than canonical X-ray sources. We call these new sources quasisoft sources (QSSs). During this past year, we have built on and extended this work. We have (1) continued to identify SSSs and QSSs in external galaxies, (2) worked on models for the sources and find that black hole models seem promising for a subset of them, and (3) have studied individual systems, especially M101-ULX1. This special system has been observed as an SSS in its high &ate, with a luminosity in excess of 10(exp 41) erg/s. It has also been observed as a QSS when it is less luminous, and as a hard source in its low state. It is one of the best candidates to be an accreting intermediate-mass black hole. We have several papers in preparation. Below we list papers which are complete, including only new work and papers whose status has changed (e.g., been accepted for publication) since our last report. In addition, our work on QSSs has received some publicity. It was the subject of a Chandra press release and was picked up by several media outlets.

Oliversen, Ronald J.↗

Solution algorithms for non-linear singularly perturbed optimal control problems

The applicability and usefulness of several classical and other methods for solving the two-point boundary-value problem which arises in non-linear singularly perturbed optimal control are assessed. Specific algorithms of the Picard, Newton and averaging types are formally developed for this class of problem. The computational requirements associated with each algorithm are analysed and compared with the computational requirement of the method of matched asymptotic expansions. Approximate solutions to a linear and a non-linear problem are obtained by each method and compared.

Ardema, M. D.↗

Fast polar decomposition of an arbitrary matrix

The polar decomposition of an m x n matrix A of full rank, where m is greater than or equal to n, can be computed using a quadratically convergent algorithm. The algorithm is based on a Newton iteration involving a matrix inverse. With the use of a preliminary complete orthogonal decomposition the algorithm can be extended to arbitrary A. How to use the algorithm to compute the positive semi-definite square root of a Hermitian positive semi-definite matrix is described. A hybrid algorithm which adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bjorck and Bowie is formulated. The decision when to switch is made using a condition estimator. This matrix multiplication rich algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.

Higham, Nicholas J.↗

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure distributions and drag-to-lift ration minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗

On-line methods for rotorcraft aeroelastic mode identification

The requirements for the on-line identification of rotorcraft aeroelastic blade modes from random response test data are presented. A recursive maximum likelihood (RML) technique is used in conjunction with a bandpass filter to identify isolated blade mode damping and frequency. The RML technique is demonstrated to have excellent convergence characteristics in random measurement noise and random process noise excitation. The RML identification technique uses an ARMA representation for the aeroelastic stochastic system and requires virtually no user interaction while providing accurate confidence bands on the parameter estimates. Comparisons are made with an off-line Newton type maximum likelihood algorithm which uses a state variable model representation. Results are presented from simulation random response data which quantify the identifed parameter convergence behavior for various levels of random excitation which is typical of wind tunnel turbulence levels. The RML technique is applied to hingless rotor test data from the NASA Langley Research Center Helicopter Hover Facility.

Molusis, J. A.↗

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure disributions and drag-to-lift ratio minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗

Structural parameter identification of distributed systems using finite element approximation

A system identification technique is developed for classes of distributed systems using finite element approximations. Vibrating systems represented by partial differential equations have physical parameters associated with mass, stiffness, and damping distributions which need to be known in order to properly control and design mathematical models of the system. In order to identify these parameters a weighted least-squares algorithm and modified Newton-Raphson method is used for the identification process. The theory and technique is demonstrated by estimating the system parameters of a vibrating cantilever beam made up of several different structural properties.

Lee, K. Y.↗

Material parameter measurements at high temperatures

Alternate fixtures of techniques for the measurement of the constitutive material parameters at elevated temperatures are presented. The technique utilizes scattered field data from material coated cylinders between parallel plates or material coated hemispheres over a finite size groundplane. The data acquisition is centered around the HP 8510B Network Analyzer. The parameters are then found from a numerical search algorithm using the Newton-Ralphson technique with the measured and calculated fields from these canonical scatters. Numerical and experimental results are shown.

Dominek, A.↗

First MEM task IRMEO in IRAF

The first task for image restoration using the Maximum Entropy Method (MEM) in IRAF, called IRMEO, is described. The underlining algorithm is the approximate Newton method for optimization. The basic input images and parameters for deconvolution are described in some detail. Results of preliminary tests, including the number of iterations, required CPU time on a variety of computers, and deconvolved images are reported and compared with those from other deconvolution methods. The merits and limitations of this task are pointed out. The possible development of better MEM tasks on the basis of IRMEO is also discussed.

Wu, Nailong↗

Optimization Based Efficiencies in First Order Reliability Analysis

This paper develops a method for updating the gradient vector of the limit state function in reliability analysis using Broyden's rank one updating technique. In problems that use commercial code as a black box, the gradient calculations are usually done using a finite difference approach, which becomes very expensive for large system models. The proposed method replaces the finite difference gradient calculations in a standard first order reliability method (FORM) with Broyden's Quasi-Newton technique. The resulting algorithm of Broyden updates within a FORM framework (BFORM) is used to run several example problems, and the results compared to standard FORM results. It is found that BFORM typically requires fewer functional evaluations that FORM to converge to the same answer.

Peck, Jeffrey A.↗