Skip to content

Locally Optimal Block Preconditioned Conjugate Gradient

Compute a few extreme eigenpairs of a large Hermitian-definite problem by repeatedly Rayleigh–Ritz optimizing a block over current Ritz vectors, preconditioned eigen-residuals, and compressed prior directions.

Version
v2 · 2026-09-06 · History
Domain-specific #
2203
Origin domain
numerical linear algebra
Subdomain
iterative eigenvalue methods
Aliases
LOBPCG

Core Idea

Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a short-recurrence iterative eigensolver for a few smallest or largest eigenpairs of a real symmetric or complex Hermitian generalized problem

\[ A X=B X\Lambda, \qquad A=A^*,\quad B=B^*>0. \]

The standard problem is the special case \(B=I\). The word definite refers to the positive-definite metric supplied by \(B\); the left operator \(A\) need not itself be positive definite merely for the generalized Hermitian problem to be well formed.

Scope of Application

LOBPCG travels literally wherever a large Hermitian-definite partial eigenproblem admits efficient block operator actions and a useful residual preconditioner. These are technical habitats inside numerical linear algebra and computational science, not metaphors.

  • Sparse PDE eigenproblems. Finite-element stiffness–mass pencils and finite-difference Laplacians ask for a few low vibration, diffusion, or wave modes. Multigrid and domain-decomposition components developed for linear systems can often be adapted as eigen-residual preconditioners.
  • Electronic-structure calculations. Large Hermitian Hamiltonians require blocks of low-energy states.

Clarity

The method becomes clearer when its four adjectives are read as a recognition test rather than promotional language. Local identifies the current short trial space. Optimal identifies a Rayleigh–Ritz min-max choice inside that space. Block identifies simultaneous invariant-subspace approximation. Preconditioned conjugate gradient identifies residual shaping plus retained prior directions. If any of those roles is missing, the method has moved to a neighbor.

Manages Complexity

LOBPCG replaces a full eigendecomposition of a large operator with repeated work on a narrow block. The expensive ambient actions—\(AX\), \(BX\), and \(TR\)—can be executed as sparse or matrix-free block operations. Global spectral selection is compressed into a dense projected problem whose order depends on \(m\), not \(n\). This is the central scale separation: large physics in the operator actions, small exact algebra in Rayleigh–Ritz.

Abstract Reasoning

Recognition diagnostic. Look for the five-step closure: current block \(X\) → Ritz values → eigen-residuals \(R\) → preconditioned corrections \(W\) → Rayleigh–Ritz on \([X,W,P]\). If the update instead solves a correction equation, grows an unrestricted basis, or attacks \(Ax=b\), route to a neighbor.

Residual diagnosis. Column \(j\) is exact exactly when \(r_j=Ax_j-\theta_jBx_j=0\). A large residual says the current pair violates the eigen-equation, but its norm should be scaled against operator and Ritz quantities before comparing differently sized problems.

Knowledge Transfer

Within numerical linear algebra, LOBPCG transfers as an instrument. A finite-element vibration pencil, graph Laplacian, Hamiltonian, or covariance operator can reuse the same literal roles: a Hermitian-definite problem, current Ritz block, residuals, preconditioner, prior directions, local Rayleigh–Ritz extraction, and residual stopping. The operator implementation changes; the method does not.

The most useful transfer is from linear-system infrastructure to the eigenproblem without confusing the two algorithms. A multigrid or domain-decomposition component can be reused as \(T\) acting on eigen-residuals.

Relationships to Other Abstractions

Local relationship map for Locally Optimal Block Preconditioned Conjugate GradientParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Locally Optimal Bloc…DOMAINPrime abstraction: Eigenvalue And Eigenvector — presupposesEigenvalue AndEigenvectorPRIMEPrime abstraction: Iteration — is a kind ofIterationPRIME

Current abstraction Locally Optimal Block Preconditioned Conjugate Gradient Domain-specific

Parents (2) — more general patterns this builds on

  • Locally Optimal Block Preconditioned Conjugate Gradient is a kind of Iteration Prime

    prime:iteration — proposed strict subsumption parent. LOBPCG carries a current block state, repeatedly applies one update closure, measures progress by residuals, and terminates under a stopping rule.

  • Locally Optimal Block Preconditioned Conjugate Gradient presupposes Eigenvalue And Eigenvector Prime

    prime:eigenvalue_and_eigenvector — proposed strict presupposition. The generalized eigen-equation, Ritz values, invariant subspace, and eigen-residual are constitutive.

Hierarchy paths (3) — routes to 3 parentless roots

  • Locally Optimal Block Preconditioned Conjugate Gradient → Iteration

Neighborhood in Abstraction Space

Locally Optimal Block Preconditioned Conjugate Gradient sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

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