scholarly journals Constructing a High-Order Globally Convergent Iterative Method for Calculating the Matrix Sign Function

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Haifa Bin Jebreen

This work is concerned with the construction of a new matrix iteration in the form of an iterative method which is globally convergent for finding the sign of a square matrix having no eigenvalues on the axis of imaginary. Toward this goal, a new method is built via an application of a new four-step nonlinear equation solver on a particulate matrix equation. It is discussed that the proposed scheme has global convergence with eighth order of convergence. To illustrate the effectiveness of the theoretical results, several computational experiments are worked out.

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
F. Soleymani ◽  
Predrag S. Stanimirović ◽  
Igor Stojanović

We define and investigate a globally convergent iterative method possessing sixth order of convergence which is intended to calculate the polar decomposition and the matrix sign function. Some analysis of stability and computational complexity are brought forward. The behaviors of the proposed algorithms are illustrated by numerical experiments.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
F. Soleymani ◽  
P. S. Stanimirović ◽  
S. Shateyi ◽  
F. Khaksar Haghani

This study presents a matrix iterative method for finding the sign of a square complex matrix. It is shown that the sequence of iterates converges to the sign and has asymptotical stability, provided that the initial matrix is appropriately chosen. Some illustrations are presented to support the theory.


1995 ◽  
Vol 40 (8) ◽  
pp. 1330-1348 ◽  
Author(s):  
C.S. Kenney ◽  
A.J. Laub

Sign in / Sign up

Export Citation Format

Share Document