Related Experiment Video
Updated: Jun 16, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Generalized low-rank approximations of matrices revisited
Jun Liu1, Songcan Chen, Zhi-Hua Zhou
1Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China. j.liu@nuaa.edu.cn
Generalized low-rank approximations of matrices (GLRAM) offer advantages over singular value decomposition (SVD) in computation time and compression. This study reveals GLRAM
Area of Science:
- Numerical Analysis
- Machine Learning
- Data Science
Background:
- Generalized Low-Rank Matrix Approximation (GLRAM) is an efficient alternative to Singular Value Decomposition (SVD).
- GLRAM offers benefits in computation time, compression ratio, and classification performance.
- Existing literature lacks exploration of fundamental properties and solutions to crucial problems in GLRAM.
Purpose of the Study:
- To revisit and explore fundamental properties of GLRAM.
- To establish the relationship between GLRAM and SVD.
- To address open problems concerning GLRAM's objective function and compression performance.
Main Methods:
- Comparative analysis of GLRAM and SVD objective functions.
- Derivation of a lower bound for the GLRAM objective function.
- Theoretical analysis of GLRAM's compression performance based on minimizing the lower bound.
Main Results:
- GLRAM's objective function is identical to SVD's, differing only in constraints.
- A lower bound for the GLRAM objective function is derived, with conditions for achieving it.
- Theoretical justification is provided for optimal GLRAM reconstruction error when left and right transformations have equal columns.
Conclusions:
- GLRAM shares a close relationship with SVD, differing primarily in constraints.
- The study provides theoretical underpinnings for GLRAM's effectiveness in compression.
- This work addresses open questions, enhancing the understanding and usability of GLRAM.
Related Concept Videos
Application of Linearization and Approximation
Linear Approximations
Gaussian Elimination: Problem Solving
Linearization and Approximation
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...