Jacobi Method

Solve a linear system by isolating its diagonal and synchronously recomputing every component from the same previous iterate, with the resulting iteration matrix governing convergence.

Version

v3 · 2026-09-06 · History

Domain-specific #

2110

Origin domain

numerical linear algebra

Subdomain

stationary iterative linear solvers

Core Idea

The Jacobi method is a stationary iterative solver for a square linear system \(Ax=b\). It isolates every unknown using the diagonal coefficient in its own row, then recomputes all unknowns from one shared previous approximation. Write

\[ A=D+R, \]

where \(D=\operatorname{diag}(A)\) and \(R=A-D\). Every diagonal entry must be nonzero so that \(D^{-1}\) exists. Starting from \(x^{(0)}\), the canonical point-Jacobi sweep is

\[ x^{(k+1)}=D^{-1}\bigl(b-Rx^{(k)}\bigr), \]

or componentwise.

Scope of Application

Large sparse linear systems. Each sweep requires diagonal scaling and a sparse matrix-vector product or row traversal. The method avoids factorization storage and exposes regular component-level parallelism.

Discretized elliptic equations. Finite-difference or finite-element Poisson-like systems motivate classical analysis. Jacobi can be slow as a standalone solver because smooth error modes decay weakly as the mesh is refined, but damped Jacobi is useful as a multigrid smoother when it rapidly reduces oscillatory components that a coarse grid cannot represent.

Clarity

Jacobi clarifies an iterative solver by separating what is fixed during a sweep from what is updated between sweeps. This distinction is operational, not cosmetic. Two implementations using the same component formula can be different methods if one reads only \(x^{(k)}\) and the other consumes partial \(x^{(k+1)}\).

Manages Complexity

A direct factorization couples rows through fill, pivoting, and triangular solves. Jacobi replaces that global dependency pattern with repeated local scalar or block solves. Each row needs its diagonal, right-hand side, neighboring old values, and a place for one new value. Sparse structure remains sparse; no fill graph is created by the sweep itself.

Abstract Reasoning

Error prediction. Because \(e^{(k)}=B_J^ke^{(0)}\), an eigencomponent with eigenvalue \(\lambda\) is multiplied asymptotically by \(\lambda\) per sweep. Magnitude sets decay/growth; sign or complex phase sets alternation/rotation.

Convergence prediction. If \(\rho(B_J)<1\), every initial error decays. If \(\rho(B_J)>1\), generic starts diverge, though a specially chosen error can avoid unstable eigendirections. State the “every starting vector” quantifier.

Knowledge Transfer

The full mechanism transfers literally among sparse scientific systems: split the diagonal, preserve an old generation, compute independent next values, exchange them, inspect the residual, and continue under a convergence/stopping contract. A heat stencil, circuit network, structural discretization, and graph-Laplacian system can share this exact computation.

Block Jacobi transfers the same grammar to subdomains and variable groups. Each block owns a local solve; cross-block terms read the old global state. This makes the point method's synchronization invariant scale to parallel domain decomposition without pretending that blocks are scalar entries.

Relationships to Other Abstractions

Current abstraction Jacobi Method Domain-specific

Parents (2) — more general patterns this builds on

• Jacobi Method is a kind of Iteration Prime

  prime:iteration — proposed strict subsumption parent. Jacobi is a particular state-carrying repeated update whose child differentia are the linear system, diagonal split, synchronization rule, and spectral verdict.

• Jacobi Method presupposes Matrix Domain-specific

  domain_specific:matrix — proposed strict presupposition. The coefficient matrix, its diagonal and remainder, and the iteration matrix are indispensable; the method is not a subtype of an array.

Hierarchy paths (6) — routes to 6 parentless roots

• Jacobi Method → Iteration

Show alternative paths (5)

Neighborhood in Abstraction Space

Jacobi Method sits in a sparse region of the domain-specific corpus (76^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Gauss–Seidel Method — 0.86
• Fredholm Kernel — 0.83
• Birman–Schwinger Principle — 0.83
• Euclidean Space — 0.83
• Conjugate Gradient Method — 0.82

Computed from structural-signature embeddings · 2026-09-08