Newton’s Method for the Matrix Nonsingular Square Root
Two new algorithms are proposed to compute the nonsingular square root of a matrix A. Convergence theorems and stability analysis for these new algorithms are given. Numerical results show that these new algorithms are feasible and effective.
Saved in:
| Main Authors: | Chun-Mei Li, Shu-Qian Shen |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/267042 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Target Detection Using Nonsingular Approximations for a Singular Covariance Matrix
by: Nir Gorelik, et al.
Published: (2012-01-01) -
Polynomiography Based on the Nonstandard Newton-Like Root Finding Methods
by: Krzysztof Gdawiec, et al.
Published: (2015-01-01) -
Nonsingular Meshless Method in an Acoustic Indoor Problem
by: Adam BRANSKI, et al.
Published: (2017-10-01) -
Newton-Krylov Type Algorithm for Solving Nonlinear Least Squares Problems
by: Mohammedi R. Abdel-Aziz, et al.
Published: (2009-01-01) -
Inexact Newton matrix-free methods for solving complex biotechnological systems
by: Paweł Drąg, et al.
Published: (2014-09-01)