The Continuous Analogy of Newton’s Method for Solving a System of Linear Algebraic Equations

We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems.

A Discrete Newton's Method for Gain Based Predistorter

Gain based predistorter (PD) is a highly effective and simple digital baseband predistorter which compensates for the nonlinear distortion of PAs. Lookup table (LUT) is the core of the gain based PD. This paper presents a discrete Newton’s method based adaptive technique to modify LUT. We simplify and convert the hardship of adaptive updating LUT to the roots finding problem for a system of two element real equations on athematics. And we deduce discrete Newton’s method based adaptive iterative formula used for updating LUT. The iterative formula of the proposed method is in real number field, but secant method previously published is in complex number field. So the proposed method reduces the number of real multiplications and is implemented with ease by hardware. Furthermore, computer simulation results verify gain based PD using discrete Newton’s method could rectify nonlinear distortion and improve system performance. Also, the simulation results reveal the proposed method reaches to the stable statement in fewer iteration times and less runtime than secant method.

ON AMODIFIED NEWTON'S METHOD AND CONVERGENCE

In this paper we discuss the convergence of a modified Newton’s method presented by A. Ostrowski [1] and J.F. Traub [2], which has quadratic convergence order but reduces one evaluation of the derivative at every two steps compared with Newton’s method. A convergence theorem is established by using a weak condition a≤3-2(21/2) and a sharp error estimate is given about the iterative sequence.

Kantorovich’s theorem for Newton’s method on Lie groups

The convergence criterion of Newton’s method to find the zeros of a map f from a Lie group to its corresponding Lie algebra is established under the assumption that f satisfies the classical Lipschitz condition, and that the radius of convergence ball is also obtained. Furthermore, the radii of the uniqueness balls of the zeros of f are estimated. Owren and Welfert (2000) stated that if the initial point is close sufficiently to a zero of f, then Newton’s method on Lie group converges to the zero; while this paper provides a Kantorovich’s criterion for the convergence of Newton’s method, not requiring the existence of a zero as a priori.

Analysis of one-dimensional consolidation of fractional viscoelastic saturated soils under continuous drainage boundary conditions

This paper presents the one-dimensional(1D)viscoelastic consolidation system of saturated clayey soil under continuous drainage boundaries.The fractional-derivative Merchant(FDM)model has been introduced into the consolidation system to simulate the viscoelasticity.Swartzendruber’s flow law is also introduced to describe the non-Darcian flow characteristics simultaneously.The generalized numerical solution of the 1D consolidation under continuous boundaries is given by the finite difference scheme.Furthermore,to illustrate the effectiveness of the numerical method,two simplified cases are compared against the current analytical and numerical results.Finally,the effects of boundary parameters and model parameters on the viscoelastic consolidation were illustrated and discussed.The results indicated that the boundary parameters have a significant influence on consolidation.The larger the values of boundary parameters,the faster the whole dissipation of the excess pore-water pressure and soils’settlement rate.Fractional-order and viscosity parameter have little effect on consolidation,which are primarily significant in the middle and late consolidation phases.With the increase of the modulus ratio,the whole consolidation process becomes faster.Moreover,considering Swartzendruber’s flow delays the consolidation rate of the soil layer.

Implementation of LDA+ Gutzwiller with Newton's method

In order to calculate the electronic structure of correlated materials, we propose implementation of the LDA＋Gutzwiller method with Newton＇s method. The self-consistence process, efficiency and convergence of calculation are improved dramatically by using Newton＇s method with golden section search and other improvement approaches.We compare the calculated results by applying the previous linear mix method and Newton＇s method. We have applied our code to study the electronic structure of several typical strong correlated materials, including SrVO3, LaCoO3, and La2O3Fe2Se2. Our results fit quite well with the previous studies.

On Relations between the General Recurrence Formula of the Extension of Murase-Newton’s Method (the Extension of Tsuchikura*-Horiguchi’s Method) and Horner’s Method

In 1673, Yoshimasu Murase made a cubic equation to obtain the thickness of a hearth. He introduced two kinds of recurrence formulas of square and the deformation (Ref.[1]). We find that the three formulas lead to the extension of Newton-Raphson’s method and Horner’s method at the same time. This shows originality of Japanese native mathematics (Wasan) in the Edo era (1600- 1867). Suzuki (Ref.[2]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 1 introduces Murase’s three solutions of the cubic equation of the hearth. Section 2 explains the Horner’s method. We give the generalization of three formulas and the relation between these formulas and Horner’s method. Section 3 gives definitions of Murase-Newton’s method (Tsuchikura-Horiguchi’s method), general recurrence formula of Murase-Newton’s method (Tsuchikura-Horiguchi’s method), and general recurrence formula of the extension of Murase-Newton’s method (the extension of Tsuchikura-Horiguchi’s method) concerning n-degree polynomial equation. Section 4 is contents of the title of this paper.

A Class of Third-order Convergence Variants of Newton＇s Method

A class of third-order convergence methods of solving roots for non-linear equation,which are variant Newton＇s method, are given. Their convergence properties are proved. They are at least third order convergence near simple root and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton＇s methods. The results show that the proposed methods have some more advantages than others. They enrich the methods to find the roots of non-linear equations and they are important in both theory and application.

INEXACT DAMPED NEWTON METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS

In this paper, we propose an inexact damped Newtonmethod for solving nonlinear complementarity problems based on the equivalent B differentiable equations.Global convergence and locally quadratic convergence are obtained,and numerical results are given.

Solving Load Flow Problems of Power System by Explicit Pseudo-Transient Continuation (E-ψtc) Method

This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for example, the 11-bus system is not an ill-conditioned system. In addition, a new approach to solve Load Flow Problems, E-ψtc, is introduced. It is an explicit method;solving linear equations is not needed. It can handle very tough and very large systems. The advantage of this method has been fully proved by two examples. The authors give this new method a detailed description of how to use it to solve Load Flow Problems and successfully apply it to the 43-bus and the 11-bus systems. The authors also propose a strategy to test the reliability, and by solving gradient equations, this new method can answer if the solution exists or not.

Elusive Zeros under Newton’s Method

Though well-known for its simplicity and efficiency, Newton’s method applied to a complex polynomial can fail quite miserably, even on a relatively large open set of initial guesses. In this work, we present some analytic and numerical results for Newton’s method applied to the complex quartic family where is a parameter. The symmetric location of the roots of?allows for some easy reductions. In particular, when λ is either real or purely imaginary, standard techniques from real dynamical systems theory can be employed for rigorous analysis. Classifying those λ-values where Newton’s method fails on an open set leads to complex and aesthetically intriguing geometry in the λ-parameter plane, complete with fractal-like figures such as Mandelbrot-like sets, tricorns and swallows.

New Variants of Newton’s Method for Nonlinear Unconstrained Optimization Problems

In this paper, we propose new variants of Newton’s method based on quadrature formula and power mean for solving nonlinear unconstrained optimization problems. It is proved that the order of convergence of the proposed family is three. Numerical comparisons are made to show the performance of the presented methods. Furthermore, numerical experiments demonstrate that the logarithmic mean Newton’s method outperform the classical Newton’s and other variants of Newton’s method. MSC: 65H05.

The Formulas to Compare the Convergences of Newton’s Method and the Extended Newton’s Method (Tsuchikura-Horiguchi Method) and the Numerical Calculations

This paper gives the extension of Newton’s method, and a variety of formulas to compare the convergences for the extension of Newton’s method (Section 4). Section 5 gives the numerical calculations. Section 1 introduces the three formulas obtained from the cubic equation of a hearth by Murase (Ref. [1]). We find that Murase’s three formulas lead to a Horner’s method (Ref. [2]) and extension of a Newton’s method (2009) at the same time. This shows originality of Wasan (mathematics developed in Japan) in the Edo era (1603-1868). Suzuki (Ref. [3]) estimates Murase to be a rare mathematician in not only the history of Wasan but also the history of mathematics in the world. Section 2 gives the relations between Newton’s method, Horner’s method and Murase’s three formulas. Section 3 gives a new function defined such as .

Gauss-Newton法的半局部收敛性

设f:Rn→Rm 是Frechet可微的 ,m≥n .则非线性最小二乘问题可描述为下面的极小化问题 :minF(x) :=12 f(x) Tf(x) .Gauss Newton法是求解非线性最小二乘问题的最基本的方法之一 ,其n + 1步迭代定义为 :xn + 1=xn - f′(xn) Tf′(x) -1f′(xn) Tf(xn) .本文主要研究解非线性最小二乘问题的Gauss Newton法的半局部收敛性 .假设f(x)在B(x0 ,r)内连续可导且f′(x0 )满秩 ,若f的导数满足Lipschitz连续F′(x) -f′(x′)≤γx -x′ , x ,x′∈B(x0 ,r) .在一个关于初始点x0 的判断准则c =f(x0 ) ,β =f′T(x0 )f′(x0 ) -1f′(x0 ) T ,β2 cγ <1 1 0下 ,Gauss Newton法产生的序列 {xn}收敛到一个驻点x ,从而给出了Gauss Newton法的半局部收敛性 .

A Family of Fifth-order Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.

Novel Newton’s learning algorithm of neural networks

Newton＇s learning algorithm of NN is presented and realized. In theory, the convergence rate of learning algorithm of NN based on Newton＇s method must be faster than BP＇s and other learning algorithms, because the gradient method is linearly convergent while Newton＇s method has second order convergence rate. The fast computing algorithm of Hesse matrix of the cost function of NN is proposed and it is the theory basis of the improvement of Newton＇s learning algorithm. Simulation results show that the convergence rate of Newton＇s learning algorithm is high and apparently faster than the traditional BP method＇s, and the robustness of Newton＇s learning algorithm is also better than BP method＇ s.

On the Fourier approximation method for steady water waves

A computational method for steady water waves is presented on the basis of potential theory in the physical plane with spatial variables as independent quantities. The finite Fourier series are applied to approximating the free surface and potential function. A set of nonlinear algebraic equations for the Fourier coefficients are derived from the free surface kinetic and dynamic boundary conditions. These algebraic equations are numerically solved through Newton＇s iterative method, and the iterative stability is further improved by a relaxation technology. The integral properties of steady water waves are numerically analyzed, showing that （1） the set-up and the set-down are both non-monotonic quantities with the wave steepness, and （2） the Fourier spectrum of the free surface is broader than that of the potential function. The latter further leads us to explore a modification for the present method by approximating the free surface and potential function through different Fourier series, with the truncation of the former higher than that of the latter. Numerical tests show that this modification is effective, and can notably reduce the errors of the free surface boundary conditions.

Solving Large Scale Nonlinear Equations by a New ODE Numerical Integration Method

In this paper a new ODE numerical integration method was successfully applied to solving nonlinear equations. The method is of same simplicity as fixed point iteration, but the efficiency has been significantly improved, so it is especially suitable for large scale systems. For Brown’s equations, an existing article reported that when the dimension of the equation N = 40, the subroutines they used could not give a solution, as compared with our method, we can easily solve this equation even when N = 100. Other two large equations have the dimension of N = 1000, all the existing available methods have great difficulties to handle them, however, our method proposed in this paper can deal with those tough equations without any difficulties. The sigularity and choosing initial values problems were also mentioned in this paper.

Modified Efficient Families of Two and Three-Step Predictor-Corrector Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze modified families of predictor-corrector iterative methods for finding simple zeros of univariate nonlinear equations, permitting near the root. The main advantage of our methods is that they perform better and moreover, have the same efficiency indices as that of existing multipoint iterative methods. Furthermore, the convergence analysis of the new methods is discussed and several examples are given to illustrate their efficiency.

Solution of Delay Differential Equations Using a Modified Power Series Method

This paper presents a Modified Power Series Method (MPSM) for the solution of delay differential equations. Unlike the traditional power series method which is applied to solve only linear differential equations, this new approach is applicable to both linear and nonlinear problems. The method produces a system of algebraic equations which is solved to determine the coefficients in the trial solution. The method provides the solution in form of a rapid convergent series. The obtained results for numerical examples demonstrate the reliability and efficiency of the method.