Correct the iterative calculation of the polar decomposition and its derivative
- Jan 22, 2022
-
-
Lisa Julia Nebel authored
Move the polar decomposition to a separate file and add the algorithm by Higham and Noferini (from Robin Fraenzel) In the test for the Higham and Noferini algorithm, we see: Unfortunately, for matrices that are close to an orthogonal matrix, this algorithm is about 2x slower. One can benefit from the Higham and Noferini algorithm only if the matrix is quite far away from an orthogonal one.
-
Lisa Julia Nebel authored
Before, the calculation was terminated after exactly three iterations, now the stopping criterion is fulfilled if the change in the norm of the polar factor is small enough.
-
Lisa Julia Nebel authored
-