Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Loewner functions for bilinear systems (2311.06125v2)

Published 10 Nov 2023 in math.CA, cs.SY, and eess.SY

Abstract: This work brings together the moment matching approach based on Loewner functions and the classical Loewner framework based on the Loewner pencil in the case of bilinear systems. New Loewner functions are defined based on the bilinear Loewner framework, and a Loewner equivalent model is produced using these functions. This model is composed of infinite series that needs to be truncated in order to be implemented in practice. In this context, a new notion of approximate Loewner equivalence is introduced. In the end, it is shown that the moment matching procedure based on the proposed Loewner functions and the classical interpolatory bilinear Loewner framework both result in $\kappa$-Loewner equivalent models, the main difference being that the latter preserves bilinearity at the expense of a higher order.

Summary

We haven't generated a summary for this paper yet.