Singular Value Decomposition (SVD) is a way to factor a matrix into three simpler pieces that clearly show how it stretches and rotates space. For a real matrix , the SVD writes
where:
For the 2×2 case used by this calculator, you enter a matrix
The calculator then finds matrices , , and such that . This gives you both the singular values and the associated singular vectors.
In general, the singular values of are the square roots of the eigenvalues of . For a 2×2 real matrix, this can be written out explicitly. Let
Then the eigenvalues and are given by the quadratic formula applied to the characteristic polynomial. In MathML form, the basic relationship between singular values and eigenvalues is:
Here is an eigenvalue of , and the corresponding singular value is . For a 2×2 matrix, you always get up to two singular values .
Once the calculator has the singular values, it computes the right singular vectors (columns of ) from the eigenvectors of . Finally, it finds the left singular vectors (columns of ) from
with appropriate handling of any zero singular values.
Because this tool focuses on 2×2 matrices, you can imagine all of the action in the familiar 2D plane.
In this view, SVD tells you exactly how your matrix stretches and rotates the plane. Large singular values correspond to directions where vectors are strongly stretched. If the smallest singular value is close to zero, there is a direction that is almost collapsed, meaning the transformation nearly loses dimensionality.
This makes it much easier to follow the standard SVD procedure without doing all the algebra by hand, especially when numbers are not “nice”.
After you compute the SVD, focus on three main pieces of information.
The diagonal entries and of tell you how much the matrix stretches vectors along certain orthogonal directions.
The columns of are unit vectors in the output space. Each column corresponds to a principal direction of the ellipse that you get by transforming the unit circle. The first column aligns with the direction of maximum stretching; the second column is orthogonal to it.
The columns of are unit vectors in the input space. They represent the directions that, when you apply , are scaled exactly by the corresponding singular values and rotated into the directions given by .
Together, these pieces let you describe the action of in a very compact way: rotate by , stretch by , then rotate by .
Consider the simple matrix
Below is the outline of the steps the calculator conceptually follows.
The characteristic polynomial of is
Simplifying gives
Solving this quadratic equation yields two eigenvalues and . Numerically, these are approximately
Using , the singular values are approximately
For each eigenvalue, solve to find a nonzero eigenvector . Normalize each eigenvector to have length 1. These normalized eigenvectors form the columns of . The calculator performs this step symbolically or numerically so you do not have to.
For each singular value and right singular vector , compute
These vectors are then normalized as needed and collected as the columns of . The final result displayed by the calculator is the factorization , with approximate decimal entries for ease of interpretation.
The SVD is related to other common decompositions but not identical. The table below summarizes some key differences for real 2×2 matrices.
| Decomposition | Factorization form | Matrix requirements | What it reveals |
|---|---|---|---|
| Singular Value Decomposition (SVD) | Any real matrix (square or rectangular) | Stretching in orthogonal directions, rank, and conditioning; works even when is not diagonalizable. | |
| Eigenvalue decomposition | Typically requires a square matrix with a full set of eigenvectors | Eigenvalues and eigenvectors; may fail or be complex-valued even when SVD still works cleanly. | |
| QR decomposition | Any real matrix with full column rank (variants handle broader cases) | Orthogonal basis () and upper triangular factor (); used heavily in numerical algorithms. | |
| LU decomposition | Typically requires a square matrix with suitable pivoting | Efficient solving of linear systems; less direct information about geometry than SVD. |
Even though this calculator works with small 2×2 matrices, the same ideas extend to much larger systems. SVD is central in:
Studying the 2×2 case with this tool is a good way to build geometric intuition before moving on to larger matrices.