ArticleslgStudy

mathematics

Higher-order singular value decomposition

Higher-order singular value decomposition is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Higher-order singular value decomposition rather than just read about it. In short: In multilinear algebra, the higher-order singular value decomposition (HOSVD) is a misnomer. There does not exist a single tensor decomposition that retains all the defining properties of the matrix SVD.

Key takeaways

  • Higher-order singular value decomposition belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Higher-order singular value decomposition to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Higher-order singular value decomposition from memory before moving on to harder problems.

Reference excerpt

In multilinear algebra, the higher-order singular value decomposition (HOSVD) is a misnomer. There does not exist a single tensor decomposition that retains all the defining properties of the matrix SVD. The matrix SVD simultaneously yields a

rank-𝑅 decomposition and orthonormal subspaces for the row and column spaces. These properties are not realized within a single algorithm for higher-order tensors, but are instead realized by two distinct algorithmic developments and represent two distinct research directions. Harshman, as well as, the team of Carol and Chang proposed Canonical polyadic decomposition (CPD), which is a variant of the tensor rank decomposition, in which a tensor is approximated as a sum of K rank-1 tensors for a user-specified K. L. R. Tucker proposed a strategy for computing orthonormal subspaces for third order tensors. Aspects of these algorithms can be traced as far back as F. L. Hitchcock in 1928.

De Lathauwer et al. introduced clarity to the Tucker concepts, while Vasilescu and Terzopoulos introduced algorithmic clarity. Vasilescu and Terzopoulos introduced the M-mode SVD, which is the classic algorithm that is currently referred in the literature as the Tucker or the HOSVD. The Tucker approach and De Lathauwer's implementation are both sequential and rely on iterative procedures such as gradient descent or the power method. By contrast, the M-mode SVD provides a closed-form solution that can be executed sequentially and is well-suited for parallel computation.

This misattribution has had lasting impact on the scholarly record, obscuring the original source of a widely adopted algorithm, and complicating efforts to trace its development, reproduce results, and recognizing the respective contributions of different research efforts. The term M-mode SVD accurately reflects the algorithm employed. It captures the actual computation, a set of SVDs on mode-flattenings without making assumptions about the structure of the core tensor or implying a rank decomposition. Robust and L1-norm-based variants of this decomposition framework have since been proposed.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Higher-order singular value decomposition

Start with the simplest possible case. Write down what Higher-order singular value decomposition claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Higher-order singular value decomposition before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Higher-order singular value decomposition ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Higher-order singular value decomposition

In research
Higher-order singular value decomposition appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Higher-order singular value decomposition in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Higher-order singular value decomposition is common in secondary-school and first-year university syllabi. It links to neighbouring topics Multilinear algebra, Tensors, so understanding it makes those chapters shorter.
In everyday life
Look for Higher-order singular value decomposition outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Higher-order singular value decomposition” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Higher-order singular value decomposition in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Higher-order singular value decomposition means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Higher-order singular value decomposition out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Higher-order singular value decomposition in simple terms?

In multilinear algebra, the higher-order singular value decomposition (HOSVD) is a misnomer. There does not exist a single tensor decomposition that retains all the defining properties of the matrix SVD.

Why does Higher-order singular value decomposition matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Higher-order singular value decomposition?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Higher-order singular value decomposition.

Tags

  • Multilinear algebra
  • Tensors

Keep exploring