Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “homotopy”

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 19 records

Experiments with conjugate gradient algorithms for homotopy curve tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Irani, Kashmira M.↗

Minimization versus homotopy algorithms

The relative merits and demerits of the minimization techniques are assessed using globally convergent quasi-Newton algorithms on the one hand and the homotopy algorithms on the other hand for the solution of problems of nonlinear structural analysis. Like the homotopy algorithms, the globally convergent quasi-Newton algorithms are equally suited for the solution of the nonlinear equations of structural analysis directly without having to pose the problem as an equivalent minimization problem. In the close neighborhood of the limit and bifurcation points quasi-Newton algorithms experience difficulties. Homotopy algorithms are robust for practically all types of nonlinear problems but are computationally not as cost effective since they provide an extremely accurate prediction of the response by calculating it as a large number of points. Globally convergent algorithms can perform well with very approximate Hessians, while homotopy algorithms require extremely accurate Hessians. While quasi-Newton algorithms can be very easily structured to exploit sparsity and symmetry, homotopy algorithms are not presently so structured and would require special modifications for exploitation of such features without sacrificing robustness and global convergence.

Kamat, M. P.↗

A homotopy algorithm for digital optimal projection control GASD-HADOC

The linear-quadratic-gaussian (LQG) compensator was developed to facilitate the design of control laws for multi-input, multi-output (MIMO) systems. The compensator is computed by solving two algebraic equations for which standard closed-loop solutions exist. Unfortunately, the minimal dimension of an LQG compensator is almost always equal to the dimension of the plant and can thus often violate practical implementation constraints on controller order. This deficiency is especially highlighted when considering control-design for high-order systems such as flexible space structures. This deficiency motivated the development of techniques that enable the design of optimal controllers whose dimension is less than that of the design plant. A homotopy approach based on the optimal projection equations that characterize the necessary conditions for optimal reduced-order control. Homotopy algorithms have global convergence properties and hence do not require that the initializing reduced-order controller be close to the optimal reduced-order controller to guarantee convergence. However, the homotopy algorithm previously developed for solving the optimal projection equations has sublinear convergence properties and the convergence slows at higher authority levels and may fail. A new homotopy algorithm for synthesizing optimal reduced-order controllers for discrete-time systems is described. Unlike the previous homotopy approach, the new algorithm is a gradient-based, parameter optimization formulation and was implemented in MATLAB. The results reported may offer the foundation for a reliable approach to optimal, reduced-order controller design.

Collins, Emmanuel G., Jr.↗

Parallel homotopy curve tracking on a hypercube

An investigation is conducted to find good parallel algorithms for solving systems of nonlinear equations using probability-one homotopy methods. Particular attention is paid to algorithms for the hypercube. Methods for one of the most computationally expensive steps of the homotopy approach, the computation of the kernel of the Jacobian matrix of the homotopy map, are studied. General nonlinear systems of equations with small and dense Jacobian matrices are considered, however, polynomial systems are not, since their structure leads to different strategies for parallelism. The mathematics behind the homotopy algorithm is summarized and the use of orthogonal factorizations is discussed. Parallel algorithms for orthogonal factorizations and triangular system solving are described. Computational results are presented and discussed.

Chakraborty, A.↗

Note on unit tangent vector computation for homotopy curve tracking on a hypercube

Probability-one homotopy methods are a class of methods for solving nonlinear systems of equations that are globally convergent from an arbitrary starting point. The essence of all such algorithms is the construction of an appropriate homotopy map and subsequent tracking of some smooth curve in the zero set of the homotopy map. Tracking a homotopy curve involves finding the unit tangent vector at different points along the zero curve, which amounts to calculating the kernel of the n x (n + 1) Jacobian matrix. While computing the tangent vector is just one part of the curve tracking algorithm, it can require a significant percentage of the total tracking time. This note presents computational results showing the performance of several different parallel orthogonal factorization/triangular system solving algorithms for the tangent vector computation on a hypercube.

Chakraborty, A.↗

Tracing structural optima as a function of available resources by a homotopy method

Optimization problems are typically solved by starting with an initial estimate and proceeding iteratively to improve it until the optimum is found. The design points along the path from the initial estimate to the optimum are usually of no value. The present work proposes a strategy for tracing a path of optimum solutions parameterized by the amount of available resources. The paper specifically treats the optimum design of a structure to maximize its buckling load. Equations for the optimum path are obtained using Lagrange multipliers, and solved by a homotopy method. The solution path has several transitions from unimodal to bimodal solutions. The Lagrange multipliers and second-order optimality conditions are used to detect branching points and to switch to the optimum solution path. The procedure is applied to the design of a foundation which supports a column for maximum buckling load. Using the total available foundation stiffness as a homotopy parameter, a set of optimum foundation designs is obtained.

Haftka, Raphael T.↗

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Mercadal, Mathieu↗

A quasi-Newton versus a homotopy method for nonlinear structural analysis

The globally convergent quasi-Newton minimization algorithm and the homotopy algorithms are discussed in detail and their effectiveness in solving certain classes of highly nonlinear problems of structural analysis is demonstrated. The application of the double dogleg strategy controls the directions and step-lengths of the quasi-Newtonian algorithm and overcomes the problem of nonpositive definite Hessians being produced during the iteration process. The algorithms are applied to a centrally loaded clamped beam, the snap-through of a shallow arch, and a shallow reticulated dome.

Kamat, M. P.↗

A homotopy continuation method for general preliminary orbit determination and special application to the Tracking and Data Relay Satellite System

A recent mathematical technique for solving systems of equations is applied in a very general way to the orbit determination problem. The use of this technique, the homotopy continuation method, was motivated by the possible need to perform preliminary orbit determination in the Tracking and Data Relay Satellite System (TDRSS), using range and Doppler tracking alone. In the formulation studied here, a set of six tracking observations is continuously transformed from a set with known solutions to the given set with unknown solutions, and the corresponding orbit state vector is followed from the a priori orbit state to the solution orbit states. A modular numerical algorithm is developed to follow the state vector. The technique is formulated and then tested, using both real and simulated tracking, with positive results. Direct comparisons show that the basic method has a much larger radius of convergence than standard or simply modified Newton-Raphson methods. An extension of the basic method is formulated that is expected to produce a global method.

Smith, R. L.↗

Study of a homotopy continuation method for early orbit determination with the Tracking and Data Relay Satellite System (TDRSS)

A recent mathematical technique for solving systems of equations is applied in a very general way to the orbit determination problem. The study of this technique, the homotopy continuation method, was motivated by the possible need to perform early orbit determination with the Tracking and Data Relay Satellite System (TDRSS), using range and Doppler tracking alone. Basically, a set of six tracking observations is continuously transformed from a set with known solution to the given set of observations with unknown solutions, and the corresponding orbit state vector is followed from the a priori estimate to the solutions. A numerical algorithm for following the state vector is developed and described in detail. Numerical examples using both real and simulated TDRSS tracking are given. A prototype early orbit determination algorithm for possible use in TDRSS orbit operations was extensively tested, and the results are described. Preliminary studies of two extensions of the method are discussed: generalization to a least-squares formulation and generalization to an exhaustive global method.

Smith, R. L.↗

Preliminary Orbit Determination System (PODS) for Tracking and Data Relay Satellite System (TDRSS)-tracked target Spacecraft using the homotopy continuation method

The Preliminary Orbit Determination System (PODS) provides early orbit determination capability in the Trajectory Computation and Orbital Products System (TCOPS) for a Tracking and Data Relay Satellite System (TDRSS)-tracked spacecraft. PODS computes a set of orbit states from an a priori estimate and six tracking measurements, consisting of any combination of TDRSS range and Doppler tracking measurements. PODS uses the homotopy continuation method to solve a set of nonlinear equations, and it is particularly effective for the case when the a priori estimate is not well known. Since range and Doppler measurements produce multiple states in PODS, a screening technique selects the desired state. PODS is executed in the TCOPS environment and can directly access all operational data sets. At the completion of the preliminary orbit determination, the PODS-generated state, along with additional tracking measurements, can be directly input to the differential correction (DC) process to generate an improved state. To validate the computational and operational capabilities of PODS, tests were performed using simulated TDRSS tracking measurements for the Cosmic Background Explorer (COBE) satellite and using real TDRSS measurements for the Earth Radiation Budget Satellite (ERBS) and the Solar Mesosphere Explorer (SME) spacecraft. The effects of various measurement combinations, varying arc lengths, and levels of degradation of the a priori state vector on the PODS solutions were considered.

Kirschner, S. M.↗

A homotopy approach for combined control-structure optimization - Constructive analysis and numerical examples

This paper outlines the development of methods for the combined control-structure optimization of physical systems encountered in the technology of large space structures. The objectives of the approach taken in this paper is not to produce the 'best' optimized design, but rather to efficiently produce a family of design options so as to assist in early trade studies, typically before hard design constraints are imposed. The philosophy is that these are candidate designs to be passed on for further considerations, and their function is more to guide the development of the system design rather than to represent the ultimate product. A homotopy approach involving multi-objective functions is developed for this purpose. Analytical and numerical examples are also presented.

Scheid, R. E.↗

Reliable design of H-2 optimal reduced-order controllers via a homotopy algorithm

Due to control processor limitations, the design of reduced-order controllers is an active area of research. Suboptimal methods based on truncating the order of the corresponding linear-quadratic-Gaussian (LQG) compensator tend to fail if the requested controller dimension is sufficiently small and/or the requested controller authority is sufficiently high. Also, traditional parameter optimization approaches have only local convergence properties. This paper discusses a homotopy algorithm for optimal reduced-order control that has global convergence properties. The exposition is for discrete-time systems. The algorithm has been implemented in MATLAB and is applied to a benchmark problem.

Collins, Emmanuel G.↗

A homotopy algorithm for synthesizing robust controllers for flexible structures via the maximum entropy design equations

One well known deficiency of LQG compensators is that they do not guarantee any measure of robustness. This deficiency is especially highlighted when considering control design for complex systems such as flexible structures. There has thus been a need to generalize LQG theory to incorporate robustness constraints. Here we describe the maximum entropy approach to robust control design for flexible structures, a generalization of LQG theory, pioneered by Hyland, which has proved useful in practice. The design equations consist of a set of coupled Riccati and Lyapunov equations. A homotopy algorithm that is used to solve these design equations is presented.

Collins, Emmanuel G., Jr.↗

Development of homotopy algorithms for fixed-order mixed H2/H(infinity) controller synthesis

A major difficulty associated with H-infinity and mu-synthesis methods is the order of the resulting compensator. Whereas model and/or controller reduction techniques are sometimes applied, performance and robustness properties are not preserved. By directly constraining compensator order during the optimization process, these properties are better preserved, albeit at the expense of computational complexity. This paper presents a novel homotopy algorithm to synthesize fixed-order mixed H2/H-infinity compensators. Numerical results are presented for a four-disk flexible structure to evaluate the efficiency of the algorithm.

Whorton, M.↗

Homotopy Algorithm for Fixed Order Mixed H2/H(infinity) Design

Recent developments in the field of robust multivariable control have merged the theories of H-infinity and H-2 control. This mixed H-2/H-infinity compensator formulation allows design for nominal performance by H-2 norm minimization while guaranteeing robust stability to unstructured uncertainties by constraining the H-infinity norm. A key difficulty associated with mixed H-2/H-infinity compensation is compensator synthesis. A homotopy algorithm is presented for synthesis of fixed order mixed H-2/H-infinity compensators. Numerical results are presented for a four disk flexible structure to evaluate the efficiency of the algorithm.

Whorton, Mark↗

An algebraic homotopy method for generating quasi-three-dimensional grids for high-speed configurations

A fast and versatile procedure for algebraically generating boundary conforming computational grids for use with finite-volume Euler flow solvers is presented. A semi-analytic homotopic procedure is used to generate the grids. Grids generated in two-dimensional planes are stacked to produce quasi-three-dimensional grid systems. The body surface and outer boundary are described in terms of surface parameters. An interpolation scheme is used to blend between the body surface and the outer boundary in order to determine the field points. The method, albeit developed for analytically generated body geometries is equally applicable to other classes of geometries. The method can be used for both internal and external flow configurations, the only constraint being that the body geometries be specified in two-dimensional cross-sections stationed along the longitudinal axis of the configuration. Techniques for controlling various grid parameters, e.g., clustering and orthogonality are described. Techniques for treating problems arising in algebraic grid generation for geometries with sharp corners are addressed. A set of representative grid systems generated by this method is included. Results of flow computations using these grids are presented for validation of the effectiveness of the method.

Moitra, Anutosh↗

Two and three dimensional grid generation by an algebraic homotopy procedure

An algebraic method for generating two- and three-dimensional grid systems for aerospace vehicles is presented. The method is based on algebraic procedures derived from homotopic relations for blending between inner and outer boundaries of any given configuration. Stable properties of homotopic maps have been exploited to provide near-orthogonality and specified constant spacing at the inner boundary. The method has been successfully applied to analytically generated blended wing-body configurations as well as discretely defined geometries such as the High-Speed Civil Transport Aircraft. Grid examples representative of the capabilities of the method are presented.

Moitra, Anutosh↗