Higher-order singular value decomposition: Difference between revisions

Revision as of 20:21, 28 June 2025

Revision as of 20:39, 28 June 2025

Line 60:

=== Classic computation ===

While De Lathauwer et al. clarified Tucker’s concepts through two influential papers, Vasilescu and Terzopoulos synthesizedprovided the ideas into an elegant two-step algorithm—one whose simplicity belies the complexity italgoritmic resolvesclarity. The Tucker algorithm and De Lathauwer ''et al.''<ref name=:2/> companion algorithm are sequential, relying on iterative methods such as gradient descent or the power method. In contrast, the '''M-mode SVD''' is acomputes the othonormal subspaces in closed-form solution that can be computedexecuted sequentially, but it is also well-suited for parallel computation.

=== M-mode SVD (also referred to as HOSVD or Tucker)===