Add to ORKGCopyright © 2015 M. Sharifi et al.This is an open access article distributed under theCreativeCommonsAttribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We propose an iterative method for finding matrix sign function. It is shown that the scheme has global behavior with cubical rate of convergence. Examples are included to show the applicability and efficiency of the proposed scheme and its reciprocal. 1
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
This work is concerned with the construction of a new matrix iteration in the form of an iterative m...
We define and investigate a globally convergent iterative method possessing sixth order of convergen...
We define and investigate a globally convergent iterative method possessing sixth order of convergen...
Investigating the fractal behavior of iteration methods on special polynomials can help to find iter...
[EN] A general family of iterative methods including a free parameter is derived and proved to be co...
This paper uses a forward and backward error analysis to try to identify some classes of matrices fo...
This paper is concerned with numerical solutions to general linear matrix equations including the we...
We have implemented three matrix sign function algorithms on a Meiko CS-2 multiprocessor using the ...
We investigate the numerical solution of stable Sylvester equations via iterative schemes proposed f...
We investigate the numerical solution of stable Sylvester equations via iterative schemes proposed f...
In this paper, two new efficient algorithms for calculating the sign function of the large-scale spa...
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils b...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
This work is concerned with the construction of a new matrix iteration in the form of an iterative m...
We define and investigate a globally convergent iterative method possessing sixth order of convergen...
We define and investigate a globally convergent iterative method possessing sixth order of convergen...
Investigating the fractal behavior of iteration methods on special polynomials can help to find iter...
[EN] A general family of iterative methods including a free parameter is derived and proved to be co...
This paper uses a forward and backward error analysis to try to identify some classes of matrices fo...
This paper is concerned with numerical solutions to general linear matrix equations including the we...
We have implemented three matrix sign function algorithms on a Meiko CS-2 multiprocessor using the ...
We investigate the numerical solution of stable Sylvester equations via iterative schemes proposed f...
We investigate the numerical solution of stable Sylvester equations via iterative schemes proposed f...
In this paper, two new efficient algorithms for calculating the sign function of the large-scale spa...
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils b...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...
International audienceWe present two algorithms for the computation of the matrixsign and absolute ...