EXTENSION AND APPLICATION OF NEWTON'S METHOD IN NONLINEAR OSCILLATION THEORY

In this paper we suggest and prove that Newton's method may calculate the asymptotic analytic periodic solution of strong and weak nonlinear nonautonomous systems, so that a new analytic method is offered for studying strong and weak nonlinear oscillation systems. On the strength of the need of our method, we discuss the existence and calculation of the periodic solution of the second order nonhomogeneous linear periodic system. Besides, we investigate the application of Newton's method to quasi-linear systems. The periodic solution of Duffing equation is calculated by means of our method.

NEWTON'S THEOREM WITH RESPECT TO A LOT OFCENTERS AND THEIR APPLICATIONS

In this paper we shall extend the paper [1] to a separate Taylor's Theorem with respect to a lot of centers, namely Newton's Theorem Of a lot of centers. From it we obtain the analogous results in the paper [2]. namely an interpolation formula of the difference of higher order. Finally we give their applications.

A SIGNIFICANT IMPROVEMENT ON NEWTON’S ITERATIVE METHOD

For solving nonlinear and transcendental equation f(x)=0 , a singnificant improvement on Newton's method is proposed in this paper. New “Newton Like” methods are founded on the basis of Liapunov's methods of dynamic system. These new methods preserve quadratic convergence and computational efficiency of Newton's method, and remove the monotoneity condition imposed on f(x):f′(x)≠0 .

D'ALEMBERT PRINCIPLE IN THE VELOCITY SPACE

According to Newton's dynamical equation of the system of particles, the force is considered to be the function of the coordinate r, velocity and time t, and the various formulae for D'Alembert principle of the velocity space in both the holonomic and nonholonomic systems are deduced by introducing the concept of kinetic energy in the velocity space (i.e. the accelerated energy).

Least Square Finite Element Method for Viscous Splitting of Unsteady Incompressible Navier–Stokes Equations

In order to solve unsteady incompressible Navier–Stokes(N–S) equations, a new stabilized finite element method,called the viscous-splitting least square FEM, is proposed. In the model, the N–S equations are split into diffusive and convective parts in each time step. The diffusive part is discretized by the backward difference method in time and discretized by the standard Galerkin method in space. The convective part is a first-order nonlinear equation.After the linearization of the nonlinear part by Newton’s method, the convective part is also discretized by the backward difference method in time and discretized by least square scheme in space. C0-type element can be used for interpolation of the velocity and pressure in the present model. Driven cavity flow and flow past a circular cylinder are conducted to validate the present model. Numerical results agree with previous numerical results, and the model has high accuracy and can be used to simulate problems with complex geometry.

Self-accelerating two-step Steffensen-type methods with memory and their applications on the solution of nonlinear BVPs

In this paper, seven self-accelerating iterative methods with memory are derived from an optimal two-step Steffensen-type method without memory for solving nonlinear equations, their orders of convergence are proved to be increased,?numerical examples are demonstrat-ed demonstrated to verify the theoretical results, and applications for solving systems of nonlinear equations and BVPs of nonlinear ODEs are illustrated.

THE AUTO-ADJUSTABLE DAMPING METHOD FORSOLVING NONLINEAR EQUATIONS

The general approach for solving the nonlinear equations is linearizing the equations and forming various iterative procedures, then executing the numerical simulation. For the strongly nonlinear problems, the solution obtained in the iterative process is always difficult, even divergent due to the numerical instability. It can not fulfill the engineering requirements. Newton's method and its variants can not settle this problem. As a result, the application of numerical simulation for the strongly nonlinear problems is limited. An auto-adjustable damping method has been presented in this paper. This is a further improvement of Newton's method with damping factor. A set of vector of damping factor is introduced. This set of vector can be adjusted continuously during the iterative process in accordance with the judgement and adjustment. An effective convergence coefficient and quichening coefficient are employed to relax the restricted requirements for the initial values and to shorten the iterative process. Then, the numerical stability will be ensured for the solution of complicated strongly nonlinear equations. Using this method, some complicated strongly nonlinear heat transfer problems in airplanes and aeroengines have been numerically simulated successfully. It can be used for the numerical simulation of strongly nonlinear problems in engineering such as nonlinear hydrodynamics and aerodynamics, heat transfer and structural dynamic response etc.

Convergence of Newton's Method and Uniqueness of the Solution of Equations in Banach SpacesⅡ

Some results on convergence of Newton's method in Banach spaces are established under the assumption that the derivative of the operators satisfies the radius or center Lipschitz condition with a weak L average.

APPLICATION OF NEWTON'S AND CHEBYSHEV'S METHODS TO PARALLEL FACTORJZATION OF POLYNOMIALS

In this paper it is shown m two different ways that one of the family of parallel iterations to determine all real quadratic factors of polynomials presented in [12] is Newton's method applied to the special equation (1.7) below. Furthermore, we apply Chebyshev's method to (1.7) and obtain a new parallel iteration for factorization of polynomials. Finally, some properties of the parallel iterations are discussed.

A theoretical analysis on efficiency of some Newton-PCG methods

In this paper, we study the efficiency issue of inexact Newton-type methods for smooth unconstrained optimization problems under standard assumptions from theoretical point of view by discussing a concrete Newton-PCG algorithm. In order to compare the algorithm with Newton's method, a ratio between the measures of their approximate efficiencies is investigated. Under mild conditions, it is shown that first, this ratio is larger than 1, which implies that the Newton-PCG algorithm is more efficient than Newton's method, and second, this ratio increases when the dimension n of the problem increases and tends to infinity at least at a rate In n/In 2 when n→∞, which implies that in theory the Newton-PCG algorithm is much more efficient for middle- and large-scale problems. These theoretical results are also supported by our preliminary numerical experiments.

On solving equations of algebraic sum of equal powers

It is well known that a system of equations of sum of equal powers can be converted to an algebraic equation of higher degree via Newton's identities. This is the Viete-Newton theorem. This work reports the generalizations of the Viete-Newton theorem to a system of equations of algebraic sum of equal powers. By exploiting some facts from algebra and combinatorics,it is shown that a system of equations of algebraic sum of equal powers can be converted in a closed form to two algebraic equations, whose degree sum equals the number of unknowns of the system of equations of algebraic sum of equal powers.