scholarly journals Newton’s Method for the Matrix Nonsingular Square Root

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.

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

2009 ◽  
Vol 21 (5) ◽  
pp. 1415-1433 ◽  
Author(s):  
P.-A. Absil ◽  
M. Ishteva ◽  
L. De Lathauwer ◽  
S. Van Huffel

Newton's method for solving the matrix equation [Formula: see text] runs up against the fact that its zeros are not isolated. This is due to a symmetry of F by the action of the orthogonal group. We show how differential-geometric techniques can be exploited to remove this symmetry and obtain a “geometric” Newton algorithm that finds the zeros of F. The geometric Newton method does not suffer from the degeneracy issue that stands in the way of the original Newton method.


Sign in / Sign up

Export Citation Format

Share Document