scholarly journals Newton's method with exact line search for the square root of a matrix

2008 ◽  
Vol 96 ◽  
pp. 012034 ◽  
Author(s):  
J-h Long ◽  
X-y Hu ◽  
L Zhang
2000 ◽  
Vol 26 (10) ◽  
pp. 1345-1368 ◽  
Author(s):  
Peter Benner ◽  
Ralph Byers ◽  
Enrique S Quintana-Ortı́ ◽  
Gregorio Quintana-Ortı́

2022 ◽  
Vol 40 ◽  
pp. 1-6
Author(s):  
Saroj Kumar Padhan ◽  
S. Gadtia

The present investigation deals with the critical study of the works of Lancaster and Traub, who have developed $n$th root extraction methods of a real number. It is found that their developed methods are equivalent and the particular cases of Halley's and Householder's methods. Again the methods presented by them are easily obtained from simple modifications of Newton's method, which is the extension of Heron's square root iteration formula. Further, the rate of convergency of their reported methods are studied.


2019 ◽  
Vol 98 ◽  
pp. 57-62 ◽  
Author(s):  
Xue-Feng Duan ◽  
Cun-Yun Wang ◽  
Chun-Mei Li

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Chun-Mei Li ◽  
Shu-Qian Shen

Two new algorithms are proposed to compute the nonsingular square root of a matrixA. Convergence theorems and stability analysis for these new algorithms are given. Numerical results show that these new algorithms are feasible and effective.


Sign in / Sign up

Export Citation Format

Share Document