L2-L2-gain bounds for quadratic output systems

summary

The gist

L2-L2-gain bounds for quadratic output systems derive an explicit bound for the L2-L2 gain of linear time-invariant systems whose output is a quadratic function of the state and the input.

In short

This work derives explicit L2-L2 gain bounds for Linear Time-Invariant systems with quadratic outputs (LQO systems). It provides a practical tool to assess and reduce these complex models. The method uses frequency domain representations, specific inner products solvable via Lyapunov and Sylvester equations, and relates the gain to H$ ext{_ ext{inf}}$ norms of linear parts.

Key concepts

L2-L2-gain
This measures the worst-case amplification of an LTI system's output energy relative to its input energy over all time. A lower L2-L2 gain indicates a more stable and less noisy system when dealing with signals in the L2 space, which is crucial for control applications.
LQO systems
These are Linear Time-Invariant systems where the output signal is not just a linear function of the state but involves quadratic terms (e.g., $y(t) = M(x(t) imes x(t))$). They arise in various fields like optimal control and port-Hamiltonian systems.
Inner Product for Computability
To find a usable error measure between two LQO systems, the paper introduces a specific inner product. This allows the complex output error to be calculated by solving a set of Lyapunov and Sylvester matrix equations instead of needing difficult numerical integration over frequency.

Terminology used across episodes

This episode discusses

The paper

L2-L2-gain bounds for quadratic output systems · Read on arXiv

Birgit Hillebrecht

Karlsruhe Institute of Technology

We derive an explicit bound for the L2-L2-gain of linear time-invariant systems whose output is a quadratic function of the state and the input. Such systems appear naturally in many areas, for example for port-Hamiltonian systems, optimal-control, and stochastic problems. In case the output is purely quadratic in the state, the bound is determined by the supremum over ω in R of the L2-norms of the bivariate transfer function restricted to the anti-diagonals (s,, iω-s) s in i R of the frequency domain i R times i R. Further, we show how the bound can be computed by solving linear matrix equations. This result provides a practical tool for assessing and reducing quadratic-output models.

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "L2-L2-gain bounds for quadratic output systems".

Emmy: Here's the gist of the paper. L2-L2-gain bounds for quadratic output systems derive an explicit bound for the L2-L2 gain of linear time-invariant systems whose output is a quadratic function of the state and the input.

Ada: This result provides a practical tool for assessing and reducing quadratic-output models.

Emmy: System Formulation and Motivation The paper investigates linear time-invariant systems with quadratic outputs (LQO systems) of the form defined in equation (1.1).

Ada: These systems appear naturally in several application areas, such as port-Hamiltonian systems, optimal control, and stochastic problems.

Paper summary: Ada: To wrap up this talk on "L2-L2-gain bounds for quadratic output systems", we've covered how they tackle the challenge of finding a concrete L2-L2 gain number for systems whose outputs are quadratic functions of both the state and input.

Emmy: The authors, Birgit Hillebrecht, focus on deriving this explicit bound and showing how it can be computed using a set of Lyapunov and Sylvester matrix equations, which is a practical computational approach.

Kolya: What does this all mean for the bigger picture? It suggests that we can get a reliable way to assess how much the output will deviate from what we expect based on the input, even in these more complex quadratic settings.

Ada: The implication is that H2 oriented model reduction algorithms can be adapted for these quadratic output models to find an optimal reduced order model in terms of minimizing the L2 error of the output relative to the L2 magnitude of your input.

Emmy: And while they provide a bound, they also point out that adapting balanced truncation for this purpose is still difficult because of how complicated the inner product formulation is for finding an observability energy Gramian.

Kolya: So, in simple terms, it's about getting a computable measure of performance for these systems without having to do heavy numerical integration over the frequency axis.

Ada: That's right. The paper gives a pathway to move from abstract quadratic output models to concrete error bounds that you can actually use in design and analysis.

Conclusion: Ada: So we’re wrapping up this look at these L2-L2 gain bounds for quadratic output systems, focusing on Birgit Hillebrecht and her team.

Emmy: It’s about finding a way to get a concrete number—an explicit bound—for how well these kinds of linear time invariant systems perform in the L2 sense.

Kolya: What does that actually mean for us? Does it give us a tool we can actually use when we’re trying to design or reduce these models?

Ada: It suggests that instead of just knowing the general rules for linear systems, we now have a specific formula for quadratic output models.

Emmy: The authors show how you get this bound by looking at the system in terms of bivariate transfer functions and using some specific inner product setup.

Kolya: And that inner product thing you mentioned earlier, how do you actually compute it without having to integrate over every single frequency point? Is that a real computational win?

Ada: It is. They use a set of Lyapunov and Sylvester matrix equations, which means the computation becomes solving those matrices instead of doing messy integration.

Emmy: That structure behind the computation is interesting; it shows how geometry helps us define this error measure cleanly.

Kolya: But what about when you move to systems that have both bilinear and quadratic terms? Does this same approach still work there, or do things get much messier?

Ada: They do extend the thinking to bilinear and quadratic throughput terms, but they use Hölder’s inequality on an adaptation of a formula from earlier in the paper.

Emmy: That leads to a bound involving the H infinity norm of an LTI system that’s determined by some specific matrices A, B, R and P.

Kolya: So what's the practical implication for someone just trying to run a simulation? Does this mean faster model reduction algorithms are possible now?

Ada: The first two results point toward adapting H2 oriented model reduction algorithms from linear systems to these quadratic ones.

Emmy: The goal is finding an optimal reduced order model that minimizes the L2 error of the output relative to the L2 magnitude of your input.

Kolya: And they also mention that a balanced truncation method for this still seems elusive because defining that observability energy Gramian is super involved.

Ada: So, while we got a bound, adapting standard balanced truncation to match it isn't as straightforward as you might hope.

Emmy: It means the structure of the quadratic output adds complexity to the model reduction process itself.

Kolya: In short, they give us a concrete error measure and a way to calculate it, but it’s still more work than just plugging in some numbers.

More episodes

← Home