On optimal symmetric orthogonalisation and square roots of a normal matrix
From MaRDI portal
Publication:5288103
DOI10.1017/S0004972700012478zbMath0781.65038OpenAlexW2137061027MaRDI QIDQ5288103
Publication date: 25 August 1993
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700012478
iterative schemecomplex matricesnormal matrixsquare rootspolar factorsoptimal symmetric orthogonalization
Related Items
Cites Work
- Computing real square roots of a real matrix
- A fast method for computing the principal \(n\)-th roots of complex matrices
- Normal matrices
- Roots of real matrices
- On Square Roots of Normal Operators
- Computing the Polar Decomposition—with Applications
- An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor
- On One-Sided Jacobi Methods for Parallel Computation
- Newton's Method for the Matrix Square Root
- Limit Points of Sequences in Metric Spaces
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
- Some Metric Inequalities in the Space of Matrices
- The Equivalence of Definitions of a Matric Function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On optimal symmetric orthogonalisation and square roots of a normal matrix