Addendum: Is The Polar Decomposition Finitely Computable?
Alan D. George, Х. Д. Икрамов · SIAM Journal on Matrix Analysis and Applications · 1997
After the paper cited in the title [George and Ikramov, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 348-354] was sent to the printer, the authors succeeded in finding a way to show that the answer to the title question is no. This brief note contains a proof of the result.