CANM, a program for numerical solution of a system of nonlinear equations using the continuous analog of Newton's method

2004 ◽  
Vol 156 (2) ◽  
pp. 154-170 ◽  
Author(s):  
Alexander Abrashkevich ◽  
I.V. Puzynin
SPIN ◽  
2021 ◽  
pp. 2140004
Author(s):  
Cheng Xue ◽  
Yuchun Wu ◽  
Guoping Guo

While quantum computing provides an exponential advantage in solving the system of linear equations, there is little work to solve the system of nonlinear equations with quantum computing. We propose quantum Newton’s method (QNM) for solving [Formula: see text]-dimensional system of nonlinear equations based on Newton’s method. In QNM, we solve the system of linear equations in each iteration of Newton’s method with quantum linear system solver. We use a specific quantum data structure and [Formula: see text] tomography with sample error [Formula: see text] to implement the classical-quantum data conversion process between the two iterations of QNM, thereby constructing the whole process of QNM. The complexity of QNM in each iteration is [Formula: see text]. Through numerical simulation, we find that when [Formula: see text], QNM is still effective, so the complexity of QNM is sublinear with [Formula: see text], which provides quantum advantage compared with the optimal classical algorithm.


Author(s):  
Scott A. Burns

Abstract A monomial-based method for solving systems of algebraic nonlinear equations is presented. The method uses the arithmetic-geometric mean inequality to construct a system of monomial equations that approximates the system of nonlinear equations. This “monomial method” is closely related to Newton’s method, yet exhibits many special properties not shared by Newton’s method that enhance performance. These special properties are discussed in relation to engineering design optimization.


2011 ◽  
Vol 60 (2) ◽  
pp. 145-159 ◽  
Author(s):  
Marcin Ligas ◽  
Piotr Banasik

Conversion between Cartesian and geodetic coordinates on a rotational ellipsoid by solving a system of nonlinear equationsA new method to transform from Cartesian to geodetic coordinates is presented. It is based on the solution of a system of nonlinear equations with respect to the coordinates of the point projected onto the ellipsoid along the normal. Newton's method and a modification of Newton's method were applied to give third-order convergence. The method developed was compared to some well known iterative techniques. All methods were tested on three ellipsoidal height ranges: namely, (-10 - 10 km) (terrestrial), (20 - 1000 km), and (1000 - 36000 km) (satellite). One iteration of the presented method, implemented with the third-order convergence modified Newton's method, is necessary to obtain a satisfactory level of accuracy for the geodetic latitude (σφ < 0.0004") and height (σh< 10-6km, i.e. less than a millimetre) for all the heights tested. The method is slightly slower than the method of Fukushima (2006) and Fukushima's (1999) fast implementation of Bowring's (1976) method.


2012 ◽  
Vol 220-223 ◽  
pp. 2585-2588
Author(s):  
Zhong Yong Hu ◽  
Fang Liang ◽  
Lian Zhong Li ◽  
Rui Chen

In this paper, we present a modified sixth order convergent Newton-type method for solving nonlinear equations. It is free from second derivatives, and requires three evaluations of the functions and two evaluations of derivatives per iteration. Hence the efficiency index of the presented method is 1.43097 which is better than that of classical Newton’s method 1.41421. Several results are given to illustrate the advantage and efficiency the algorithm.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Rami Sihwail ◽  
Obadah Said Solaiman ◽  
Khairuddin Omar ◽  
Khairul Akram Zainol Ariffin ◽  
Mohammed Alswaitti ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document