Application of the Conjugate Gradient Method to a Problem on Minimum Time Orbit Transfer

This correspondence considers the problem of optimally controlling the thrust steering angle of an ion-propelled spaceship so as to effect a minimum time coplanar orbit transfer from the mean orbital distance of Earth to mean Martian and Venusian orbital distances. This problem has been modelled as a free terminal time-optimal control problem with unbounded control variable and with state variable equality constraints at the final time. The problem has been solved by the penalty function approach, using the conjugate gradient algorithm. In general, the optimal solution shows a significant departure from earlier work. In particular, the optimal control in the case of Earth-Mars orbit transfer, during the initial phase of the spaceship's flight, is found to be negative, resulting in the motion of the spaceship within the Earth's orbit for a significant fraction of the total optimized orbit transfer time. Such a feature exhibited by the optimal solution has not been reported at all by earlier investigators of this problem.

An FETI-preconditioned conjuerate gradient method for large-scale stochastic finite element problems

In the spectral stochastic finite element method for analyzing an uncertain system. the uncertainty is represented by a set of random variables, and a quantity of Interest such as the system response is considered as a function of these random variables Consequently, the underlying Galerkin projection yields a block system of deterministic equations where the blocks are sparse but coupled. The solution of this algebraic system of equations becomes rapidly challenging when the size of the physical system and/or the level of uncertainty is increased This paper addresses this challenge by presenting a preconditioned conjugate gradient method for such block systems where the preconditioning step is based on the dual-primal finite element tearing and interconnecting method equipped with a Krylov subspace reusage technique for accelerating the iterative solution of systems with multiple and repeated right-hand sides. Preliminary performance results on a Linux Cluster suggest that the proposed Solution method is numerically scalable and demonstrate its potential for making the uncertainty quantification Of realistic systems tractable.

Model Predictive Static Programming: A Computationally Efficient Technique For Suboptimal Control Design

Combining the philosophies of nonlinear model predictive control and approximate dynamic programming, a new suboptimal control design technique is presented in this paper, named as model predictive static programming (MPSP), which is applicable for finite-horizon nonlinear problems with terminal constraints. This technique is computationally efficient, and hence, can possibly be implemented online. The effectiveness of the proposed method is demonstrated by designing an ascent phase guidance scheme for a ballistic missile propelled by solid motors. A comparison study with a conventional gradient method shows that the MPSP solution is quite close to the optimal solution.

Reliability Optimization using SLUMT

This paper is concerned with the reliability optimization of a spatially redundant system, subject to various constraints, by using nonlinear programming. The constrained optimization problem is converted into a sequence of unconstrained optimization problems by using a penalty function. The new problem is then solved by the conjugate gradient method. The advantages of this method are highlighted.

A modified least squares algorithm to treat associations in liquid alloys

The associated model for binary systems has been modified to include volume effects and excess entropy arising from preferential interactions between the associate and the free atoms or between the free atoms. Equations for thermodynamic mixing functions have been derived. An optimization procedure using a modified conjugate gradient method has been used to evaluate the enthalpy and entropy interaction energies, the free energy of dissociation of the complex, its temperature dependance and the size of the associate. An expression for the concentration—concentration structure factor [Scc (0)] has been deduced from the modified associated solution model. The analysis has been applied to the thermodynamic mixing functions of liquid Ga-Te alloys at 1120 K, believed to contain Ga2Te3 associates. It is observed that the modified associated solution model incorporating volume effects and terms for the temperature dependance of interaction energies, describes the thermodynamic properties of Ga-Te system satisfactorily.

Universal Stability and Temperature Dependent Phase Transformation in Group VIIIB-IB Transition Metal FCC Nanowires

Atomistic simulation of Ag, Al, Au, Cu, Ni, Pd, and Pt FCC metallic nanowires show a universal FCC -> HCP phase transformation below a critical cross-sectional size, which is reported for the first time in this paper. The newly observed HCP structure is also confirmed from previous experimental results. Above the critical cross-sectional size, initial < 100 >/{100} FCC metallic nanowires are found to be metastable. External thermal heating shows the transformation of metastable < 100 >/{100} FCC nanowires into < 110 >/{111} stable configuration. Size dependent metastability/instability is also correlated with initial residual stresses of the nanowire by use of molecular static simulation using the conjugant gradient method at a temperature of 0 K. It is found that a smaller cross-sectional dimension of an initial FCC nanowire shows instability due to higher initial residual stresses, and the nanowire is transformed into the novel HCP structure. The initial residual stress shows reduction with an increase in the cross-sectional size of the nanowires. A size dependent critical temperature is also reported for metastable FCC nanowires using molecular dynamic, to capture the < 110 >/{111} to < 100 >/{100} shape memory and pseudoelasticity.

Ascent Phase Trajectory Optimization of a Generic Launch Vehicle

Trajectory optimization of a generic launch vehicle is considered in this paper. The trajectory from launch point to terminal injection point is divided in to two segments. The first segment deals with launcher clearance and vertical raise of the vehicle. During this phase, a nonlinear feedback guidance loop is incorporated to assure vertical raise in presence of thrust misalignment, centre of gravity offset, wind disturbance etc. and possibly to clear obstacles as well. The second segment deals with the trajectory optimization, where the objective is to ensure desired terminal conditions as well as minimum control effort and minimum structural loading in the high dynamic pressure region. The usefulness of this dynamic optimization problem formulation is demonstrated by solving it using the classical Gradient method. Numerical results for both the segments are presented, which clearly brings out the potential advantages of the proposed approach.

Optimal control for the rolling pullout maneuver of a modern fighter aircraft

Optimal control laws are obtained for the elevator and the ailerons for a modern fighter aircraft in a rolling pullout maneuver. The problem is solved for three flight conditions using the conjugate gradient method.

Effect of capillarity and heterogeneity in the numerical modelling of multiphase flow of fluids in unsaturated porous medium

The multiphase flow of fluids in the unsaturated porous medium is considered as a three phase flow of water, NAPL, and air simultaneously in the porous medium. The adaptive solution fully implicit modified sequential method is used for the numerical modelling. The effect of capillarity and heterogeneity effect at the interface between the media is studied and it is observed that the interface criteria has to be taken into account for the correct prediction of NAPL migration especially in heterogeneous media. The modified Newton Raphson method is used for the linearization and Hestines and Steifel Conjugate Gradient method is used as the solver.

Efficient gradient-free simplex method for estimation of optical properties in image-guided diffuse optical tomography

Typical image-guided diffuse optical tomographic image reconstruction procedures involve reduction of the number of optical parameters to be reconstructed equal to the number of distinct regions identified in the structural information provided by the traditional imaging modality. This makes the image reconstruction problem less ill-posed compared to traditional underdetermined cases. Still, the methods that are deployed in this case are same as those used for traditional diffuse optical image reconstruction, which involves a regularization term as well as computation of the Jacobian. A gradient-free Nelder-Mead simplex method is proposed here to perform the image reconstruction procedure and is shown to provide solutions that closely match ones obtained using established methods, even in highly noisy data. The proposed method also has the distinct advantage of being more efficient owing to being regularization free, involving only repeated forward calculations. (C) 2013 Society of Photo-Optical Instrumentation Engineers (SPIE)

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Similar solutions for the incompressible laminar boundary layer with pressure gradient in micropolar

This paper presents the similarity solution for the steady incompressible laminar boundary layer flow of a micropolar fluid past an infinite wedge. The governing equations have been solved numerically using fourth orderRunge-Kutta-Gill method. The results indicate the extent to which the velocity and microrotation profiles, and the surface shear stress are influenced by coupling, microrotation, and pressure gradient parameters. The important role played by the standard length of the micropolar fluid in determining the structure of the boundary layer has also been discussed.

Determination of skin friction in strong pressure-gradient equilibrium and near-equilibrium turbulent boundary layers

The conventional Clauser-chart method for determination of local skin friction in zero or weak pressure-gradient turbulent boundary layer flows fails entirely in strong pressure-gradient situations. This failure occurs due to the large departure of the mean velocity profile from the universal logarithmic law upon which the conventional Clauser-chart method is based. It is possible to extend this method,even for strong pressure-gradient situations involving equilibrium or near-equilibrium turbulent boundary layers by making use of the so-called non-universal logarithmic laws. These non-universal log laws depend on the local strength of the pressure gradient and may be regarded as perturbations of the universal log law.The present paper shows that the modified Clauser-chart method, so developed, yields quit satisfactory results in terms of estimation of local skin friction in strongly accelerated or retarded equilibrium and near-equilibrium turbulent boundary layers that are not very close to relaminarization or separation.

Strength design of composite beam using gradient and particle swarm optimization

This work addresses the optimum design of a composite box-beam structure subject to strength constraints. Such box-beams are used as the main load carrying members of helicopter rotor blades. A computationally efficient analytical model for box-beam is used. Optimal ply orientation angles are sought which maximize the failure margins with respect to the applied loading. The Tsai-Wu-Hahn failure criterion is used to calculate the reserve factor for each wall and ply and the minimum reserve factor is maximized. Ply angles are used as design variables and various cases of initial starting design and loadings are investigated. Both gradient-based and particle swarm optimization (PSO) methods are used. It is found that the optimization approach leads to the design of a box-beam with greatly improved reserve factors which can be useful for helicopter rotor structures. While the PSO yields globally best designs, the gradient-based method can also be used with appropriate starting designs to obtain useful designs efficiently. (C) 2006 Elsevier Ltd. All rights reserved.

A simplified method for the purification of riboflavin-binding protein from hen's egg yolk

A simple and efficient procedure for the purification of the riboflavin-binding protein from hen's egg yolk is described. This method involves the removal by exclusion of lipoproteins and subsequent fractionation of soluble yolk proteins held on a DEAE-cellulose column by a salt gradient which is followed by purification by gel filtration on Sephadex G-100. The protein thus isolated is homogeneous by various physicoehemical, immunological, and functional criteria.