AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots is developed in a form suitable for finding the positive definite pth root of a positive definite matrix. Numerical examples are given and compared with the corresponding Newton iterates
It is known that the matrix square root has a significant role in linear algebra computations arisen...
In several recent papers, a one-sided iterative process for computing positive definite solu-tions o...
The polar decomposition of an $m x n$ matrix $A$ of full rank, where $m \geq n$, can be computed us...
AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots i...
Abstract. Stable versions of Newton’s iteration for computing the principal matrix pth root A1/p of ...
We discuss different variants of Newton’s method for computing the pth root of a given matrix. A sui...
New theoretical results are presented about the principal matrix pth root. In particular, we show th...
AbstractIf A is a matrix with no negative real eigenvalues and all zero eigenvalues of A are semisim...
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized versi...
WOS: A1997YG10800015An iterative algorithm for computing the principal nth root of a positive-defini...
Abstract. Newton’s method for the inverse matrix pth root, A−1/p, has the attraction that it involve...
The computation of the roots of positive definite matrices arises in nuclear magnetic resonance, co...
Abstract: New iterative algorithms for finding the nth root of a positive number m, to any degree of...
We discuss the positive definite solutions for the system of nonlinear matrix equations and , where...
AbstractBased on the generalized continued-fraction method for finding the nth roots of real numbers...
It is known that the matrix square root has a significant role in linear algebra computations arisen...
In several recent papers, a one-sided iterative process for computing positive definite solu-tions o...
The polar decomposition of an $m x n$ matrix $A$ of full rank, where $m \geq n$, can be computed us...
AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots i...
Abstract. Stable versions of Newton’s iteration for computing the principal matrix pth root A1/p of ...
We discuss different variants of Newton’s method for computing the pth root of a given matrix. A sui...
New theoretical results are presented about the principal matrix pth root. In particular, we show th...
AbstractIf A is a matrix with no negative real eigenvalues and all zero eigenvalues of A are semisim...
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized versi...
WOS: A1997YG10800015An iterative algorithm for computing the principal nth root of a positive-defini...
Abstract. Newton’s method for the inverse matrix pth root, A−1/p, has the attraction that it involve...
The computation of the roots of positive definite matrices arises in nuclear magnetic resonance, co...
Abstract: New iterative algorithms for finding the nth root of a positive number m, to any degree of...
We discuss the positive definite solutions for the system of nonlinear matrix equations and , where...
AbstractBased on the generalized continued-fraction method for finding the nth roots of real numbers...
It is known that the matrix square root has a significant role in linear algebra computations arisen...
In several recent papers, a one-sided iterative process for computing positive definite solu-tions o...
The polar decomposition of an $m x n$ matrix $A$ of full rank, where $m \geq n$, can be computed us...
DOI
Add to ORKG