求解方程的一类迭代公式

Using the forms of Newton iterative function, the iterative function of Newton's method to handle the problem of multiple roots and the Halley iterative function, we give a class of iterative formulae for solving equations in one variable in this paper and show that their convergence order is at least quadratic. At last we employ our methods to solve some non-linear equations and compare them with Newton's method and Halley's method. Numerical results show that our iteration schemes are convergent if we choose two suitable parametric functions λ(x) and μ(x). Therefore, our iteration schemes are feasible and effective.     

MODIFIED NEWTON＇S ALGORITHM FOR COMPUTING THE GROUP INVERSES OF SINGULAR TOEPLITZ MATRICES

Newton＇s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton＇s iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.     

A MONOTONE COMPACT IMPLICIT SCHEME FOR NONLINEAR REACTION-DIFFUSION EQUATIONS

A monotone compact implicit finite difference scheme with fourth-order accuracy in space and second-order in time is proposed for solving nonlinear reaction-diffusion equations. An accelerated monotone iterative method for the resulting discrete problem is presented. The sequence of iteration converges monotonically to the unique solution of the discrete problem, and the convergence rate is either quadratic or nearly quadratic, depending on the property of the nonlinear reaction. The numerical results illustrate the high accuracy of the proposed scheme and the rapid convergence rate of.the iteration.     

CONVERGENCE OF INNER ITERATIONS SCHEME OF THEDISCRETE ORDINATE METHOD IN SPHERICAL GEOMETRY

In transport theory, the convergence of the inner iteration scheme to the spherical neutron transport equation has been an open problem. In this paper, the inner iteration for a positive step function scheme is considered and its convergence in spherical geometry is proved.     

ASYMPTOTIC SOLUTION TO MODEL FOR A CLASS OF VIRUS TRANSMISSION

In this paper, a class of HIV virus transmission is considered. The transmissive dynamic model for the HIV virus is described. Using the functional-variational iteration theory, the rule for human group in the epidemic transmissive area is studied.     

Convergence of BP Algorithm for Training MLP with Linear Output

The capability of multilayer perceptrons(MLPs)for approximating continuous functions with arbitrary accuracy has been demonstrated in the past decades.Back propagation(BP)algorithm is the most popular learning algorithm for training of MLPs.In this paper,a simple iteration formula is used to select the leaming rate for each cycle of training procedure,and a convergence result is presented for the BP algo- rithm for training MLP with a hidden layer and a linear output unit.The monotonicity of the error function is also guaranteed during the training iteration.     

Maximization of the sum of the trace ratio on the Stiefel manifold,II: Computation

Abstract The necessary condition established in Part I of this paper for the global maximizers of the maximization problem max V tr(VTAV)/tr(VTBV)+tr(VTCV)over the Stiefel manifold{V∈Rm×l |VTV=Il}(lm),naturally leads to a self-consistent-field(SCF)iteration for computing a maximizer.In this part,we analyze the global and local convergence of the SCF iteration,and show that the necessary condition for the global maximizers is fulfilled at any convergent point of the sequences of approximations generated by the SCF iteration.This is one of the advantages of the SCF iteration over optimization-based methods.Preliminary numerical tests are reported and show that the SCF iteration is very efficient by comparing with some manifold-based optimization methods.     

On relationship between convergence ball of euler iteration in banach spaces and its dynamical behavior on Riemann spheres

The relationship between the convergence ball of the Euler iteration in Banach Spaces and its exclusive fixed points on Riemann spheres is investigated. By using an exclusive fixed point of the Euler iteration, the convergence ball is determined accurately for a class of operators whose derivatives satisfy some generalized Lipschitz condition on Banach spaces.     

A POLYNOMIAL PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING

This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step, where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has O(n~(1/2)L) iteration complexity which is the best result for convex quadratic programming so far.     

非线性优化的非单调信赖域算法及全局收敛性

Abstract. A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust regionmethod.     

On Extraneous Fixed-Points of the Basic Family of Iteration Functions

Let K denote either the reals or the complex numbers. Consider the root-finding problem for an analytic function f from K into itself via an iteration function F. An extraneous fixed-point of F is a fixed-point different than a root of f. We prove that all extraneous fixed-points of any member of an infinite family of iteration functions, called the Basic Family in Kalantari et al. (1997). are repulsive. This generalizes a result of Vrscay and Gilbert (1988) who prove the property only for the second member of the family which coincides with the well-known Halley's method. Our result implies that a convergent orbit corresponding to any specific member of the Basic Family will necessarily converge to a zero of f. The Basic Family is a fundamental family with several different representations. It has been rediscovered by several authors using various techniques. The earliest derivation of this family is from an analysis of Schröder (1870). But in fact the Basic Family and its multipoint versions are all derivable from a determinantal generalization of Taylor's theorem (Kalantari (1997)).     

On the global convergence of Chebyshev's iterative method

In [A. Melman, Geometry and convergence of Euler's and Halley's methods, SIAM Rev. 39(4) (1997) 728–735] the geometry and global convergence of Euler's and Halley's methods was studied. Now we complete Melman's paper by considering other classical third-order method: Chebyshev's method. By using the geometric interpretation of this method a global convergence theorem is performed. A comparison of the different hypothesis of convergence is also presented.     

Root determination by use of Padé approximants

In this paper we describe a new technique for generating iteration formulas — of arbitrary order — for determining a zero (assumed simple) of a functionf, assumed analytic in a region containing the zero. The 1/p Padé Approximant (p0) to the functiong(t)f(z) is formed wherez=w+t, using the Taylor series forf at the pointw, an approxination to the zero off. The value oft for which the 1/p Padé Approximant vanishes provides the basis of iteration formulas of orderp+2.Some known iteration formulas, e.g., Newton-Raphson's, Halley's and Kiss's of order of convergence two, three and four, are directly obtained by settingp=0,1 and 2, respectively.     

On the Order of Convergence of a Determinantal Family of Root-Finding Methods

Recently, we have shown that for each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, defined as the ratio of two determinants that depend on the first m - k derivatives of the given function. For each k the corresponding matrices are upper Hessenberg matrices. Additionally, for k = 1 these matrices are Toeplitz matrices. The goal of this paper is to analyze the order of convergence of this fundamental family. Newton's method, Halley's method, and their multi-point versions are members of this family. In this paper we also derive these special cases. We prove that for fixed m, as k increases, the order of convergence decreases from m to the positive root of the characteristic polynomial of generalized Fibonacci numbers of order m. For fixed k, the order of convergence increases in m. The asymptotic error constant is also derived in terms of special determinants.     

A note on Halley's method

Summary We introduce the degree of logarithmic convexity which provides a measure of the convexity of a function at each point. Making use of this concept we obtain a new theorem of global convergence for Halley's method.     

The polyadic structure of factorable function tensors with applications to high-order minimization techniques

Factorable functions are shown to have arrays ofNth-order derivatives (tensors) which are naturally computed as sums of generalized outer product matrices (polyads). The computational implications of this for high-order minimization techniques (such as Halley's method of tangent hyperbolas) are investigated. A direct derivation of these high-order techniques is also given.This research was sponsored in part by the Office of Naval Research under Contract No. N00014-82-K.     

High order iterative methods for approximating square roots

Given any natural numberm 2, we describe an iteration functiong _m (x) having the property that for any initial iterate \sqrt \alpha $$ " align="middle" border="0"> , the sequence of fixed-point iterationx _k +1 =g _m (x _k ) converges monotonically to having anm-th order rate of convergence. Form = 2 and 3,g _m (x) coincides with Newton's and Halley's iteration functions, respectively, as applied top(x) =x ² – .This research is supported in part by the National Science Foundation under Grant No. CCR-9208371.     

Frozen Landweber Iteration for Nonlinear Ill-Posed Problems

In this paper we propose a modification of the Landweber iteration termed frozen Landweberiteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numericalperformance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared withthat of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based onthe same convergence accuracy.