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 109 records · Page 6

On the solution of elastic-plastic static and dynamic postbuckling collapse of general structure

Many investigations have considered structural collapse from strictly the transient point of view. While such an approach is ideally correct, certain difficulties have to be overcome in its implementation. The present investigation is concerned with the development of self-adaptive algorithms which make it possible to conduct the analysis of both static elastic and elastic-plastic postbuckling, as well as static loading to the onset of buckling followed by subsequent dynamic postbuckling. The approach employed to solve the static portion of loading is to extend the constrained Incremental Newton-Raphson (INR) algorithm by incorporating elastic-plastic constitutive characterizations. Large deformation moderate strain theory is adopted to establish the overall strategy. Attention is given to governing field equations, aspects of algorithmic development, and numerical experiments conducted to illustrate the efficiency and stability of the developed schemes.

Padovan, J.↗

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗

Real-time Adaptive Control Using Neural Generalized Predictive Control

The objective of this paper is to demonstrate the feasibility of a Nonlinear Generalized Predictive Control algorithm by showing real-time adaptive control on a plant with relatively fast time-constants. Generalized Predictive Control has classically been used in process control where linear control laws were formulated for plants with relatively slow time-constants. The plant of interest for this paper is a magnetic levitation device that is nonlinear and open-loop unstable. In this application, the reference model of the plant is a neural network that has an embedded nominal linear model in the network weights. The control based on the linear model provides initial stability at the beginning of network training. In using a neural network the control laws are nonlinear and online adaptation of the model is possible to capture unmodeled or time-varying dynamics. Newton-Raphson is the minimization algorithm. Newton-Raphson requires the calculation of the Hessian, but even with this computational expense the low iteration rate make this a viable algorithm for real-time control.

Haley, Pam↗

Superconvergence of Online Optimization for Model Predictive Control

We develop a one-Newton-step-per-horizon, online, lag-L, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Based on recent sensitivity analysis results for the target problems class, we prove that the approach exhibits a behavior that we call superconvergence; that is, the tracking error with respect to the full horizon solution is not only stable for successive horizon shifts, but also decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. The key analytical step is the decomposition of the one-step error recursion of our algorithm into algorithmic error and perturbation error. We show that the perturbation error decays exponentially with the lag between two consecutive receding horizons, while the algorithmic error, determined by Newton’s method, achieves quadratic convergence instead. Overall this approach induces our local exponential convergence result in terms of the receding horizon length for suitable values of L. In conclusion, numerical experiments validate our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Computation of the shock-wave boundary layer interaction with flow separation

The boundary layer concept is used to describe the flow near the wall. The external flow is approximated by a pressure displacement relationship (tangent wedge in linearized supersonic flow). The boundary layer equations are solved in finite difference form and the question of the presence and unicity of the solution is considered for the direct problem (assumed pressure) or converse problem (assumed displacement thickness, friction ratio). The coupling algorithm presented implicitly processes the downstream boundary condition necessary to correctly define the interacting boundary layer problem. The algorithm uses a Newton linearization technique to provide a fast convergence.

Ardonceau, P.↗

Aircraft automatic digital flight control system with inversion of the model in the feed-forward path

A full-flight-envelope automatic trajectory control system concept is being investigated at Ames Research Center. This concept was developed for advanced aircraft configurations with severe nonlinear characteristics. A feature of the system is an inverse of the complete nonlinear aircraft model as part of the feed-forward control path. Simulation and flight tests have been reported at previous Digital Avionics Systems conferences. A new method for the continuous real-time inversion of the aircraft model using a Newton-Raphson trim algorithm instead of the original inverse table look-up procedure has been developed. The results of a simulation study of a vertical attitude takeoff and landing aircraft using the new inversion technique are presented. Maneuvers were successfully carried out in all directions in the vertical-attitude hover mode. Transition runs from conventional flight through the region of lift-curve-slope reversal at an angle of attack of about 32 deg and to hover at zero speed in the vertical attitude showed satisfactory transient response. Simulations were also conducted in conventional flight at high subsonic speed in steep climb and with turns up to 4 g. Successful flight tests of the system with the new model-inversion technique in a UH-1H helicopter have recently been carried out.

Smith, G. A.↗

Numerical recovery of material parameters in Euler-Bernoulli beam models

A fully Sinc-Galerkin method for recovering the spatially varying stiffness parameter in fourth-order time-dependence problems with fixed and cantilever boundary conditions is presented. The forward problems are discretized with a sinc basis in both the spatial and temporal domains. This yields an approximation solution which converges exponentially and is valid on the infinite time interval. When the forward methods are applied to parameter recovery problems, the resulting inverse problems are ill-posed. Tikhonov regularization is applied and the resulting minimization problems are solved via a quasi-Newton/trust region algorithm. The L-curve method is used to determine an appropriate value of the regularization parameter. Numerical results which highlight the method are given for problems with both fixed and cantilever boundary conditions.

Smith, R. C.↗

Sinc-Galerkin estimation of diffusivity in parabolic problems

A fully Sinc-Galerkin method for the numerical recovery of spatially varying diffusion coefficients in linear partial differential equations is presented. Because the parameter recovery problems are inherently ill-posed, an output error criterion in conjunction with Tikhonov regularization is used to formulate them as infinite-dimensional minimization problems. The forward problems are discretized with a sinc basis in both the spatial and temporal domains thus yielding an approximate solution which displays an exponential convergence rate and is valid on the infinite time interval. The minimization problems are then solved via a quasi-Newton/trust region algorithm. The L-curve technique for determining an approximate value of the regularization parameter is briefly discussed, and numerical examples are given which show the applicability of the method both for problems with noise-free data as well as for those whose data contains white noise.

Smith, Ralph C.↗

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.↗