Clustering‐Based Low Rank Approximation Method
Numerical Methods for Partial Differential Equations · 2026-07 · 42 (4)
DOI: 10.1002/num.70122 ↗At a glance
Journal article in Numerical Methods for Partial Differential Equations, published online on 2026-07-07. Written by Yujun Zhu and 4 co-authors. 64 references.
Abstract (original language)
We propose a clustering‐based generalized low rank approximation method, which takes advantage of appealing features from both the generalized low rank approximation of matrices (GLRAM) and cluster analysis. It exploits a more general form of clustering generators and similarity metrics so that it is more suitable for matrix‐structured data relative to conventional partitioning methods. In our approach, we first pre‐classify the initial matrix collection into several small subset clusters and then sequentially compress the matrices within the clusters. This strategy enhances the numerical precision of the low‐rank approximation. In essence, we combine the ideas of GLRAM and clustering into a hybrid algorithm for dimensionality reduction. The proposed algorithm can be viewed as a generalization of both techniques. Theoretical analysis and numerical experiments are established to validate the feasibility and effectiveness of the proposed algorithm.
Cite
APA
Zhu, Y., Ning, Y., Arshad, H., Chen, Q., & Ming, J. (2026). Clustering‐Based Low Rank Approximation Method. Numerical Methods for Partial Differential Equations, 42(4). https://doi.org/10.1002/num.70122
Vancouver
Zhu Y, Ning Y, Arshad H, Chen Q, Ming J. Clustering‐Based Low Rank Approximation Method. Numerical Methods for Partial Differential Equations. 2026;42(4). doi:10.1002/num.70122
BibTeX
@article{Zhu2026,
author = {Zhu, Yujun and Ning, Yulan and Arshad, Hizba and Chen, Qingshan and Ming, Ju},
title = {Clustering‐Based Low Rank Approximation Method},
journal = {Numerical Methods for Partial Differential Equations},
year = {2026},
volume = {42},
number = {4},
doi = {10.1002/num.70122}
}
EUVIMED