A successive approximations method for a cellular manufacturing problem

The problem of interest is to partition a collection of machines into production cells so that a given set of part-manufacturing requirements may be carried out optimally. In the present case transitions of parts between different cells is the only measure of machine partition goodness. The present formulation and approximate solution of this optimization problem is best described as one of successive approximations or as a one-at-a-time method. An initial cellular structure is taken and an easy part assignment optimization routine executed. With the part assignment fixed, a heuristic is employed to find an improved cell structure. These bipartite iterations continue until a convergence criterion is satisfied. Several small computer examples are provided and the straightforward requirements for large problem adaptation.     

A comparison between the variational iteration method and the successive approximations method

In this paper we investigate and compare the variational iteration method and the successive approximations method for solving a class of nonlinear differential equations. We prove that these two methods are equivalent for solving these types of equations.     

A method of successive approximations for solving the quasi-variational Signorini inequality

We solve the semicoercive quasi-variational Signorini inequality that corresponds to the contact problem with friction known in the elasticity theory by a method of successive approximations. For solving auxiliary problems with a given friction occurring on each outer step of the iterative process we use the Uzawa method based on iterative proximal regularization of a modified Lagrangian functional. We study the stabilization of the sequence of auxiliary finite-element solutions obtained on outer steps of the method of successive approximations and present results of numerical calculations.     

The successive approximations method for the airfoil equation

The successive approximations (or Neumann iterations) method for the solution of Fredholm integral equations of the second kind is applied here for the first time, after an appropriate modification, to a Cauchy-type singular integral equation of the first kind, the airfoil equation. The convergence of the method is investigated and three simple applications are made. The numerical implementation of the method (by using Gaussian quadrature rules) is also described in detail and numerical results verifying the accuracy and convergence of the method are displayed.     

A method of successive approximations for nonlinear viscoelasticity based on the nonlinear correspondence principle and the method of approximations

Mechanics of Composite Materials -     

Using successive approximations for improving the convergence of GMRES method

In this paper, our attention is concentrated on the GMRES method for the solution of the system (I–T)x=b of linear algebraic equations with a nonsymmetric matrix. We perform m pre-iterations y _l+1 =T _yl +b before starting GMRES and put y _m for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the mth powers of eigenvalues of the matrix T Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and numerical experiments verify that it is advisable to perform pre-iterations before starting GMRES as they require fewer arithmetic operations than GMRES. Towards the end of the paper we present a numerical experiment for a system obtained by the finite difference approximation of convection-diffusion equations.     

Global convergence of the method of successive approximations on S1

The class of iterating functions of C(S¹, S¹) for which the method of successive approximations converges for any starting point is characterized; such characterization is given by (i) the existence of a fixed point; (ii) the non-existence of periodic points of an even period.     

Global convergence of the method of successive approximations on S1

The class of iterating functions of C(S¹, S¹) for which the method of successive approximations converges for any starting point is characterized; such characterization is given by (i) the existence of a fixed point; (ii) the non-existence of periodic points of an even period.     

Once again on the Samoilenko numerical-analytic method of successive periodic approximations

A new numerical-analytic algorithm for the investigation of periodic solutions of nonlinear periodic systems of differential equations dx/dt = A(t) x+ ƒ(t, x) in the critical case is developed. The problem of the existence of solutions and their approximate construction is studied. Estimates for the convergence of successive periodic approximations are obtained. __________ Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 4, pp. 472–488, April, 2006.     

Solving the quasi-variational Signorini inequality by the method of successive approximations

The method of successive approximations is examined as a tool for solving the semicoercive quasi-variational Signorini inequality. The auxiliary problems with given friction arising at each step of this method are solved using the Uzawa method with an iterative proximal regularization of the modified Lagrangian functional.     

The character of operational successive approximations

The method of successive approximations in the field of Mikusiński operators is applied for the construction of the approximate solution of a class of nonlinear differential equations. The character of these operational approximations is analyzed, and sufficient conditions for the type I convergence to the exact solution are given. The error of approximation is estimated.     

Some remarks concerning the convergence of the numerical-analytic method of successive approximations

We establish new improved estimates necessary for the justification of the numerical-analytic method for the investigation of the existence and construction of approximate solutions of nonlinear boundary-value problems for ordinary differential equations.     

Solutions to the random heat equation by the method of successive approximations

An iterative scheme for solving the random heat equation is proposed. Convergence of the method is established. Properties of the solution as well as error estimates are obtained. Indications as to possible application to nonlinear, inhomogeneous, time-dependent, random diffusion problems are given. A specific example of application to random diffusion in the unit interval is treated both analytically and numerically.     

Symbolic computing algorithm for the method of successive approximations for near-parabolic orbits

In this paper, an accurate algorithm for the method of successive approximations for near-parabolic orbits is established symbolically. Numerical applications are given for motion predictions at fifteen epochs between the years 66 to 1835 for Halley’s comet, and at fifteen epochs between the years 1417 to 1782 for Encke’s comet. Comparisons with the standard Gauss method [4] show that the present algorithm is very accurate and efficient for motion predications of near-parabolic orbits.     

Most of the successive approximations do converge

Let T be a locally compact Hausdorff space and E a Banach space. Let K(T, E) be the set of all continuous E-valued functions on T with compact support. We consider the representation of the second dual of K(T, E) when K(T, E) is normed with the usual sup norm. We demonstrate that an operator in the second dual of K(T, E) is, in a certain sense, approximable by an integral when computed over a certain subset of the dual of K(T, E).     

Revisions of constraint approximations in the successive QP method for nonlinear programming problems

In the last few years the successive quadratic programming methods proposed by Han and Powell have been widely recognized as excellent means for solving nonlinea programming problems. However, there remain some questions about their linear approximations to the constraints from both theoretical and empirical points of view. In this paper, we propose two revisions of the linear approximation to the constraints and show that the directions generated by the revisions are also descent directions of exact penalty functions of nonlinear programming problems. The new technique can cope better with bad starting points than the usual one.