EIGENROOM / TOOLS

Transfer-function calculators

Type one transfer function G(s) and a gain K, then read its step response, Bode plot and margins, root locus, Nyquist plot and Routh array. The same system follows you from page to page, and the link reproduces it.

System / G(s) = N(s) / D(s)

Coefficients in descending powers (1 3 2) or an expression such as s(s+1)(s+2).

L(s) = K·G(s); the closed loop is K·G/(1 + K·G) with unity negative feedback.

G(s) =1s³ + 3s² + 2s
Poles of G(s)
−2−10
Zeros of G(s)
none
DC gain G(0)
∞
Closed-loop poles at this K (1)
−2.325−0.3376 ± 0.5623j
Stability
Closed loop stable: every pole is in the left half-plane.

Same result in code

MATLAB
% G(s) = (1) / (s^3 + 3s^2 + 2s)
G = tf([1], [1 3 2 0]);
K = 1;
L = K*G;
T = feedback(L, 1);
pole(G), zero(G)
[Gm, Pm, Wcg, Wcp] = margin(L)
step(T)
Python (python-control)
import control as ct

G = ct.tf([1], [1, 3, 2, 0])
K = 1
L = K*G
T = ct.feedback(L, 1)
print(ct.poles(G), ct.zeros(G))
print(ct.margin(L))
resp = ct.step_response(T)

MATLAB uses the Control System Toolbox; Python uses python-control 0.10 or later (pip install control).

WHAT IT COMPUTES

What this calculator computes

Every calculator works on a unity negative-feedback loop: the loop transfer function is L(s) = K·G(s) = K·N(s)/D(s), and the closed-loop poles are the roots of the characteristic polynomial D(s) + K·N(s).

Enter the numerator and denominator either as coefficient lists in descending powers of s (1 3 2 means s² + 3s + 2, as in MATLAB) or as an expression such as s(s+1)(s+2) or 10(s+2)^2.

Two calculators take their own input: the discretization calculator turns G(s) into G(z) for a sampling period, and the state-space calculator starts from A, B, C, D (or converts G(s)) to design state feedback and an observer.

READ THE RESULT

How to read the result

  • Poles and zeros of G(s) are listed first, then the closed-loop poles at the chosen K and whether the loop is stable.
  • Each calculator page adds a plot, the numbers you would read from it, and the MATLAB and Python commands that reproduce them.
METHOD

Method and conventions

  • Roots come from the eigenvalues of the balanced companion matrix, the same approach as MATLAB roots and numpy.roots, followed by Newton polishing. Coincident roots are grouped and shown with their multiplicity.
  • Everything runs in your browser. Nothing you type is sent anywhere, and no login is needed.
LIMITS

These are linear calculations for proper transfer functions up to degree 12. They do not include saturation or time delay, and only the discretization calculator includes sampling; the lectures and labs linked from each page show where those matter.