We revisit recent algorithms for computing matrix square roots and relate them to Newton iteration. New iterations are derived and a stability analysis is performed. A suitable scaling of an algorithm based on cyclic reduction is introduced, which removes the slow convergence of this iteration encountered in certain cases.
A note on computing the matrix square root
IANNAZZO, Bruno
2003
Abstract
We revisit recent algorithms for computing matrix square roots and relate them to Newton iteration. New iterations are derived and a stability analysis is performed. A suitable scaling of an algorithm based on cyclic reduction is introduced, which removes the slow convergence of this iteration encountered in certain cases.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
