A tree of generalizations of the ordinary singular value decomposition (Q752136): Difference between revisions

The first proofs of the ordinary singular value decomposition (SVD) date back more than a century. Because of its importance in the analysis and numerical solution of numerous problems several generalizations of the SVD have been proposed. - It is the aim of this paper to develop a tree of generalizations of the ordinary SVD the goal of which is a combined factorization of an arbitrary number of matrices. The construction of the tree is recursive, where the ordinary SVD maintains the top of the tree and an induction step is used when proceeding from level k-1 to level k of the tree. The generalizations that have been known before are part of this tree and are situated on level two and three.