Singular Values Calculator
Our free fractions calculator solves singular values problems. Get worked examples, visual aids, and downloadable results.
Calculator
Adjust values & calculateFormula
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.
Last reviewed: December 2025
Worked Examples
Example 1: Singular Values of a 2x3 Matrix
Example 2: Rank-Deficient Matrix
Background & Theory
The Singular Values Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Singular Values Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
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:\nA A^T = [[17, 8], [8, 17]]\nEigenvalues: trace = 34, det = 225\nlambda = (34 +/- sqrt(1156-900))/2 = (34 +/- 16)/2\nlambda1 = 25, lambda2 = 9\nSingular 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]]\nEigenvalues: trace = 70, det = 14*56 - 28*28 = 0\nlambda1 = 70, lambda2 = 0\nSingular values: sigma1 = sqrt(70) = 8.3666, sigma2 = 0\nRank = 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.
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.
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.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy