A New Math Tool Lets Engineers Tame the Chaos of Real-World Physics

0.0003 — that’s the maximum error, across all frequencies, between a 10th-order rational approximation and the true transfer function of a hyperbolic PDE modeling heat or wave propagation, according to a new method developed by Aleksandr Talitckii and Matthew M. Peet at Arizona State University (Talitckii & Peet, 2026). This tiny number isn’t just a computational win. It’s a breakthrough in our ability to model, control, and stabilize systems governed by partial differential equations (PDEs) — the mathematical language of reality. From the flutter of an aircraft wing to the spread of pollutants in groundwater, from power grid dynamics to neural signaling in the brain, PDEs describe how things change in both space and time. But unlike simpler systems, their transfer functions are irrational — infinitely complex, impossible to write down neatly. Until now, approximating them meant flying blind: engineers could simulate, but not guarantee, that their controllers wouldn’t destabilize the very systems they were meant to tame. This paper changes that. By reframing PDEs as Partial Integral Equations (PIEs) and extending Krylov subspace methods into infinite dimensions, the authors deliver not just an approximation, but a certified one — with provable error bounds in the $H_\infty$ norm, the gold standard for robust control. For the first time, we can reduce the infinite complexity of a continuous system to a finite, rational model and know, with mathematical certainty, how much we’re leaving out — and where.

The Science

At the heart of modern engineering lies the transfer function — a mathematical object that captures how a system responds to inputs across different frequencies. For systems described by ordinary differential equations (ODEs), like a spring-mass damper or an electrical circuit, transfer functions are rational: ratios of polynomials, easy to analyze, easy to control. But for systems that vary in space — like a vibrating string, a flowing fluid, or a temperature field — the governing equations are partial differential equations (PDEs). Their transfer functions are irrational, often involving transcendental functions like sines and exponentials of square roots, making them analytically intractable for anything beyond textbook cases.

The standard workaround has been discretization: chop space into a finite grid, turn the PDE into a large system of ODEs, and work with that. But this approach is fraught. Discretization can introduce spurious numerical modes, destroy physical properties like energy dissipation, and — most critically — offers no guarantees about the error between the discrete model and the true continuous system. Without such guarantees, robust control — which treats modeling error as a bounded uncertainty — is impossible.

Talitckii and Peet take a different path. They work within the Partial Integral Equation (PIE) framework, a relatively recent formalism that provides an equivalent, but algebraically more tractable, representation of many PDEs (Peet, 2021). In a PIE, the state is transformed so that the dynamics are expressed using integral operators, which are often better behaved than differential operators. The system takes the form

$${\partial }_t(\mathcal{T}\mathbf{x})(t)=\mathcal{A}\mathbf{x}(t)+\mathcal{B}u(t),y(t)=\mathcal{C}\mathbf{x}(t)+\mathcal{D}u(t),$$

where $\mathcal{T}, \mathcal{A}, \mathcal{B}, \mathcal{C}, \mathcal{D}$ are Partial Integral (PI) operators acting on a Hilbert space of functions. The transfer function is $\hat{G}(s) = \mathcal{C}(s\mathcal{T} - \mathcal{A})^{-1}\mathcal{B} + \mathcal{D}$, but directly approximating this is hard because of the inverse operator.

Their key insight is a state transformation. They pick a real number $\sigma$ such that $\mathcal{A} - \sigma\mathcal{T}$ is invertible — a condition related to the system’s well-posedness. Then, they define a new state $\mathbf{z}(t) = (\mathcal{A} - \sigma\mathcal{T})\mathbf{x}(t)$, which transforms the system into

$${\partial }_t(\mathcal{R}\mathbf{z})(t)=(I+\sigma \mathcal{R})\mathbf{z}(t)+\mathcal{B}u(t),y(t)=\hat{\mathcal{C}}\mathbf{z}(t)+\mathcal{D}u(t),$$

where $\mathcal{R} = \mathcal{T}(\mathcal{A} - \sigma\mathcal{T})^{-1}$ and $\hat{\mathcal{C}} = \mathcal{C}(\mathcal{A} - \sigma\mathcal{T})^{-1}$. This transformed system has a crucial advantage: its transfer function, $\hat{G}(s) = \hat{\mathcal{C}}((s-\sigma)\mathcal{R} - I)^{-1}\mathcal{B} + \mathcal{D}$, depends on the resolvent of the bounded operator $\mathcal{R}$. This opens the door to Krylov subspace methods.

Krylov methods are workhorses in finite-dimensional model reduction. For a system $\dot{x} = Ax + Bu$, the Krylov subspace $\mathcal{K}_r(A,B) = \text{span}{B, AB, \dots, A^{r-1}B}$ captures the directions most responsive to input. Projecting the system onto this subspace yields a small, rational approximation. But in infinite dimensions, $\mathcal{R}$ is an operator, not a matrix, and the controllability “matrix” $[\mathcal{B}, \mathcal{R}\mathcal{B}, \dots]$ has infinitely many columns. The authors overcome this by defining the Krylov subspace $\mathcal{K}_r(\mathcal{R}, \mathcal{B})$ and constructing an orthonormal basis ${\mathbf{q}i}{i=1}^r$ via an infinite-dimensional Arnoldi process. From this, they form a finite-dimensional matrix $H \in \mathbb{C}^{r \times r}$ and an embedding operator $\mathbf{V}: \mathbb{C}^r \to \mathbf{X}$, leading to the rational approximation

$${\hat{G}}_r(s)=\hat{\mathcal{C}}\mathbf{V}((s-\sigma )H-I{)}^{-1}{\mathbf{V}}^{\ast }\mathcal{B}+\mathcal{D}.$$

The method is constructive: given the PI operators, one can compute $\mathcal{R}$, build the Krylov basis, and form $\hat{G}_r(s)$ algorithmically.

What They Found

The paper’s core achievement is not just the approximation, but the error bound. Theorem 3 gives a bound on the pointwise error $|\hat{G}_r(s) - \hat{G}(s)|$ in terms of the best polynomial approximation of the function $f(z) = 1/(1 - (s-\sigma)z)$ on a set $\Sigma$, defined as the closure of the numerical range of $\mathcal{R}$:

$$\Sigma =\text{cl}\left(\{⟨\mathbf{x},\mathcal{R}\mathbf{x}{⟩}_{\mathbf{X}}\mid \Vert \mathbf{x}{\Vert }_{\mathbf{X}}=1\}\right).$$

This is a powerful result, but $\Sigma$ could be anywhere in the complex plane. The real breakthrough comes in Section V, where the authors link the system’s physical properties to the location of $\Sigma$. They show that if the operator $\mathcal{R}$ satisfies a dissipativity condition —

$$⟨\mathbf{u},\mathcal{R}\mathbf{u}⟩+⟨\mathcal{R}\mathbf{u},\mathbf{u}⟩\le -2\omega ⟨\mathcal{R}\mathbf{u},\mathcal{R}\mathbf{u}⟩$$

for some $\omega > 0$ — then $\Sigma$ is contained in a disk in the left half-plane: $|z + 1/(2\omega)| \leq 1/(2\omega)$. This geometric constraint is the key. It means that for any frequency $s$ with $\text{Re}(s) > -\omega$, the point $(s-\sigma)^{-1}$ lies outside this disk, ensuring the approximation converges. Moreover, because the disk is bounded away from the singularity of $f(z)$, the polynomial approximation error decays rapidly with $r$.

The result is a finite-frequency $H_\infty$ error bound: for all $s$ with $\text{Re}(s) > -\omega$, the approximation error is bounded by a quantity that depends on $r$ and decays to zero as $r$ increases. This $\omega$ is not arbitrary — it’s related to the exponential decay rate of the original PDE’s semigroup, meaning the bound is physically meaningful.

The paper validates this theory with four numerical examples. The most illustrative is a hyperbolic PDE (Example VII-C), which models wave-like phenomena.

shows the magnitude of the true transfer function (black) and its rational approximations for order $r=5$ (blue) and $r=10$ (red). The approximation is nearly indistinguishable from the truth, even at low order. The error (dashed lines) is small across all frequencies, peaking at just 0.0003 for $r=10$. This isn’t just good — it’s certifiably good. The bound guarantees that no matter what controller you design based on $\hat{G}_{10}(s)$, as long as it stabilizes the model and accounts for an uncertainty of size 0.0003, it will also stabilize the true PDE system.

Another example, a parabolic PDE modeling diffusion, shows similar performance. The method captures the system’s low-frequency behavior accurately and the error diminishes smoothly with frequency, exactly as the theory predicts. The authors also demonstrate that the reduced-order system is exponentially stable whenever the original PIE is, a critical property for control applications.

Why This Changes Things

The implications of this work ripple far beyond the mathematics of model reduction. It bridges a decades-long gap between the theoretical analysis of infinite-dimensional systems and the practical tools of control engineering. Until now, robust control of PDEs was like building a skyscraper with blueprints that had no error margins. You could simulate, you could test, but you couldn’t prove the structure wouldn’t sway dangerously in a storm. This method provides the error margins.

Consider aerospace engineering. The aeroelastic flutter of an aircraft wing is governed by coupled PDEs for structural deformation and fluid flow. Designing a controller to suppress flutter requires a model. With this new method, engineers could create a low-order, rational approximation of the wing’s transfer function, complete with an $H_\infty$ error bound. They could then use standard $\mu$-synthesis or $H_\infty$ control tools to design a controller that is guaranteed to stabilize the wing, even in the presence of the approximation error and other uncertainties like wind gusts or sensor noise.

In energy systems, the stability of a power grid depends on the propagation of electrical waves across transmission lines, modeled by telegrapher’s equations — a type of hyperbolic PDE. As grids incorporate more renewable sources and become more decentralized, real-time control is essential. This method could enable the creation of certified reduced-order models of grid segments, allowing for robust, distributed control that maintains stability without requiring a full, computationally prohibitive simulation of the entire network.

Even in biology, where PDEs model everything from tumor growth to neural activity, this approach could be transformative. Imagine designing a feedback-controlled drug delivery system that responds to real-time measurements of a chemical gradient in tissue. A certified model of the diffusion process would allow for a controller that is provably safe and effective, not just in simulation, but in the clinic.

The $H_\infty$ error bound is the linchpin. It allows the unmodeled dynamics — the difference between the 10th-order model and the true infinite-dimensional system — to be treated as a norm-bounded uncertainty. This fits perfectly into the framework of robust control, where tools like the small-gain theorem can guarantee stability of the closed-loop system.

illustrates this: the true PDE system $G$ is represented as the sum of a rational approximation $G_4$ and an uncertainty block $q$ with $|q| < \alpha$, where $\alpha$ is the error bound. This decomposition is now mathematically justified.

Moreover, the method preserves stability. Many model reduction techniques can produce unstable approximations of stable systems, a fatal flaw for control. Here, the authors prove that if the original PIE is exponentially stable, so is the reduced-order model. This isn’t a heuristic; it’s a theorem, derived from the dissipativity condition on $\mathcal{R}$. This means engineers can trust the dynamics of their simplified model, not just its input-output behavior.

What’s Next

This work is a major step forward, but it’s not the final word. Several challenges and opportunities lie ahead.

First, the method relies on the PIE representation, which is not yet universal. While it covers a broad class of PDEs — including parabolic, hyperbolic, and certain beam and plate equations — it doesn’t yet encompass all systems, particularly those with complex nonlinearities or moving boundaries. Extending the framework to a wider range of physical systems is a critical next step.

Second, the computation of the operator $\mathcal{R} = \mathcal{T}(\mathcal{A} - \sigma\mathcal{T})^{-1}$ requires inverting $\mathcal{A} - \sigma\mathcal{T}$. While the paper assumes this inverse exists and is bounded, computing it in practice may require its own approximation, potentially introducing additional error. Future work could focus on how to approximate this inverse within the PI operator framework, perhaps using Galerkin methods, while preserving the error bound.

Third, the current error bound is finite-frequency, valid for $\text{Re}(s) > -\omega$. A full $H_\infty$ bound, valid for all $s$ on the imaginary axis, would be even more powerful for control design. The authors note that this may require stronger assumptions or a different approach.

Finally, the computational cost of building the Krylov basis in infinite dimensions needs to be addressed. While the theory is constructive, the infinite-dimensional Arnoldi process involves inner products of function-valued vectors, which may require numerical integration or discretization in implementation. Developing efficient, stable algorithms for this step is essential for real-world adoption.

Despite these open questions, the significance is clear. Talitckii and Peet have not just created a new algorithm; they’ve forged a new link between the continuous world of physics and the discrete world of digital control. They’ve given engineers a way to simplify reality without losing rigor. In a world increasingly dependent on controlling complex, distributed systems — from smart cities to fusion reactors — that’s not just a mathematical advance. It’s a tool for building a safer, more stable future.