--- title: "Iterative Methods for Large Linear Systems" description: "For a large sparse system, elimination costs too much and the solution is approached instead of computed. Convergence is decided by the spectrum of the iteration, and preconditioning is the act of cha" canonical: https://lightmysky.com/learn/mathematics/iterative-methods-for-large-linear-systems-mt_FKkxKYVGYJ source: https://lightmysky.com/learn/mathematics/iterative-methods-for-large-linear-systems-mt_FKkxKYVGYJ.md retrieved: 2026-09-12 --- > **Agent view.** This is the Markdown twin of the page, for tools and assistants. > When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md > API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md > Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt > Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json > Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`. # Iterative Methods for Large Linear Systems For a large sparse system, elimination costs too much and the solution is approached instead of computed. Convergence is decided by the spectrum of the iteration, and preconditioning is the act of changing that spectrum. Subject: Mathematics · Area: Linear Algebra · Ages 23 to 24 Page: https://lightmysky.com/learn/mathematics/iterative-methods-for-large-linear-systems-mt_FKkxKYVGYJ ## Ready when they can - Run one step of a splitting method and state its convergence condition - Say why the conjugate gradient method needs a symmetric positive definite matrix - Explain what a preconditioner changes and why that helps ## Lesson: Solving big systems by approaching For a large sparse system, elimination costs too much, so you approach the solution with a splitting method. Jacobi reuses only old values: solve each equation for its own variable, then plug in the previous guess. For 5x plus y = 11 with x plus 4y = 9, start from (0, 0): x1 is 11 over 5, which is 2.2, and y1 is 9 over 4, which is 2.25. **Example.** Keep going with the same formulas. Feed y1 = 2.25 into the x formula: 11 minus 2.25 is 8.75, over 5 is 1.75, so x2 is 1.75. The system is strictly diagonally dominant, since 5 exceeds 1 and 4 exceeds 1, which guarantees Jacobi converges from any start. In general a splitting converges exactly when its iteration matrix has spectral radius below 1. Conjugate gradients are faster but pickier: they demand a symmetric positive definite matrix. Each step minimizes a quadratic energy built from the matrix, symmetry aligns that energy with the inner product used, and positive definiteness supplies one unique minimum to land on. Without both, the guarantee evaporates. **Tip.** A preconditioner does not change the solution; it changes the spectrum. By clustering the eigenvalues it makes the iteration converge far sooner. So the workflow is: skip costly elimination, pick a splitting or gradients, and precondition to reshape the spectrum. **Recap.** Split and repeat for huge sparse systems, watch the iteration spectrum for convergence, and let symmetry plus definiteness unlock gradients. ## Practice 14 questions on this page, each with its working shown. ## Needs first - [LU Factorisation, Pivoting and the Cost of a Solve](https://lightmysky.com/learn/mathematics/lu-factorisation-pivoting-and-the-cost-of-a-solve-mt_5Gg2v3Oxrr) - [Conditioning, Stability and Floating-Point Error](https://lightmysky.com/learn/mathematics/conditioning-stability-and-floating-point-error-mt_q8IoCElXIV) - [Symmetric Matrices and the Spectral Theorem](https://lightmysky.com/learn/mathematics/symmetric-matrices-and-the-spectral-theorem-mt_sdQv4m7Nbk)