Higher-order singular value decomposition: Difference between revisions

Revision as of 20:54, 19 June 2025

Revision as of 21:14, 19 June 2025

Line 57:

=== Classic computation ===

While De Lathauwer et al. clarified Tucker’s frameworkconcepts through two influential papers, Vasilescu and Terzopoulos synthesized the ideas into an elegant two-step algorithm—one whose simplicity belies the complexity it resolves. The Tucker/Kroonenberg 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 a closed-form solution that can be computed sequentially, but it is also well-suited for parallel computation.

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