Top Qs
Timeline
Chat
Perspective
Gap metric
Distance between linear operators From Wikipedia, the free encyclopedia
Remove ads
The gap metric is a mathematical concept used to quantify the distance between linear operators on a Hilbert space. It was introduced independently by Mark Krein and Mark Krasnoselsky (1947), and Béla Szőkefalvi-Nagy (1946), in their work on invertibility of differential operators.[1][2] The gap metric has since found applications in perturbation theory,[3][4] robust control,[5] and feedback system analysis.[6]
Remove ads
Definition
Summarize
Perspective
Let H₁ and H₂ be Hilbert spaces, and let P: Dₚ ⊆ H₁ → H₂ be a (possibly unbounded) linear operator with domain Dₚ. The graph of P is defined as:
Let denote the orthogonal projection from onto the graph of P. Then, for two operators P₁ and P₂, the gap metric is defined as:[3][5]
This metric takes values in [0, 1] and quantifies the angular separation between the graphs of the two operators.
When the operators are scalar multiplications on , their graphs correspond to lines in , and the gap equals the sine of the angle between them. The concept applies to subspaces in finite- and infinite-dimensional Hilbert spaces and serves as a measure of proximity between dynamical systems or operators.
Remove ads
Applications in operator theory
The gap metric is central in the perturbation theory of linear operators. Foundational work on this topic is presented in the classical treatise by Tosio Kato on the Perturbation Theory for Linear Operators (1966).[3] Extensions to broader contexts include generalizations to normed vector spaces and manifolds.[7][5][8]
Feedback control applications
Summarize
Perspective
The gap metric gained prominence in control theory through the work of George Zames and Ahmed El-Sakkary (1979), and the subsequent work by Tryphon T. Georgiou (1988), who showed that the gap metric between linear dynamical systems can be computed via -optimization.[9][10] The metric is used to quantify how much a plant (a system that is part of a control feedback loop) can deviate from a nominal model while input-output stability of the feedback loop is maintained.[5]
A useful alternative expression for the gap metric is:
where the directed gap is defined as:
The right hand side gives a time-domain interpretation of the metric as the solution to a min-max approximation problem that is structurally similar that of the Hausdorff distance.
Georgiou showed that the gap metric can be computed as the solution to the following -optimization problem:
where is an inner matrix-valued function in the Hardy space and describes the graph of the dynamical system that is viewed as an operator on .[10][11] This graph symbol corresponds to a coprime factorization of the system transfer function:
subject to the normalization condition:
- for .
Normalized coprime factorizations form the basis of the H-infinity loop-shaping method developed by Keith Glover and Duncan McFarlane (1990, 1992), which aligns with the geometric robustness approach of T.T. Georgiou and Malcolm C. Smith (1990), Buddie et al. (1993).[12][13][5][14]
Remove ads
Robust stability and the graph topology
Summarize
Perspective
The gap metric induces the graph topology, the weakest topology for which closed-loop stability is a robust property, studied by Mathukumalli Vidyasagar et al. (1982).[15] That is, if a feedback system is stable, then any sufficiently small perturbation (in gap metric) of the plant still results in a stable feedback system.
A key result obtained by Georgiou and Smith (1990) is that for a possibly infinite dimensional linear time-invariant system with matrix transfer function in feedback with a controller having transfer function , stability of the feedback loop is preserved for all perturbations satisfying:[5]
where the bound is given by:
The operator:
has a geometric significance as being the parallel projection onto the graph of P along the graph of C. This concept was extended to nonlinear systems[16] and formed the basis for a robust feedback theory for nonlinear systems developed by Georgiou and Smith.[17][6]
Remove ads
Finite-dimensional case
In , for two subspaces G₁ and G₂ of equal dimension m, represented by orthonormal basis matrices, the gap is:
If the subspaces have different dimensions, the gap metric equals 1. In this case, one of the directed gaps attains the maximum value.
Remove ads
Related metrics
See also
References
Further reading
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads