On optimal symmetric orthogonalisation and square roots of a normal matrix
Author:
- 17 April 1993
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 47 (2) , 233-246
Abstract
It is well known that the factors in the polar decomposition of a full rank real m × n matrix, m ≥ n possess best approximation properties. We propose an iterative technique to compute the polar factors based on these best approximation properties. For normal matrices, the polar decomposition is useful. It is applied to compute the principal square roots of real and complex normal matrices.Keywords
This publication has 19 references indexed in Scilit:
- Normal matricesLinear Algebra and its Applications, 1987
- Newton's Method for the Matrix Square RootMathematics of Computation, 1986
- Newton’s method for the matrix square rootMathematics of Computation, 1986
- Roots of real matricesLinear Algebra and its Applications, 1981
- Limit Points of Sequences in Metric SpacesThe American Mathematical Monthly, 1970
- On square roots of normal operatorsProceedings of the American Mathematical Society, 1957
- On Square Roots of Normal OperatorsProceedings of the American Mathematical Society, 1957
- The Equivalence of Definitions of a Matric FunctionThe American Mathematical Monthly, 1955
- Some metric inequalities in the space of matricesProceedings of the American Mathematical Society, 1955
- Some Metric Inequalities in the Space of MatricesProceedings of the American Mathematical Society, 1955