scholarly journals A generalized multivariable Newton method

Author(s):  
Regina S. Burachik ◽  
Bethany I. Caldwell ◽  
C. Yalçın Kaya

AbstractIt is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a larger convergence region as well as more desirable properties near a solution. We prove quadratic convergence of the new family, and provide specific bounds for the asymptotic error constant. We illustrate the advantages of the new methods by means of test problems, including two and six variable polynomial systems, as well as a challenging signal processing example. We present a numerical experimental methodology which uses a large number of randomized initial guesses for a number of methods from the new family, in turn providing advice as to which of the methods employed is preferable to use in a particular search domain.

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Weiping Shen

We propose a generalized inexact Newton method for solving the inverse eigenvalue problems, which includes the generalized Newton method as a special case. Under the nonsingularity assumption of the Jacobian matrices at the solutionc*, a convergence analysis covering both the distinct and multiple eigenvalue cases is provided and the quadratic convergence property is proved. Moreover, numerical tests are given in the last section and comparisons with the generalized Newton method are made.


2021 ◽  
Vol 5 (3) ◽  
pp. 100
Author(s):  
Youssri Hassan Youssri

Herein, we developed and analyzed a new fractal–fractional (FF) operational matrix for orthonormal normalized ultraspherical polynomials. We used this matrix to handle the FF Riccati differential equation with the new generalized Caputo FF derivative. Based on the developed operational matrix and the spectral Tau method, the nonlinear differential problem was reduced to a system of algebraic equations in the unknown expansion coefficients. Accordingly, the resulting system was solved by Newton’s solver with a small initial guess. The efficiency, accuracy, and applicability of the developed numerical method were checked by exhibiting various test problems. The obtained results were also compared with other recent methods, based on the available literature.


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Jiao-Jiao Deng ◽  
Hsiao-Dong Chiang

Power flow study plays a fundamental role in the process of power system operation and planning. Of the several methods in commercial power flow package, the Newton-Raphson (NR) method is the most popular one. In this paper, we numerically study the convergence region of each power flow solution under the NR method. This study of convergence region provides insights of the complexity of the NR method in finding power flow solutions. Our numerical studies confirm that the convergence region of NR method has a fractal boundary and find that this fractal boundary of convergence regions persists under different loading conditions. In addition, the convergence regions of NR method for power flow equations with different nonlinear load models are also fractal. This fractal property highlights the importance of choosing initial guesses since a small variation of an initial guess near the convergence boundary leads to two different power flow solutions. One vital variation of Newton method popular in power industry is the fast decoupled power flow method whose convergence region is also numerically studied on an IEEE 14-bus test system which is of 22-dimensional in state space.


2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Santhosh George ◽  
Suresan Pareth

A two step modified Newton method is considered for obtaining an approximate solution for the nonlinear ill-posed equation F(x)=f when the available data are fδ with ‖f−fδ‖≤δ and the operator F is monotone. The derived error estimate under a general source condition on x0−x^ is of optimal order; here x0 is the initial guess and x^ is the actual solution. The regularization parameter is chosen according to the adaptive method considered by Perverzev and Schock (2005). The computational results provided endorse the reliability and effectiveness of our method.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Jitender Singh

The simple shooting method is revisited in order to solve nonlinear two-point BVP numerically. The BVP of the type is considered where components of are known at one of the boundaries and components of are specified at the other boundary. The map is assumed to be smooth and satisfies the Lipschitz condition. The two-point BVP is transformed into a system of nonlinear algebraic equations in several variables which, is solved numerically using the Newton method. Unlike the one-dimensional case, the Newton method does not always have quadratic convergence in general. However, we prove that the rate of convergence of the Newton iterative scheme associated with the BVPs of present type is at least quadratic. This indeed justifies and generalizes the shooting method of Ha (2001) to the BVPs arising in the higher order nonlinear ODEs. With at least quadratic convergence of Newton's method, an explicit application in solving nonlinear Rayleigh-Bénard convection in a horizontal fluid layer heated from the below is discussed where rapid convergence in nonlinear shooting essentially plays an important role.


2017 ◽  
Vol 4 (2) ◽  
pp. 231-242 ◽  
Author(s):  
Qiuye Sun ◽  
Ling Liu ◽  
Dazhong Ma ◽  
Huaguang Zhang

Author(s):  
Mohamed B. Trabia

Abstract Nelder and Mead Simplex (NMS) algorithm is an effective nonlinear programming technique. Trabia and Lu (1999) recently presented a novel algorithm, Fuzzy Simplex (FS), which improved the efficiency of Nelder and Mead Simplex by using fuzzy logic to determine the orientation and size of the simplex. While Fuzzy Simplex algorithm can be successfully used to search a wide variety of functions, it suffers, as other simplex algorithms, from its dependence on the initial guess and the original simplex size. This paper addresses this problem by combining the Fuzzy Simplex with Genetic Algorithm (GA) in a hybrid algorithm. Standard test problems are used to evaluate the efficiency of the algorithm. The algorithm is also applied successfully to several engineering design problems. The Hybrid GA Fuzzy Simplex algorithm generally results in a faster convergence.


2015 ◽  
Vol 25 (06) ◽  
pp. 1530018 ◽  
Author(s):  
Jiao-Jiao Deng ◽  
Hsiao-Dong Chiang ◽  
Tian-Qi Zhao

This paper analyzes the convergence properties and convergence region of a class of trajectory-based power flow methods. The convergence region of the trajectory-based method is a connected set and possesses the near-by property. The convergence region of Newton method and trajectory-based method in solving power flow problems are numerically investigated. Since the convergence region of trajectory-based method corresponds to the stability region of the nonlinear dynamic system, the stability regions of two dynamic systems are computed. The numerical results indicate that the stability region of the dynamic system possesses better geometry features than the convergence region of Newton method. These properties make the trajectory-based power flow method robust, especially on heavy loading conditions.


Sign in / Sign up

Export Citation Format

Share Document