A generalized Nystrom method with column sketching for low-rank approximation of nonsymmetric matrices
Yatian Wang, Hua Xiang, Chi Zhang, Songling Zhang

TL;DR
This paper introduces a generalized Nystrom method with column sketching for efficient and accurate low-rank approximation of large-scale nonsymmetric matrices, extending classical techniques to broader applications.
Contribution
It extends the classical Nystrom method to nonsymmetric matrices using column sketching, improving accuracy and speed while maintaining stability.
Findings
Demonstrates robustness in numerical experiments
Achieves better accuracy compared to existing methods
Provides faster computation for large matrices
Abstract
This paper is concerned with the low-rank approximation for large-scale nonsymmetric matrices. Inspired by the classical Nystrom method, which is a popular method to find the low-rank approximation for symmetric positive semidefinite matrices, we explore an extension of the Nystrom method to approximate nonsymmetric matrices. The proposed method is a generalized Nystrom method with column sketching and shows its advantages in accuracy and speed without sacri cing stability. And the numerical experiments will illustrate the robustness of our new methods in finding a desired low-rank approximation of nonsymmetric matrix.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical and numerical algorithms · Sparse and Compressive Sensing Techniques · Matrix Theory and Algorithms
