pqSEDMD: Subspace Methods for Extended Dynamic Mode Decomposition Identification

summary

The gist

The pqSEDMD algorithm introduces an algorithm that uses subspace identification methods to identify nonlinear dynamics using the Extended Dynamic Mode Decomposition (EDMD) algorithm with a p-q-quasi…

In short

pqSEDMD combines subspace identification with Extended Dynamic Mode Decomposition (EDMD) using a p-q-quasi norm reduction on orthogonal polynomials. This method identifies nonlinear dynamics by lifting data into a function space, allowing for robust approximations in a linear space. It enhances the ability to model complex systems from noisy data and enables accurate long-term predictions.

Key concepts

Subspace Identification Methods
These methods are robust techniques used to identify linear dynamics from data by projecting Hankel matrices onto subspaces. They are effective at handling process and measurement noise, providing a stable foundation for approximating nonlinear systems.
Extended Dynamic Mode Decomposition (EDMD)
EDMD is a broader method capable of handling nonlinear systems by using observable functions. It allows for the identification of dynamics that standard linear methods cannot capture, extending the scope beyond simple linear models.
Function Space Lifting
This involves transforming raw data into a higher-dimensional function space where nonlinear dynamics can be approximated by a linear operator. This transformation is key to using subspace methods effectively for nonlinear system identification.
p-q-quasi norm reduction on an orthogonal polynomial basis
This technique uses a specific mathematical framework based on orthogonal polynomials to reduce the complexity of the analysis. It helps create a more robust approximation of nonlinear systems within the linear function space.

Terminology used across episodes

This episode discusses

The paper

pqSEDMD: Subspace Methods for Extended Dynamic Mode Decomposition Identification · Read on arXiv

Camilo Garcia-Tenorio, Alan Vande Wouwer

Electrical Power Engineering Unit, University of Mons · Systems, Estimation, Control and Optimization, University of Mons

The dynamic mode decomposition (DMD), along with its variant for nonlinear systems, the extended DMD (EDMD), are powerful tools for the extraction of meaningful spatio-temporal characteristics of (non)linear dynamical systems from measurement data. Despite some efforts to handle the identification task when dealing with real-world data, the decomposition based methods face a critical challenge: real-world data has two inherent sources of uncertainty, the process and measurement noise. Subspace identification methods, are robust tools able to provide accurate state-space models for multi-variable linear systems directly from input-output data. Combining these two methods, we introduce the p-q quasi-norm Subspace Extended Dynamic Mode Decomposition (pqSEDMD). An algorithm that uses our previous improvements to the EDMD by the use of a p-q-quasi-norm reduction on an orthogonal polynomial basis, the pqEDMD algorithm, along with subspace identification methods. The result is a robust approximation of nonlinear systems in a linear function space, combining the strengths of the two methodologies. Throughout the paper we will use the Duffing oscillator as a benchmark problem to show the effectiveness of the algorithm and illustrate many important aspects related to the development.

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: "pqSEDMD: Subspace Methods for Extended Dynamic Mode Decomposition Identification".

Title and authors: Ada: So we're looking at this paper today called "pqSEDMD: Subspace Methods for Extended Dynamic Mode Decomposition Identification". It looks like they're trying to mix two different ideas for finding nonlinear dynamics, which are subspace identification methods and extended DMD.

Emmy: That's right. They call it pqSEDMD because it combines the strengths of these two approaches, trying to get a more stable way to approximate nonlinear systems in a linear function space than what we have now.

Kolya: So how does this actually help us when we're dealing with real data? Is it just about making the math look prettier, or does it really handle that noise we always see?

Ada: It's definitely about handling that noise more robustly. The paper introduces a p-q quasi-norm reduction on an orthogonal polynomial basis to do this, which lets them identify nonlinear dynamics using the extended DMD algorithm within this lifted function space.

Emmy: That lifting of the data into that function space is key because it allows them to treat the nonlinear dynamics as if they were linear ones, which subspace methods are really good at doing.

Kolya: So what does that mean for the practical application? Does it just give us a better fit to our data, or does it open up a new way to look at these kinds of systems?

Ada: It increases the set of nonlinear dynamical systems that you can actually identify just by looking at your data, which is pretty significant. They're aiming for better identification with less training data.

Emmy: And they also boost the numerical stability of the extended DMD methods themselves and how those methods approximate what we call the Koopman operator, which is a big deal in this field.

Kolya: That sounds promising, but I always wonder about the practical limits. What are these conditions they set up to make sure this whole lifting process actually works without breaking?

Ada: They lay out three necessary conditions for deterministic lifted subspace identification of autonomous systems to guarantee that the column spaces end up being equal. First, they need the number of Hankel blocks to be greater than the dimension of the function space of the state.

Emmy: And second, they have a condition where the number of columns in each Hankel matrix is greater than some quantity related to those blocks. That's about ensuring enough data points are involved for each mode you're trying to find.

Kolya: And third, they need the sequences of lifted states to have full row rank equal to that dimension of the function space. What does that condition tell us about the quality of our input signals?

Title and authors: Ada: Lemma seven talks about this, and if you have a controllable lifted system and your inputs are persistently exciting enough, then the rank of those lifted state sequences will be equal to that dimension plus something related to the number of blocks.

Emmy: So it's basically saying that if we feed the system enough different kinds of input data, we can guarantee that our identification is accurate for those systems. That moves us toward a more reliable way to model things than just relying on one method or another.

Kolya: Okay, so the paper suggests an alternative way to handle multiple experiments by using extended observability matrices to get these lifted state sequences. How does that specifically help when we have several different runs?

Ada: They propose defining future and past lifted state sequences based on the application of some extended observability matrix to each of the output matrices. These are defined as the sequence of future lifted states, which is calculated using some function phi applied to the initial state.

Emmy: And then they have a corresponding past lifted state sequence, which involves applying that same function to zero and some input data up to a certain point. It's like they’re creating two linked sequences for each experiment.

Kolya: So this leads into their prediction part, right? If you only have one initial output measurement, how do we actually get a long-term prediction from this setup?

Ada: If you only have the initial output measurement, the mapping from that to the initial condition of the lifted state is defined by some equation involving a matrix C and S and then psi applied to the measured output.

Emmy: And then they evolve that lifted state one step ahead using a specific transition mapping, which is related to something called function phi. It's like propagating the state forward based on what we know about the system.

Kolya: Then they project that evolved state back down to the original output space using another mapping and recover the output. That whole loop has to repeat for every single step you want a long-term prediction.

Ada: Exactly, it’s a step by step procedure: lift the initial output, map it to the lifted state, evolve one step forward, project back to the original output space, and then repeat that process for as many steps as you need.

Title and authors: Emmy: It's a way of ensuring that even though they only have an approximation for a finite horizon because of using finite observables, they can correct the lifted output at every single step to keep it accurate over time.

Kolya: So what's the big picture here for someone who just wants to use this? Is it going to be plug-and-play for any nonlinear system we encounter?

Ada: The paper suggests that by combining these subspace methods with the extended DMD algorithm using a p-q quasi-norm reduction on an orthogonal polynomial basis, you get a computational stable way to model nonlinear systems from data.

Emmy: The main implication is that this pqSEDMD method provides robust approximations of nonlinear systems in a linear function space, which significantly increases the numerical robustness of extended DMD methods and their approximations of the Koopman operator.

Kolya: It sounds like it’s a solid tool for complex systems where noise and nonlinearity are both present, but I always wonder about its limitations with respect to system complexity. Where does it start failing?

Ada: The paper mentions that because neither standard extended DMD nor this subspace extension spans an invariant subspace of the dynamical system, they don't actually span the Koopman operator in general. So their approximations are only valid for a finite horizon because of that constraint.

Emmy: That means for truly long term predictions, you have to use that specific prediction procedure we just talked about—lifting, mapping to state, evolving one step at a time, projecting back down—and doing it repeatedly.

Kolya: So the main thing is that it makes the identification process more stable and capable of handling noise better than before, but it still has that finite horizon problem for prediction without constant correction. That’s a real caveat.

Ada: Exactly. The pqSEDMD algorithm combines these advantages in a computationally stable algorithm for data-driven modeling of dynamical systems, offering a way to get reliable results when you're dealing with noisy and limited data.

Emmy: It's about getting that robust approximation of nonlinear dynamics into a linear function space so we can use the strengths of subspace methods without losing the nonlinearity.

Kolya: So yeah, it’s a lot of machinery, but it seems like they’ve built a method that handles uncertainty and nonlinearity in a way that’s computationally stable for data-driven modeling.

Ada: It certainly seems like they've put together something solid here to make those complex systems more tractable through these subspace methods.

Emmy: And it opens up new avenues for how we can use these tools to study things that are inherently nonlinear but might be noisy in the real world.

The paper's summary: Ada: So, we’re looking at how this pqSEDMD algorithm combines subspace methods with extended DMD to find nonlinear dynamics in a linear function space for better data handling and longer predictions.

Emmy: It basically takes the strengths of both worlds. Subspace methods are good at handling noise and finding linear patterns, while extended DMD lets you look at nonlinear systems through observables.

Ada: Exactly. The core idea is lifting the data into this higher-dimensional function space so that we can identify those nonlinear dynamics using a linear operator. That’s the central trick here.

Emmy: And they use something called a p-q quasi norm reduction on an orthogonal polynomial basis to make sure this approximation of the nonlinear system is really robust and stable.

Ada: It means when you’re dealing with noisy, limited data, this method gives you a much more reliable way to approximate what the system is doing. The results show it increases the set of nonlinear systems that can be identified just from data.

Emmy: And it improves how well extended DMD approximates the Koopman operator, which is that bridge between nonlinear dynamics and linear operators. That’s a big structural improvement for modeling these things.

Ada: But there are still caveats. The authors laid out some necessary conditions—like the number of Hankel blocks having to be bigger than the dimension of the state space—to make sure this identification actually works mathematically, especially for deterministic autonomous systems.

Emmy: And they address how to handle multiple experiments too. Instead of just treating each run as a separate past and future sequence, they use an extended observability matrix to define linked sequences for each experiment. That helps train the AI on multiple data points from the same system.

Ada: The prediction part is clever because it has a specific six-step procedure if you only have one initial output measurement. You lift that output, map it to the state sequence, evolve one step forward, project back to the output space, and repeat that whole loop.

Emmy: That repeated projection step is what allows them to correct the lifted output at every single time step so the long-term prediction stays accurate. It’s a continuous correction process for those finite horizon approximations they have.

Ada: So, while it’s computationally stable and handles noise better than some other methods, it still has that limitation that because the approximation isn't exactly spanning the Koopman operator, you only get accurate predictions for a finite horizon without that step-by-step correction.

Emmy: It means for really long term analysis, you have to stick to their prediction procedure. But overall, it’s a solid algorithm combining subspace identification with extended DMD for more robust nonlinear system modeling from data.

Ada: We’ll be talking about how this lifting works in more detail next.

The paper's improvements: Ada: So, we're looking at how this paper suggests improvements to the pqSEDMD algorithm itself. It’s not just about the initial setup, but about making the whole process more powerful.

Emmy: They are focusing on how to make this identification method even more flexible when dealing with different types of nonlinear systems and data structures.

Ada: The main suggestion is really about extending the applicability beyond just deterministic autonomous systems to cover a wider range of dynamics, which is a big win for real-world modeling.

Emmy: They also look at how to handle the data matrices differently so that you don't have to rely on that strict concatenation method we talked about earlier, instead carrying individual matrices and joining them when needed.

Ada: That’s important because it makes the training process much more adaptable for different experimental setups. It moves away from a single monolithic data matrix approach to something more modular.

Emmy: And they are pushing the numerical robustness even further by exploring how the p-q quasi norm reduction can be used in different ways to get better approximations of that Koopman operator. That means fewer artifacts in the final result.

Ada: It seems like they are trying to build a framework that is less dependent on having perfect, perfectly structured input data, which is where most of these identification methods struggle.

Emmy: And they also look at how to formalize the lifted state sequences even more cleanly using that extended observability matrix approach we mentioned before. It makes the connection between the output and those hidden state variables clearer.

Ada: This whole direction points toward a more generalized method for data-driven modeling, one that can handle noise and nonlinearity in a way that’s computationally stable across different system types.

Emmy: And they are setting up the groundwork for how this approach might be used to build even more complex models where you have multiple interacting subsystems.

Ada: It suggests that as we push AI into systems science, we need methods like this that don't just work for one specific type of system but can scale up.

Emmy: So what they’re hinting at is a more generalized toolbox for identifying nonlinear dynamics from data, rather than just a single algorithm with some tweaks.

Ada: We'll be diving into the practical implications of these improvements next, especially how this might affect control engineering applications.

Conclusion: Ada: So we're wrapping up this look at pqSEDMD: Subspace Methods for Extended Dynamic Mode Decomposition Identification, summarizing how this algorithm combines subspace methods with extended DMD for robust nonlinear dynamics modeling from noisy data.

Emmy: It boils down to using a p-q quasi norm reduction on an orthogonal polynomial basis to lift the data into a linear space where we can identify nonlinear systems more reliably.

Ada: The main thing is that it provides a computationally stable way to approximate those complex nonlinear systems, and it significantly boosts the numerical robustness of extended DMD methods and their approximations of the Koopman operator.

Emmy: It means we get better results when our data is messy, which is what most real-world science deals with. The authors show that they can increase the set of nonlinear dynamical systems you can identify just from your raw data.

Ada: Kolya, what’s your take on the practical application? Does this method really survive being applied to systems where you have a lot of experimental noise and limited training time?

Kolya: Well, the paper sets up some necessary conditions for deterministic autonomous systems to work, like making sure the number of Hankel blocks is bigger than the dimension of your state space. That gives us a concrete bound on what’s required for this identification to actually be possible.

Emmy: And they also showed that they can handle multiple experiments by using extended observability matrices to define linked past and future state sequences for each run, which helps when you have several data sets.

Ada: The prediction procedure is a bit of a workout, but it’s structured: lift the initial output, map it to the state sequence, evolve one step ahead using a specific transition mapping, project back to the output space, and repeat that loop for every step you want.

Kolya: That repeated projection corrects for those finite horizon approximations we discussed; it keeps the prediction accurate over time by constantly adjusting based on what it knows. The constants in their analysis seem to survive the application provided those rank conditions are met.

Emmy: It's a robust framework because it addresses both the nonlinearity and the noise through that function space lifting, which is a really elegant structural solution to the problem of modeling nonlinear dynamics linearly.

Ada: So, while there’s this finite horizon limitation for prediction without constant correction, pqSEDMD gives us a stable starting point for data-driven models of complex systems.

Kolya: It means we have a more reliable tool to use when we want to extract insights from noisy experimental data without having to clean everything up perfectly first.

Ada: Exactly. So that’s the summary of pqSEDMD: Subspace Methods for Extended Dynamic Mode Decomposition Identification, combining subspace methods with extended DMD for robust nonlinear system modeling.

Emmy: We’ll be looking at how these ideas connect to control engineering applications next.

More episodes

← Home