Answers are grounded in this paper and cite their sources.
Randomized iterative process improves dimensionality reduction in datasets, suggesting a new optimal technique.
The so-called DCD-matrices consist of products of two diagonal matrices with a circulant matrix, merging diagonal and circulant matrices with rank-one matrices. By introducing a notion of double orthogonality for rectangular matrices, an iterative double orthogonalization process is devised for approximating a given M∈ \,Cn × n M ∈ C n × n with DCD-matrices. This simultaneous orthogonality of columns and rows leads to several approximation schemes of which the best rank-one approximation is just a special case. Expanding through summing yields, like principal component analysis (PCA), a novel optimal technique for reducing the dimensionality of datasets. Being notably general and flexible, this approach provides a natural way to merge fast Fourier methods with low rank matrix approximations. Least squares solution methods play a significant role in algorithms.
No takes yet. Share an insight, caveat, or question.
Huhtanen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: