Closed-loop transfer function¶

Collapse a linear feedback interconnection into the net input-to-output map—typically G(s)/(1+G(s)H(s)) for negative feedback—whose denominator exposes stability, sensitivity, and loop-gain effects.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3711
Domain group: Interdisciplinary & Synthetic
Origin domain: Systems Thinking & Cybernetics
Subdomains: Control Theory, Linear Feedback Systems → Systems Thinking & Cybernetics

Core Idea¶

A closed-loop transfer function is the ratio of a selected output transform to input transform after algebraically resolving a feedback interconnection under zero initial conditions. The output feeds back through H and is added or subtracted at the summing junction. Solving the simultaneous block equations creates the characteristic denominator 1±GH, whose roots are the closed-loop poles. 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.

How would you explain it like I'm…

The Whole Loop Rule

Think of a heater with a thermometer that keeps checking the room and telling the heater to do more or less. Once that checking loop is hooked up, the whole thing acts differently than the heater alone would. The closed-loop transfer function is the math recipe that says how the whole hooked-up system answers when you ask for a new temperature.

Feedback Loop Response Formula

In a feedback system, you measure the output and send it back to compare with what you wanted, like a heater that checks the room temperature and adjusts. The forward part (G) does the work, and the return part (H) carries the measurement back, where it is added to or subtracted from the input. A closed-loop transfer function is one formula that describes how the whole looped system turns an input into an output. Because the output affects itself through the loop, you solve the equations together, and you get a bottom part that looks like 1 + GH or 1 − GH. That bottom part decides how the closed system behaves, which can be quite different from the forward part alone.

Net Feedback Transfer Function

A closed-loop transfer function is the ratio of a chosen output's Laplace (or similar) transform to an input's transform after the feedback loop has been algebraically resolved, assuming zero initial conditions. In the standard setup, a forward path G produces the output, which returns through a feedback path H to a summing junction where it is subtracted (negative feedback) or added (positive feedback). Solving the loop equations gives, for negative feedback, output/input = G/(1 + GH). The denominator 1 ± GH is the characteristic expression, and its roots are the closed-loop poles, which control stability and response; closing the loop moves these poles away from where G alone put them. Different input–output pairs, such as reference to output, disturbance to output, or noise to output, give different closed-loop transfer functions that share the same denominator.

A closed-loop transfer function is the ratio of the transform of a chosen output to the transform of a chosen input after algebraically resolving a feedback interconnection, under zero initial conditions. In the canonical single loop, the forward path G drives the output, which returns through H and is added or subtracted at the summing junction. Solving the simultaneous block equations yields a numerator set by the forward path between the chosen ports and the characteristic denominator 1 ± GH, with the sign depending on the feedback convention; for negative feedback the reference-to-output function is G/(1 + GH). The roots of 1 ± GH are the closed-loop poles, and relocating poles is precisely what feedback does. Because the denominator is shared while numerators depend on the ports, reference tracking, disturbance rejection, noise transmission, and sensitivity are distinct closed-loop functions. A valid statement must declare the ports, feedback sign, forward and return paths, zero-state convention, and a well-posed loop; otherwise it is simply the open-loop transfer function or an ill-defined expression.

Scope of Application¶

Closed-loop transfer function belongs to control theory and is useful where the analyst can specify a linear time-invariant plant or forward path G, feedback path H, summing sign, input, output, internal signals, and transform-domain assumptions, then evaluate input-output ports, feedback sign, forward and return paths, zero-state convention, loop closure, and well-posed algebra are declared and yield the stated numerator and characteristic denominator. The scope is broad within that domain but bounded by the need for input-output ports, feedback sign, forward and return paths, zero-state convention, loop closure, and well-posed algebra are declared and yield the stated numerator and characteristic denominator. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making input-output ports, feedback sign, forward and return paths, zero-state convention, loop closure, and well-posed algebra are declared and yield the stated numerator and characteristic denominator the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Closed-loop transfer function can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Closed-loop transfer function. Closed-loop transfer function 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¶

Identify the carrier. State what the elements, states, objects, or observations are: a linear time-invariant plant or forward path G, feedback path H, summing sign, input, output, internal signals, and transform-domain assumptions. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express input-output ports, feedback sign, forward and return paths, zero-state convention, loop closure, and well-posed algebra are declared and yield the stated numerator and characteristic denominator independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of control theory because they reuse a linear time-invariant plant or forward path G, feedback path H, summing sign, input, output, internal signals, and transform-domain assumptions, The output feeds back through H and is added or subtracted at the summing junction. Solving the simultaneous block equations creates the characteristic denominator 1±GH, whose roots are the closed-loop poles., and type the carrier, state every parameter and convention in the definition, test that input-output ports, feedback sign, forward and return paths, zero-state convention, loop closure, and well-posed algebra are declared and yield the stated numerator and characteristic denominator, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Closed-loop transfer function Domain-specific

Parents (1) — outgoing typed relations

Closed-loop transfer function is a kind of Feedback Prime

The function is the algebraic signature of a closed feedback interconnection.

Hierarchy path (1) — routes to 1 parentless root

Closed-loop transfer function → is a kind of Feedback

Neighborhood in Abstraction Space¶

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

Family — Nonlinear & Optimal Control Design (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25