Linear least squares

Approximation of an overdetermined or rank-deficient linear system by choosing parameters that minimize a quadratic residual norm.

Version

v1 · 2026-09-08 · History

Domain-specific #

5341

Origin domain

numerical linear algebra

Subdomain

numerical linear algebra

Aliases

LLS

Core Idea

Given A and b, ordinary LLS minimizes the Euclidean norm of Ax minus b, while weighted and generalized forms change the residual metric; uniqueness requires appropriate rank or regularization conditions. Orthogonal projection maps the observation vector onto the column space of the design matrix, and QR, SVD or related factorizations compute a minimizer without requiring unstable normal-equation inversion. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application

Linear least squares belongs to numerical linear algebra and is useful where the analyst can specify the typed numerical linear algebra carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the design matrix and response, dimensions and rank, residual orientation, norm or weight matrix, parameter constraints, minimizer and uniqueness convention, numerical method, conditioning, uncertainty model if statistical and diagnostics are explicit. The scope is broad within that domain but bounded by the need for the design matrix and response, dimensions and rank, residual orientation, norm or weight matrix, parameter constraints, minimizer and uniqueness convention, numerical method, conditioning, uncertainty model if statistical and diagnostics are explicit.

Clarity

The abstraction clarifies a crowded vocabulary by making the design matrix and response, dimensions and rank, residual orientation, norm or weight matrix, parameter constraints, minimizer and uniqueness convention, numerical method, conditioning, uncertainty model if statistical and diagnostics are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Linear least squares. Linear least squares compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed numerical linear algebra carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the design matrix and response, dimensions and rank, residual orientation, norm or weight matrix, parameter constraints, minimizer and uniqueness convention, numerical method, conditioning, uncertainty model if statistical and diagnostics are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of numerical linear algebra because they reuse the typed numerical linear algebra carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, Orthogonal projection maps the observation vector onto the column space of the design matrix, and QR, SVD or related factorizations compute a minimizer without requiring unstable normal-equation inversion., and type the carrier, state every parameter and convention in the definition, test that the design matrix and response, dimensions and rank, residual orientation, norm or weight matrix, parameter constraints, minimizer and uniqueness convention, numerical method, conditioning, uncertainty model if statistical and diagnostics are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Linear least squares Domain-specific

Parents (1) — more general patterns this builds on

• Linear least squares is a kind of Approximation Prime

  The proposed strict upward parent is prime:approximation.

Hierarchy path (1) — routes to 1 parentless root

• Linear least squares → Approximation → Representation → Abstraction

Neighborhood in Abstraction Space

Linear least squares sits in a crowded region of the domain-specific corpus (19^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Matrix Structure & Linear Maps (48 abstractions)

Nearest neighbors

• Crout matrix decomposition — 0.93
• Z-matrix (mathematics) — 0.92
• Linear complex structure — 0.91
• Defective matrix — 0.91
• M-matrix — 0.91

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