Hostname: page-component-76dd75c94c-ccc76 Total loading time: 0 Render date: 2024-04-30T09:08:48.111Z Has data issue: false hasContentIssue false
  • English
  • Français

On optimal symmetric orthogonalisation and square roots of a normal matrix

Published online by Cambridge University Press:  17 April 2009

Nagwa Sherif
Nagwa Sherif
Affiliation:
Department of Mathematics, Faculty of Science University of Qatar, Doha Qatar
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 47 , Issue 2 , April 1993 , pp. 233 - 246
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]Asic, M.D. and Adamovic, D.D., ‘Limit points of sequences on metric spaces’, Amer. Math. Monthly 77 (1970), 613–616.Google Scholar
[2]De Nman, E.D., ‘Roots of real matrices’, Linear Algebra Appl. 36 (1981), 133–139.Google Scholar
[3]Dongarra, J.J., Bunch, J.R., Moler, C.B. and Stewart, G., LINPACK user's guide (SIAM, Philadelphia, PA, 1979).Google Scholar
[4]Eberlein, P.J., ‘On one-sided Jacobi methods for parallel computation’, Siam J. Algebraic Discrete Methods 8 (1987), 790–796.Google Scholar
[5]Gohberg, I.C. and Krein, M.G., Introduction to the theory of linear nonself adjoint operators, Transl. Math. Monographs 18 (Amer. Math. Soc., Providence, R.I., 1969).Google Scholar
[6]Golub, G.H. and Van Loan, C.F., Matrix computations, Johns Hopkins (University Press, Baltimore, MD, 1983).Google Scholar
[7]Grone, R., Jhonson, C.R., Sa, E.M. and Wolkowicz, H., ‘Normal matrices’, Linear Algebra Appl. 87 (1987), 213–225.Google Scholar
[8]Halmos, P.R., ‘Positive approximants of operators’, Indiana Univ. Math. J. 21 (1972), 951–960.Google Scholar
[9]Higham, N.J., ‘Computing the polar decomposition with applications’, Siam J. Sci. Statist. Comput. 7 (1986), 1160–1174.Google Scholar
[10]Higham, N.J., ‘Newton's method for the matrix square root’, Math. of Computation 46 (1986), 537–549.Google Scholar
[11]Higham, N.J., ‘Computing real square roots of a real matrix’, Linear Algebra Appl. 88/89 (1987), 405–430.Google Scholar
[12]Fan, Ky, ‘Maximum properties and inequalities for the eigenvalues of completely continuous operators’, Proc. Nat. Acad. Sci. U.S.A. 37 (1951), 760–766.CrossRefGoogle Scholar
[13]Fan, Ky and Hoffman, A.J., ‘Some metric inequalities in the space of matrices’, Proc. Amer. Math. Soc. 6 (1955), 111–116.CrossRefGoogle Scholar
[14]Lancaster, P., Theory of matrices (Academic Press, New York, 1969).Google Scholar
[15]Philippe, B., ‘An algorithm to improve nearly orthonormal sets of vectors on a vector processor’, SIAM J. Algebraic Discrete Methods 8 (1987), 396–403.Google Scholar
[16]Putnam, C.R., ‘On square roots of normal operators’, Proc. Amer. Math. Soc. 8 (1957), 768–769.Google Scholar
[17]Rinehart, R.F., ‘The equivalence of definitions of a matrix function’, Amer. Math. Monthly 62 (1955), 395–414.Google Scholar
[18]Schonemann, P.H., ‘A generalized solution of the orthogonal Procustes problem’, Psy-chometrika 31 (1966), 1–10.Google Scholar
[19]Stewart, G.W., Introduction to matrix computation (Academic Press, New York, 1973).Google Scholar
[20]Tsay, Y.T., Sheigh, L.S. and Tsai, J.S.H., ‘A fact method for computing the principal nth roots of complex matrices’, Linear Algebra Appl. 76 (1986), 205–221.Google Scholar
[21]Wilkinson, J.H., The algebraic eigenvalue problem (Oxford University Press, New York, 1977).Google Scholar