Singular Values Calculator
Our free fractions calculator solves singular values problems. Get worked examples, visual aids, and downloadable results.
Reviewed for accuracy by Manoj Kumar, Mathematics Educator
Singular Values Calculator
Calculator
Adjust values & calculateEnter your values below. Every result is computed in your browser — no data is sent to any server.
Formula: sigma_i = sqrt(lambda_i(A^T A))
Worked example — sigma1 = 5, sigma2 = 3, condition number = 5/3 = 1.667
Formula
sigma_i = sqrt(lambda_i(A^T A))
Singular values are the square roots of the eigenvalues of A-transpose times A. They represent the stretching factors of the linear transformation defined by the matrix.
Worked Examples
Example 1: Singular Values of a 2x3 Matrix
Problem:Find the singular values of A = [[3,2,2],[2,3,-2]].
Solution:Compute A A^T: A A^T = [[17, 8], [8, 17]] Eigenvalues: trace = 34, det = 225 lambda = (34 +/- sqrt(1156-900))/2 = (34 +/- 16)/2 lambda1 = 25, lambda2 = 9 Singular values: sigma1 = sqrt(25) = 5, sigma2 = sqrt(9) = 3
Result:sigma1 = 5, sigma2 = 3, condition number = 5/3 = 1.667
Example 2: Rank-Deficient Matrix
Problem:Find the singular values of A = [[1,2,3],[2,4,6]] (rank 1).
Solution:A A^T = [[14, 28], [28, 56]] Eigenvalues: trace = 70, det = 14*56 - 28*28 = 0 lambda1 = 70, lambda2 = 0 Singular values: sigma1 = sqrt(70) = 8.3666, sigma2 = 0 Rank = 1 (one nonzero singular value)
Result:sigma1 = 8.3666, sigma2 = 0, rank = 1, condition = infinity
Frequently Asked Questions
What are singular values of a matrix and what do they represent?
Singular values are non-negative real numbers that describe the stretching factors of a matrix when viewed as a linear transformation. For any matrix A, the singular values are the square roots of the eigenvalues of A-transpose times A (or equivalently, A times A-transpose). They are typically denoted sigma-1, sigma-2, etc., arranged in decreasing order. Geometrically, when a matrix transforms a unit sphere, it becomes an ellipsoid, and the singular values are the lengths of the semi-axes of that ellipsoid. The largest singular value gives the maximum stretching factor, the smallest gives the minimum, and their ratio (the condition number) measures how distorted the transformation is.
How is Singular Value Decomposition (SVD) related to singular values?
Singular Value Decomposition factors any m-by-n matrix A into three matrices: A = U times Sigma times V-transpose. U is an m-by-m orthogonal matrix whose columns are the left singular vectors, Sigma is an m-by-n diagonal matrix containing the singular values on its diagonal, and V is an n-by-n orthogonal matrix whose columns are the right singular vectors. The singular values appear explicitly as the diagonal entries of Sigma. SVD is one of the most important decompositions in all of mathematics and computing, providing the foundation for principal component analysis, image compression, recommender systems, and numerous other applications. Every matrix has an SVD, making it universally applicable.
What is the condition number and why does it matter?
The condition number of a matrix is the ratio of its largest singular value to its smallest singular value (sigma-max / sigma-min). It measures the sensitivity of the solution of a linear system to perturbations in the input data. A condition number close to 1 indicates a well-conditioned matrix where small changes in input produce small changes in output. A large condition number (hundreds, thousands, or more) indicates an ill-conditioned matrix where tiny input errors can cause enormous output errors. In floating-point arithmetic, you lose roughly log10 of the condition number digits of accuracy. For example, a condition number of 10 to the 6th means you lose about 6 decimal digits of precision in solving a linear system.
How do singular values relate to the rank of a matrix?
The rank of a matrix equals the number of nonzero singular values. This provides a robust and reliable way to determine matrix rank, especially for matrices that are numerically rank-deficient (nearly singular). In practice, singular values that are extremely small relative to the largest singular value are treated as effectively zero, which defines the numerical rank. This threshold-based approach is more reliable than checking whether the determinant equals zero, because determinants can be misleadingly close to zero for well-conditioned matrices or misleadingly far from zero for ill-conditioned ones. The gap between consecutive singular values, particularly between the smallest nonzero one and zero, indicates how well-determined the rank is.
What is the Frobenius norm and how does it relate to singular values?
The Frobenius norm of a matrix is the square root of the sum of the squares of all its entries, analogous to the Euclidean norm for vectors. It equals the square root of the sum of the squares of all singular values. This relationship provides an elegant connection between matrix entries and matrix geometry. The Frobenius norm gives a measure of the overall magnitude of the matrix. In low-rank approximation (truncated SVD), the Frobenius norm of the error matrix equals the square root of the sum of squares of the discarded singular values. This result (the Eckart-Young theorem) guarantees that truncated SVD gives the best possible low-rank approximation in the Frobenius norm sense.
How are singular values used in image compression and data reduction?
In image compression, an image is stored as a matrix of pixel values, and SVD decomposes it into singular value components. Each component captures a different level of detail, with larger singular values representing more important features. By keeping only the k largest singular values and their corresponding singular vectors, you create a rank-k approximation that captures the essential visual information while dramatically reducing storage. For example, a 1000-by-1000 image requires storing 1 million values. A rank-50 approximation stores only 50 times (1000 + 1000 + 1) values, roughly 100,000 total, achieving 10-to-1 compression while preserving most visual quality. This principle extends to any data matrix in machine learning and statistics.
What is the spectral norm of a matrix and how is it computed?
The spectral norm (also called the operator norm or 2-norm) of a matrix is its largest singular value. It represents the maximum factor by which the matrix can stretch any unit vector, making it the most natural measure of the matrix as a linear operator. Computing the spectral norm directly requires finding the largest singular value, which can be done through the SVD or by finding the largest eigenvalue of A-transpose times A and taking its square root. For large sparse matrices, iterative methods like the power iteration or Lanczos algorithm can efficiently approximate the largest singular value without computing the full SVD. The spectral norm satisfies all properties of a matrix norm and is submultiplicative.
How do singular values help in solving least-squares problems?
Singular values provide complete insight into least-squares problems. The SVD of the coefficient matrix A reveals both the solution and its sensitivity. The least-squares solution is x = V times Sigma-pseudoinverse times U-transpose times b, where Sigma-pseudoinverse replaces each nonzero singular value with its reciprocal. Small singular values cause their reciprocals to be large, amplifying noise in the right-hand side b. This is why ill-conditioned systems (with small singular values relative to large ones) produce unreliable least-squares solutions. Truncated SVD and Tikhonov regularization address this by either ignoring small singular values or damping their contribution, trading a small amount of bias for much better stability.
What is the nuclear norm and what role does it play in optimization?
The nuclear norm (also called the trace norm or Schatten 1-norm) is the sum of all singular values of a matrix. It is the tightest convex relaxation of the rank function, which makes it extremely important in optimization. Minimizing the rank of a matrix subject to constraints is NP-hard in general, but minimizing the nuclear norm is a convex optimization problem that can be solved efficiently. This property is the foundation of matrix completion algorithms used in recommender systems (like Netflix prize), compressed sensing, and robust PCA. The nuclear norm penalizes matrices with many nonzero singular values, encouraging low-rank solutions. It plays a role analogous to the L1 norm in sparse vector recovery.
How are singular values different from eigenvalues of a matrix?
Singular values and eigenvalues are related but fundamentally different concepts. Eigenvalues are defined only for square matrices and can be complex numbers (positive, negative, or imaginary). Singular values are defined for any matrix (including non-square) and are always real and non-negative. For a symmetric positive definite matrix, the singular values equal the eigenvalues. For a general square matrix, the singular values are the square roots of the eigenvalues of A-transpose A, not the eigenvalues of A itself. Eigenvalues capture the scaling along eigenvector directions when the transformation is applied repeatedly, while singular values capture the maximum and minimum stretching of the transformation. Both provide complementary views of the transformation properties of a matrix.
References
Reviewed for accuracy by Manoj Kumar, Mathematics Educator · Editorial policy
Related Calculators
🧮Annulus Area Calculator
Calculate annulus area with inputs, formulas, and instant results.
🧮Area Calculator
Calculate area with inputs, formulas, and instant results.
🧮Area of a Rectangle Calculator
Calculate the area, perimeter, and diagonal of a rectangle. Find missing sides from known area. Convert between metric and imperial area units.
🧮Area of Crescent Calculator
Calculate area of crescent with inputs, formulas, and instant results.
🧮Center of Mass Calculator
Calculate center of mass with inputs, formulas, and instant results.
🧮Centroid Calculator
Calculate centroid with inputs, formulas, and instant results.
🧮Chord Length Calculator
Calculate chord length with inputs, formulas, and instant results.
🧮Conic Sections Calculator
Calculate conic sections with inputs, formulas, and instant results.