Iteration¶

Version: v1 · 2026-08-24 · History
Prime #: 23
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Also from: Mathematics, Engineering & Design (beyond software)
Related primes: Recursion, Feedback, Algorithm

Core Idea¶

Repeating a process to refine results.

How would you explain it like I'm…

Try Again and Improve

Imagine you're drawing a picture of a cat. You draw a rough cat, then look at it and fix the ears, then look again and fix the tail, then look again and fix the eyes. Each round you make it a little better, using what you saw last time. That do-it-again-and-improve is called iteration. You don't have to get it right the first time — each try builds on the one before.

Each Round Builds on the Last

Iteration is doing a step over and over, but each time you use what you got from the last round. It's not the same as just repeating something — the key is that the output of one round becomes part of the input to the next. Think of sharpening a pencil: each twist takes off a little more wood until the tip is good enough. Or guessing a number in a game where each guess uses the "higher" or "lower" hint from the round before. Every iteration needs four things: a step, something to carry forward, a way to know when to stop, and a sense of what counts as getting closer.

Iteration (Loop with Feedback)

Iteration is the repeated application of a process where each application uses the result of the previous one as its starting point, in order to converge on an answer, refine a candidate, or explore a space. The point isn't just that you do something many times — that would be plain repetition. The point is the loop of feedback: output from step n becomes part of the input to step n+1. Newton's method for finding square roots works this way; so do machine learning training loops, edit cycles on a draft, and engineering design revisions. Every iterative process has the same four parts: a single step, the state carried between steps, a stopping condition, and a notion of progress.

Iteration is the repeated application of a process or step, with each application building on the results of the previous one, in order to converge toward a result, refine a candidate, or explore a space. The essential commitment is not merely repetition but the use of what each iteration produces: the output of step n becomes part of the input to step n+1, and progress is measured across iterations by a stated notion of improvement, convergence, or coverage. Every iterative process specifies (1) a single iteration step — what happens in one round; (2) the state carried between iterations — what persists and is updated; (3) the stopping condition — when to halt; and (4) the notion of progress — by which iterations are judged. The structure shows up in numerical methods (Newton's method, gradient descent), in software development (iterative releases, refactoring cycles), in scientific inquiry (hypothesis-experiment-revise), in design (prototyping loops), and in evolution (variation-selection-replication). What unifies them is the feedback loop: each round's output isn't discarded, it's the substrate the next round operates on, and that's what lets the system get somewhere even when no single round could.

Broad Use¶

Common in problem-solving, simulations, and design thinking.

Clarity¶

Breaks problems into manageable cycles, enabling stepwise refinement, e.g., iterative design or testing.

Manages Complexity¶

Breaks down large problems into smaller, manageable cycles of refinement, allowing gradual progress.

Abstract Reasoning¶

Encourages process-oriented thinking, enabling gradual improvement and adaptability.

Knowledge Transfer¶

Common in software development (agile methodologies), scientific research (experimental cycles), and education (learning loops).

Example¶

A video game developer iterates on gameplay mechanics by testing, receiving feedback, and refining the design.

Relationships to Other Abstractions¶

Current abstraction Iteration Prime

Foundational — no parent edges in the catalog.

Children (37) — abstractions linked here by typed relations

Cyclic group Domain-specific is a kind of Iteration

What makes it its own entry: the domain-specific identity determined by one element generates every group element under integer powers and the asserted order and presentation agree with the generator’s period.
Gauss–Seidel Method Domain-specific is a kind of Iteration

prime:iteration is the broader abstraction this entry instantiates.
Generative design Domain-specific is a kind of Iteration

It remains its own entry because its identity is fixed by the design problem and users, parameterized representation and generator, constraints, objectives and weights, analysis or simulation models, search algorithm, iteration and human decision points, diversity and final validation.
Increment and decrement operators Domain-specific is a kind of Iteration

It remains its own entry because its identity is fixed by the language and version, operator and prefix or postfix form, operand type and mutability, evaluation order, returned value, side effect, overflow, concurrency and overloading rules.
Inner loop Domain-specific is a kind of Iteration

It remains its own entry because its identity is fixed by the nesting structure, loop variables and bounds, dependencies, execution order, early exits, mutation, iteration-count product, data-access pattern, and language or compiler semantics.

▸ Show 32 more

Iterative method Domain-specific is a kind of Iteration
What makes it its own entry: Repeated computation alone is not a convergent iterative method, and a small step or residual need not imply small solution error without conditioning assumptions.
Jacobi Method Domain-specific is a kind of Iteration
**`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.
Kaplan–Yorke map Domain-specific is a kind of Iteration
The dynamical system is defined by repeated application of one nonlinear map.
Locally Optimal Block Preconditioned Conjugate Gradient Domain-specific is a kind of Iteration
**`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.
Modular exponentiation Domain-specific is a kind of Iteration
It remains its own entry because its identity is fixed by the integer base exponent and positive modulus, residue convention, exponent sign, invertibility for negative exponents, multiplication and reduction rule, algorithm, complexity model and side-channel assumptions if cryptographic use is discussed.
Moving Particle Semi-Implicit Method Domain-specific is a kind of Iteration
**Iteration** is the strict parent by specialization.
Persistence of a number Domain-specific is a kind of Iteration
The candidate literally instantiates prime:iteration; What makes it its own entry: The number of repeated applications of a specified digit operation needed for an integer to reach a fixed point, most commonly a single digit under repeated digit sums or products.
Pressure-correction method Domain-specific is a kind of Iteration
It remains its own entry because its identity is fixed by the incompressible equations and discretization, mesh and variable arrangement, provisional momentum solve, pressure-correction equation and boundary conditions, update and relaxation rule, iteration order, convergence tolerances and conservation verification.
Service design sprint Domain-specific is a kind of Iteration
What makes it its own entry: the domain-specific identity determined by the work is time-boxed, centered on an end-to-end service experience, and culminates in a prototype or evidence-bearing test.
Standard step method Domain-specific is a kind of Iteration
What makes it its own entry: the autonomous hydraulic engineering identity defined by discharge, geometry, energy convention, friction model, flow regime and step direction remain consistent across sections.
Subdivision surface Domain-specific is a kind of Iteration
What makes it its own entry: A smooth limit surface generated by repeatedly refining a coarse polygonal control mesh with a fixed local subdivision rule.
Exponentiation Prime is a kind of Iteration
Exponentiation is a specific kind of iteration where repeated multiplication makes each round's increment proportional to the current state.
Idempotence Prime is a kind of Iteration
Idempotence is a specialization of iteration whose progress-rule collapses every repeat application to the same state as the first.
Operational Period Prime is a kind of Iteration
Operational Period is a specialization of Iteration, retaining the parent's defining structure while adding the child's specific commitments.
Action Research Domain-specific includes Iteration
Action research contains iteration because each plan-act-observe-reflect pass carries revised understanding and practical state into a subsequent pass.
Arithmetic–Geometric Mean Domain-specific presupposes Iteration
The AGM value presupposes coupled iteration.
Ducci Sequence Domain-specific includes Iteration
the same operator is repeatedly applied to its own output.
Feature-Driven Development Domain-specific presupposes Iteration
Feature-Driven Development presupposes Iteration because its method repeatedly plans, designs, inspects, builds, and integrates small client-valued features.
Iterated Prisoner's Dilemma Domain-specific includes Iteration
The game contains repeated application of the same stage interaction with prior-round output carried into the next strategy decision.
Multiplicative Digital Root Domain-specific includes Iteration
the same digit-product rule is repeatedly applied to its own output.
Design Prototyping Prime presupposes, typical Iteration
Design prototyping typically presupposes iteration because the prototype's purpose is to feed learning into successive rounds of design refinement.
Divergence-Convergence in the Design Process Prime presupposes Iteration
Divergence-convergence in the design process presupposes iteration because its expand-then-narrow phases recur cyclically with each cycle building on the previous one.
Inquiry-Change Learning Loop Prime includes Iteration
The loop contains iteration because revised practical and epistemic state is carried into a subsequent pass.
Minimum Viable Product (MVP) Prime presupposes Iteration
Minimum Viable Product presupposes Iteration: an MVP is meaningful only as the first round of a learn-and-refine cycle.
Monte Carlo Simulation Prime presupposes Iteration
Monte Carlo simulation presupposes iteration because convergence to the empirical distribution requires repeatedly drawing and aggregating samples until error shrinks sufficiently.
Pipeline Prime presupposes Iteration
A pipeline presupposes iteration because work items advance through repeated stage transitions, each consuming the previous stage's output.
Progressive Refinement from Core Model Prime presupposes Iteration
Progressive refinement from core model presupposes iteration because successive correction terms are added round by round until accuracy targets are met.
Termination Condition Prime presupposes Iteration
A halting predicate on an iterative/recursive process; it presupposes the iteration it halts (the two live at the same level but are designed separately).
Well-Foundedness (Well-Ordering) Prime presupposes Iteration
Well-Foundedness presupposes Iteration: it is the structural guarantee that iterative or recursive descent must terminate.
Delphi Method Prime is a decomposition of Iteration
The Delphi Method is Iteration specialized to anonymous expert elicitation, with each round's feedback becoming input to the next.
Hermeneutic Circle Prime is a decomposition of Iteration
The hermeneutic circle is the specific shape iteration takes when interpretation alternates between part and whole, with each pass revising both.
Refinement Prime is a decomposition of Iteration
Refinement is the specific shape iteration takes when each cycle progressively sharpens the precision, quality, or fitness of a candidate.

Not to Be Confused With¶

Iteration is not Recursion because iteration repeats a process cyclically (using loops), while recursion involves a function calling itself with modified arguments.
Iteration is not Convergence because iteration is the process of repeating steps toward a goal, while convergence describes the property that repetition approaches a limit.
Iteration is not Refinement because iteration applies the same process repeatedly, while refinement involves improving or adjusting the process itself through the steps.