Answers are grounded in this paper and cite their sources.
An algorithm is developed for computing the singular value decomposition of a product of two general matrices without explicitly forming the product. The algorithm is based on an earlier Jacobi-like method due to Kogbetliantz and uses plane rotations applied to the two matrices separately. A triangular variant of the basic algorithm is developed that reduces the amount of work required.
No takes yet. Share an insight, caveat, or question.
Heath et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: