Gradient-type algorithms for partial singular value decomposition
Related Experiment Video
Updated: May 29, 2026

Image Recognition and Parameter Analysis of Concrete Vibration State Based on Support Vector Machine
Published on: January 5, 2024
1Department of Electrical and Computer Engineering, Ben-Gurion University, Beer-Sheva, Israel; Tadiran, Inc., Telecommunication Divison, P. O. B. 500, Petah Tikva 49104, Israel.
Abstract:
It is often desirable to calculate only a few terms of the SVD expansion of a matrix, corresponding to the largest or smallest singular values. Two algorithms, based on gradient and conjugate gradient search, are proposed for this purpose. SVD is computed term by term in a decreasing or increasing order of singular values. The algorithms are simple to implement and are especially advantageous with large matrices.
Related Concept Videos
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Gaussian Elimination: Problem Solving
Partial Fractions
Singularity Functions for Shear
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an organic...
Separable Differential Equations