Compute singular values of 2×2 and 3×3 matrices. Shows σ₁, σ₂, σ₃, condition number, rank, Frobenius norm, and step-by-step eigenvalue decomposition.
The **Singular Value Decomposition (SVD) Calculator** computes the singular values of a 2×2 or 3×3 matrix, revealing the fundamental geometric properties of any linear transformation. Enter your matrix elements and instantly see all singular values σ₁ ≥ σ₂ ≥ σ₃, the condition number, rank, determinant, and multiple matrix norms.
Singular Value Decomposition is one of the most important factorizations in linear algebra. Every m×n matrix A can be decomposed as A = UΣVᵀ, where U and V are orthogonal matrices and Σ is a diagonal matrix of non-negative singular values. These singular values represent the scaling factors along the principal axes of the transformation — they tell you exactly how much a matrix stretches or compresses space in each direction.
This calculator shows the full pipeline: from your input matrix A, it computes AᵀA, finds its eigenvalues, and takes square roots to obtain the singular values. A bar chart visualization makes it easy to compare the magnitudes at a glance. The condition number κ = σ_max / σ_min indicates how sensitive the matrix is to perturbation — well-conditioned matrices have small κ, while ill-conditioned matrices have large κ.
Six presets for 2×2 matrices (identity, rotation, scaling, shear, singular, projection) and three presets for 3×3 matrices let you explore different matrix types instantly. The properties table highlights whether the matrix is full-rank, well-conditioned, and orientation-preserving, with color-coded indicators for quick assessment.
Singular Value Decomposition (SVD) Calculator helps you avoid repetitive setup mistakes when solving trigonometric and coordinate-geometry problems. Instead of recalculating conversions, signs, and edge cases by hand, you can test inputs immediately, inspect intermediate values, and confirm final answers before submitting work or using numbers in downstream calculations. It surfaces key outputs like σ₁ (largest), σ₂, σ₃ (smallest) in one pass.
Compute AᵀA, find its eigenvalues λ₁ ≥ λ₂ ≥ …, then σᵢ = √λᵢ. Condition number κ = σ_max/σ_min. Frobenius norm = √(Σ σᵢ²). Nuclear norm = Σ σᵢ. Spectral norm = σ₁. |det(A)| = Π σᵢ.
Result: σ₁ ≈ 3.162, σ₂ ≈ 1.897
Using A=[[3, 1], [0, 2]], the calculator returns σ₁ ≈ 3.162, σ₂ ≈ 1.897. This example mirrors the calculator's live computation flow and is useful for checking manual steps and unit handling.
This calculator is tailored to singular value decomposition (svd) calculator workflows, including common input modes, unit handling, and special-case behavior. It is designed for fast checking during homework, exam preparation, technical drafting, and coding tasks where trigonometric consistency matters.
Use the primary result together with supporting outputs to verify direction, magnitude, and validity. Cross-check against known identities or geometric constraints, and confirm that angle ranges, sign conventions, and domain restrictions are satisfied before using the numbers elsewhere.
A reliable way to improve is to solve once manually, then verify with the calculator and explain any mismatch. Repeat this on varied examples and edge cases. The built-in comparison tables for side-by-side validation, visual cues that make trends and quadrants easier to read help you build pattern recognition and reduce sign or conversion errors over time.
Singular values are non-negative real numbers σ₁ ≥ σ₂ ≥ … that represent the scaling factors of a matrix transformation along its principal axes. They are the square roots of the eigenvalues of AᵀA.
Eigenvalues can be negative or complex and only exist for square matrices, while singular values are always non-negative real numbers and exist for any matrix. For symmetric positive-definite matrices, eigenvalues and singular values are the same.
The condition number κ = σ_max/σ_min measures how sensitive a linear system Ax = b is to perturbations. A condition number close to 1 means well-conditioned; a large number means ill-conditioned; infinity means singular.
SVD is used in image compression, principal component analysis (PCA), least-squares fitting, matrix pseudo-inverse computation, noise reduction, recommendation systems, and determining the numerical rank of a matrix. Use this as a practical reminder before finalizing the result.
It computes the product AᵀA, finds the eigenvalues of this symmetric matrix using the characteristic polynomial (quadratic for 2×2, cubic for 3×3), then takes square roots of the eigenvalues to get singular values. Keep this note short and outcome-focused for reuse.
The Frobenius norm ‖A‖_F is the square root of the sum of all squared matrix entries. It equals √(σ₁² + σ₂² + …), providing a single scalar measure of matrix "size" that accounts for all singular values.