Portal de Periódicos da CAPES

An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix

1971; Society for Industrial and Applied Mathematics; Volume: 8; Issue: 2 Linguagem: Inglês

10.1137/0708036

1095-7170

Åke Björck, C. Bowie,

Iterative Methods for Nonlinear Equations

The closest unitary matrix, measured in Euclidean norm, to a given rectangular matrix A is known to be the unitary factor in the polar decomposition of A. The paper gives a family of iterative methods of order of convergence $p + 1,\, p = 1,2,3, \cdots $, for computing this matrix. The methods are especially efficient when the columns of A are not too far from being orthonormal. The choice of order of convergence to minimize the amount of computation is discussed. Global convergence properties for the methods of order $ \leqq 4$ are studied and sufficient conditions for convergence in terms of $\| {I - A^H A} \|$ are given.