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
For any matrix automorphism group $\G$ associated with a bilinear or sesquilinear form, Mackey, Mack...
For any matrix automorphism group $\G$ associated with a bilinear or sesquilinear form, Mackey, Mack...
A quadratically convergent Newton method for computing the polar decomposition of a full-rank matrix...
We define and investigate a globally convergent iterative method possessing sixth order of convergen...
This work is concerned with the construction of a new matrix iteration in the form of an iterative m...
The sign function of a square matrix was introduced by Roberts in 1971. We show that it is useful to...
AbstractThe sign function of a square matrix was introduced by Roberts in 1971. We show that it is u...
The sign function of a square matrix was introduced by Roberts in 1971. We show that it is useful to...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental m...
Copyright © 2015 M. Sharifi et al.This is an open access article distributed under theCreativeCommon...
Investigating the fractal behavior of iteration methods on special polynomials can help to find iter...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental ma...
.In the paper we review the numerical methods for computing the polar decomposition of a matrix. Num...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental m...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental ma...
For any matrix automorphism group $\G$ associated with a bilinear or sesquilinear form, Mackey, Mack...
For any matrix automorphism group $\G$ associated with a bilinear or sesquilinear form, Mackey, Mack...
A quadratically convergent Newton method for computing the polar decomposition of a full-rank matrix...
We define and investigate a globally convergent iterative method possessing sixth order of convergen...
This work is concerned with the construction of a new matrix iteration in the form of an iterative m...
The sign function of a square matrix was introduced by Roberts in 1971. We show that it is useful to...
AbstractThe sign function of a square matrix was introduced by Roberts in 1971. We show that it is u...
The sign function of a square matrix was introduced by Roberts in 1971. We show that it is useful to...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental m...
Copyright © 2015 M. Sharifi et al.This is an open access article distributed under theCreativeCommon...
Investigating the fractal behavior of iteration methods on special polynomials can help to find iter...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental ma...
.In the paper we review the numerical methods for computing the polar decomposition of a matrix. Num...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental m...
The symmetric eigenvalue decomposition and the singular value decomposition (SVD) are fundamental ma...
For any matrix automorphism group $\G$ associated with a bilinear or sesquilinear form, Mackey, Mack...
For any matrix automorphism group $\G$ associated with a bilinear or sesquilinear form, Mackey, Mack...
A quadratically convergent Newton method for computing the polar decomposition of a full-rank matrix...
DOI
Add to ORKG