Preprint
Article

This version is not peer-reviewed.

Anisotropy-Based Robust Performance Criteria for Linear Continuous Time Invariant Systems with Statistically Uncertain Noise

Submitted:

09 September 2026

Posted:

10 September 2026

You are already at the latest version

Abstract
This paper is concerned with robust performance analysis for continuous time invariant systems governed by linear stochastic differential equations driven by statistically uncertain Ito processes. The uncertainty is understood as the deviation of imprecisely known probability distributions of the input disturbance from those of isotropic white-noise disturbances which, up to scaling, are organized as a standard Wiener process. Using Tustin's transform with a one-parameter family of conformal maps of the unit disk in the complex plane onto the right half-plane for discrete and continuous time transfer functions, the deviation from the nominal isotropic white-noise model is quantified by the mean anisotropy for the input of a discrete-time counterpart of the original system. The parameter of this conformal correspondence specifies the time scale for filtered versions of the input and output of the system, in terms of which the worst-case root mean square gain is formulated subject to an upper constraint on the mean anisotropy. The resulting two-parameter counterpart of the anisotropy-constrained norm of the system for the continuous time case is computed in state space by using the methods of the discrete-time anisotropy-based theory of stochastic robust filtering and control, originated by the author in the mid-1990s. These results are illustrated by an application to an electric circuit with inductive coupling and statistically uncertain noise.
Keywords: 
;  ;  ;  ;  ;  ;  

1. Introduction

The idea of quantifying the “amplification” (or “attenuation”) properties of a linear operator from one normed space to another in terms of its induced norm is ubiquitous in functional analysis, matrix theory and numerical methods, to mention some of the relevant areas. Using such a norm for operators on Hilbert spaces underlies the H ∞ -control theory [20] for linear systems with square integrable inputs. When it is preferable to have low sensitivity of the output variables of the system to the input disturbances, the corresponding performance criteria are concerned with stabilizing the closed-loop system (thus making it a bounded input-output operator) and minimizing its operator norm by an appropriate choice of a controller [17]. This includes not only control settings as such, but also filtering problems, where the role of the output process is played by the state estimation error [42]. Due to submultiplicativity of the operator norm, its minimization leads not only to disturbance attenuation with respect to the input but also with respect to perturbations in the system itself. The small-gain theorem [74] models such perturbations as feedback loops with norm-bounded uncertainties and is closely related to the invertibility of a perturbed identity operator and von Neumann series in Banach algebras [18].
The Rayleigh quotient [27], whose maximization defines the induced norm of a bounded operator on a Hilbert space (or a matrix in a finite-dimensional case), reduces to a quadratic form on the unit sphere. In a generic case, its maximum over the sphere is achieved at two points, which specify the worst-case direction for the input. This direction is exceptional and is not necessarily taken by the unit vector of the normalized input disturbance. Therefore, the operator norm, as a measure of the gain, is conservative in the case when the disturbance is not targeted at specific directions. At its extreme, this suggests the averaging of the Rayleigh quotient over the uniform probability distribution on the unit sphere, which leads to an appropriately rescaled Frobenius norm of the operator. This approach is applicable only to a finite-dimensional Hilbert space, where the unit sphere has a (unique up to a multiplicative constant) finite measure which is invariant under the group of rotations (see, for example, [1,11,39] and references therein). The normalization of this hypersurface Lebesgue measure yields the uniform distribution on the sphere (while there is no uniform distribution on an infinite-dimensional sphere, which is closely related to its noncompactness).
The deviation of an arbitrary probability measure on the sphere from the uniform distribution (as a reference measure) can be quantified in terms of entropy-theoretic proximity criteria. For example, the Kullback-Leibler (KL) relative entropy [12] (with respect to the uniform distribution on the sphere) leads to the anisotropy functional [58]. If the input disturbance is random and its direction distribution is not “too far” from being uniform in the sense that its anisotropy does not exceed a given nonnegative level a, then the maximization of the averaged Rayleigh quotient over such distributions leads to the a-anisotropic norm of the matrix. This norm occupies an intermediate position between the rescaled Frobenius norm, mentioned above, and the operator norm. Moreover, the latter two norms are the extreme cases of the a-anisotropic norm at a = 0 and as a → + ∞ , respectively. The advantage of this norm is that the degree of its conservativeness is controlled by the parameter a which specifies the amount of statistical uncertainty in the direction distribution (with the uniform distribution playing the role of a “centre” of the uncertainty class). An equivalent interpretation is that a quantifies how far a hypothetical opponent can go in approximating the worst-case direction (corresponding to the largest singular value of the matrix) by an absolutely continuous probability distribution on the unit sphere. Although the anisotropy functional does not lend itself to closed-form calculation even for the direction distribution of a Gaussian random vector (except for isotropic Gaussian distributions with zero mean and scalar covariance matrices, in which case the anisotropy vanishes), its asymptotic growth rate (per time step) is computable for unboundedly growing fragments of stationary Gaussian random sequences, leading to the mean anisotropy [58].
Later, the “spherical” anisotropy functional was complemented with its more tractable counterpart [65] (on the space of inputs themselves rather than the unit sphere of their directions) in the form of the minimum relative entropy of the actual probability distribution with respect to isotropic Gaussian distributions, which coincides with a multivariable version of a power-entropy construct considered in a different context and for different purposes in [5]. Although this second anisotropy functional is an upper bound for the original one, it has the same infinite-horizon growth rate in the stationary Gaussian case mentioned above, with the resulting mean anisotropy being expressed in terms of the spectral density and the mean value of the sequence. Accordingly, the averaged Rayleigh quotient was replaced with the ratio of root-mean-square (RMS) values of the output and input.
The anisotropy functionals, anisotropy-constrained norms and anisotropy-based theory of stochastic robust control and filtering for linear systems (without internal perturbations) in infinite-horizon time-invariant and finite-horizon time-varying settings, as well as for Toeplitz operators acting on homogenous Gaussian random fields on multidimensional lattices, were originated by the author in a series of papers and research reports in the mid 1990s – early 2000s, starting from [58] (and its subsequently written conference version [47]) and including [13,59,60,61,62] whose extended account was provided in [14] and followed by [15,33,63,64,65]. Those founding works also included a set of MATLAB functions for anisotropy-based robust performance analysis and controller design reported in [13]. Being motivated as a stochastic extension of the H ∞ -control theory to statistically uncertain linear discrete-time systems, the above mentioned developments aimed to bridge the gap between the deterministic approach of H ∞ -control and the stochastic paradigm of linear quadratic Gaussian (LQG) control, which includes Kalman filtering [28] and its predecessor — the Kolmogorov-Wiener-Hopf theory of smoothing, filtering and prediction for stationary random processes [31,69]. This extension also addressed the robustness issues of the LQG approach which is oriented to an idealized scenario, when the random input disturbances have precisely known statistical characteristics and are organized as a Gaussian white-noise sequence or a standard Wiener process (from which a more complicated covariance structure can be obtained by using a shaping filter).
Not discussing here the other ways of combining the H ∞ -theory and LQG approaches (see, for example, [6]), we note that the anisotropy-based theory offers probabilistic, system theoretic and computational tools (including a homotopy method for solving specific sets of cross-coupled Riccati, Lyapunov and log-determinant matrix algebraic equations) for robust performance analysis and synthesis of controllers and filters. This approach addresses robustness with respect to spatially and temporally coloured random disturbances (in the sense of statistical correlations between the entries of a multivariable noise at the same or different moments of time) with imprecisely known statistical properties. This is achieved by quantifying the statistical uncertainty (as a deviation from the nominal Gaussian white noise model) in terms of anisotropy, so that the resulting anisotropy-constrained version of the induced operator norm describes the worst-case RMS gain of the system over this uncertainty class.
Subsequently (in the 2000s and more recently), the theory was also being developed in the form of a suboptimal guaranteed approach to systems with internal perturbations [32], towards convexification of the anisotropy-based control synthesis [40,52,53] and suboptimal observer design [54,55], control settings with nonzero-mean input disturbances [34] and multiplicative noise [35,51,73] in the system, estimation problems with sensor failures [72], roundoff noise effects in digital controllers [37], parameterization of anisotropy-based controllers [36] and their asymptotic behaviour at low mean anisotropy levels [3], as well as other developments, including an adaptation of the anisotropy-based theory to descriptor systems [2].
The discrete-time setting is essential for the anisotropy-based theory, which stems from the anisotropy functionals using finite-dimensional spheres and finite segments of random sequences. At the same time, entropy-theoretic constructs are also known for infinite-dimensional objects such as diffusion processes. For example, the relative entropy (with respect to the Wiener measure) is correctly defined for the probability distribution of a diffusion process governed by a stochastic differential equation (SDE) with a nonzero drift (satisfying Novikov’s condition [43]) and the identity diffusion matrix. This is due to Girsanov’s theorem [23], where the preservation of the diffusion matrix of the reference standard Wiener process (so that only the drift is changed) is essential for the absolute continuity of measures, which plays an important role in relative entropy formulations of statistical uncertainty for continuous time stochastic control systems driven by diffusion processes [10,56,68].
The present paper (whose brief preprint version was archived in [67]) provides one of possible ways of rigorously extending the anisotropy-based approach (which underlies stochastic minimax formulations of robust filtering and control using worst-case RMS gains under entropy-theoretic constraints in terms of anisotropy) to linear continuous time invariant (LCTI) systems driven by statistically uncertain Ito processes. To this end, we employ a parametric family of conformal maps (specified by an auxiliary time scale parameter and related to the Cayley transform [48]) between the unit disk and the right half-plane for the discrete and continuous time transfer functions, respectively. Up to a multiplicative constant, these maps are identical to Tustin’s transform [8] for converting LCTI systems to linear discrete-time invariant (LDTI) systems and the other way around. This results in a subsidiary LDTI system which lends itself to application of the anisotropy-based theory. The spectral densities of the input and output of this subsidiary system are related to those of filtered versions of the original continuous-time processes (with the time scale parameter specifying the transient time of the filter) due to the relation between the spectral density of the Ornstein-Uhlenbeck (OU) process [29] and the logarithmic derivative of the Cayley map. The conformal correspondence is closely related to the presence of a denominator (which secures integrability in the continuous time case) in the inner-outer factorizability condition for spectral densities (describing the physical realizability of such a density with the aid of a stable causal shaping filter) [21,71]. This is one of the reasons why discrete-time results (many of which rely on boundedness of the frequency range) cannot merely be adopted without due modification (in particular, without taking the above mentioned denominator into account) for the continuous-time case, where the processes may contain arbitrarily fast components accommodated by the infinite frequency range making certain integrals divergent. The conformal relation allows the RMS gain of the LCTI system output with respect to the input noise to be defined in terms of the filtered processes. The resulting continuous-time extension of the anisotropic norm is the largest value of the gain subject to an upper constraint on the mean anisotropy of the noise as an entropy-theoretic measure of its deviation from isotropic white-noise disturbances which, up to scaling, are organized as the standard Wiener process. We also discuss the probabilistic and information-theoretic aspects of the worst-case disturbance which inherits from its discrete-time counterpart the structure of an additive mixture of a state-dependent drift with an innovation martingale process.
The paper is organized as follows. Section 2 describes the class of LCTI systems under consideration governed by linear SDEs driven by random disturbances in the form of Ito processes. Section 3 specifies the class of random disturbances produced by LCTI noise shaping filters from a standard Wiener process. Section 4 describes filtered versions of the underlying processes for such a system. Section 5 defines the RMS gain of the system in terms of the filtered input and output. Section 6 calculates the RMS gain in the nominal case of isotropic white-noise disturbances. Section 7 specifies the parameter-dependent conformal correspondence to a discrete-time system with the same RMS gain. Section 8 defines a two-parameter norm of the underlying system in terms of the anisotropic norm of the effective LDTI system. Section 9 describes state-space equations for computing this continuous-time extension of the anisotropic norm along with the structure of the worst-case disturbance. Section 10 discusses the Renyi [44] and KL relative entropy rates for the worst-case noise with respect to its martingale part and links them with the temporal component of the mean anisotropy level. Section 11 provides a numerical example of computing the two-parameter continuous-time extension of the anisotropic norm for an RLC circuit with coupled inductors and statistically uncertain noise. Section 12 makes concluding remarks.

2. Linear Stochastic Systems Being Considered

Consider an LCTI system F with an input W, which represents the external noise acting on the system, and an output Z. The latter consists of variables whose small values are beneficial for the system performance. For example, Z can be formed from reference trajectory tracking errors or state estimation errors which have to be minimized in some sense. It is assumed that W and Z are Ito processes [29] (with respect to a common filtration on the underlying probability space) on the real time axis, which take values in R m and R p , respectively, and are related in a causal fashion as
Z ( t ) = ∫ − ∞ t f ( t − τ ) d W ( τ ) + f 0 W ( t ) , t ∈ R .
Here, f 0 ∈ R p × m is a static gain matrix, and f : R + → R p × m is the step response of the system as a linear input-output operator W ↦ Z , with R + : = [ 0 , + ∞ ) . In particular, if the noise W is a standard Wiener process [29] in R m , then the Ito integral in (1) is well-defined for any square integrable function f ∈ L 2 ( R + , R p × m ) . In this case, the Ito isometry yields
E | ∫ − ∞ t f ( t − τ ) d W ( τ ) | 2 = ∫ R + ∥ f ( τ ) ∥ F 2 d τ < + ∞
for any time t ∈ R , where E ( · ) is expectation, and ∥ · ∥ F is the Frobenius norm of matrices [27]. The increments of such a process W have the identity covariance operator on the Hilbert space L 2 ( R , R m ) in the sense that the bilinear form
H ( φ , ψ ) : = E ∫ R φ ( s ) T d W ( s ) ∫ R ψ ( t ) T d W ( t )
reduces to the usual inner product
H ( φ , ψ ) = ∫ R φ ( t ) T ψ ( t ) d t , φ , ψ ∈ L 2 ( R , R m ) ,
with (2) being a corollary of (4). Otherwise, that is, when W is not a standard Wiener process, its covariance structure can be more complicated, and the equalities (2), (4) are no longer valid.
If f ( τ ) is a linear combination of quasi-polynomials [19] which decay exponentially fast, as τ → + ∞ , then there exist constant matrices
A ∈ R n × n , B ∈ R n × m , C ∈ R p × n ,
with A Hurwitz, such that
f ( τ ) = C A − 1 e τ A B , τ ⩾ 0 .
Then the Ito stochastic differential of the system output process Z in (1) acquires the form
d Z ( t ) = ∫ − ∞ t f ′ ( t − τ ) d W ( τ ) d t + ( f ( 0 ) + f 0 ) d W ( t ) = C X ( t ) d t + D d W ( t ) ,
where
X ( t ) : = ∫ − ∞ t e ( t − τ ) A B d W ( τ ) ,
and
D : = f 0 + C A − 1 B
is the feedthrough ( p × m ) -matrix. The relation (7), which can also be obtained by using the integration by parts
∫ − ∞ t f ( t − τ ) d W ( τ ) = f ( 0 ) W ( t ) + ∫ − ∞ t f ′ ( t − τ ) W ( τ ) d τ ,
shows that the corresponding impulse response of the system is given by the time derivative of (6):
f ′ ( τ ) = C e τ A B , τ ⩾ 0 .
The R n -valued Ito process X in (8) is an internal state of the system F and satisfies the linear SDE
d X ( t ) = A X ( t ) d t + B d W ( t )
whose solution on a time interval [ s , + ∞ ) , with an arbitrary start time s ∈ R , is given by
X ( t ) = e ( t − s ) A X ( s ) + ∫ s t e ( t − τ ) A B d W ( τ ) , t ⩾ s .
As opposed to the finite-dimensional setting (5)–(12), the system state can, in general, be essentially infinite-dimensional, as in the case of systems with delay [30]. For example, such a system arises if the drift A X ( t ) in (11) is replaced with a linear function of the past history of the process X:
d X ( t ) = ∫ R + ϑ ( d τ ) X ( t − τ ) d t + B d W ( t ) ,
where ϑ is an R n × n -valued countably additive measure on the σ -algebra of Borel subsets of R + , and the integral is understood in the pathwise sense. The SDE (11) is a particular case of (13) with an atomic measure ϑ concentrated at the origin as ϑ ( S ) = χ S ( 0 ) A , where χ S is the indicator function of a set S. More generally, if ϑ is of bounded support, so that supp ϑ ⊂ [ 0 , r ] for some r ⩾ 0 , then the effective state of the system at time t is the past history of X over the time interval [ t − r , t ] .
Returning to the SDEs (7), (11), we note that there also are alternative ways to model the input-output operator. For example, instead of (7), the output channel can be (and often is) described by a different relation:
Z = C X .
However, in view of (11), it can also be represented in the form (7) with appropriately modified matrices as
d Z = C ˜ X d t + D d W , C ˜ : = C A , D : = C B .
Furthermore, a convenient feature of the representation (7) is that both the input W and the output Z enter the SDEs (7), (11) in a unified fashion (through their Ito increments), thus allowing such systems to be easily concatenated.

3. Random Disturbances Under Consideration

In what follows, we will be concerned with a setting where the R m -valued input W of the system F does not necessarily obey the nominal model assumption of being a standard Wiener process. Rather, W can be a more general Ito process with respect to a standard Wiener process V in R m as the primary source of randomness. Therefore, the R n -valued state X and the R p -valued output Z, which are driven by W according to the SDEs (7), (11), are also Ito processes with respect to V.
More precisely, the process W is assumed to be the output of a causal LCTI system G playing the role of a noise shaping filter with a static gain matrix g 0 ∈ R m × m and a square integrable step response g ∈ L 2 ( R + , R m × m ) :
W ( t ) = ∫ − ∞ t g ( t − τ ) d V ( τ ) + g 0 V ( t ) ,
see Figure 1.
Similarly to the system F, the filter G can also have a finite-dimensional state-space realization
d ξ = α ξ d t + β d V , d W = c ξ d t + d d V
(the time arguments are omitted for the sake of brevity), where ξ is an R ν -valued Ito process, and
α ∈ R ν × ν , β ∈ R ν × m , c ∈ R m × ν , d ∈ R m × m ,
with α Hurwitz. In this case, similarly to (6), (9), the static gain matrix and the step response in (14) are given by
g 0 = d − c α − 1 β , g ( τ ) = c α − 1 e τ α β , τ ⩾ 0 .
The presence of the drift c ξ in (15) makes the noise process W temporally “coloured”, so that its increments on disjoint time intervals acquire statistical dependence. Also, nonzero off-diagonal entries of the diffusion matrix d d T (which, in general, is nondiagonal) make the Ito increment of W spatially correlated in the sense of dependence between its components. Moreover, the combined effect of the drift and diffusion can lead to dependence between the components of W itself.
We denote the state-space realizations of the system F in (7), (11) and the noise shaping filter G in (15) as
F ↔ A B C D , G ↔ α β c d .
The resulting LCTI system F G in Figure 1 has the same output Z as the system F and is driven by the standard Wiener process V at the input of the noise shaping filter G. Its equivalent state-space realizations
F G ↔ α 0 β B c A B d D c C D d ↔ A B c B d 0 α β C D c D d
are expressed in terms of the matrices (5), (9), (16) and involve the corresponding augmented state processes
ξ X , X ξ .
If not only the system F is known precisely, but so also is the noise shaping filter G, then the coloured noise setting can be reduced to the case of the standard Wiener process V at the input by replacing F with F G and thus incorporating the dynamics of the system F and that of the external disturbance W in the augmented state space R n + ν . Therefore, the colouredness of W as such does not lead to statistical uncertainty. Actual uncertainty arises when G is known imprecisely, in which case, the augmented system F G acquires internal uncertainty.
Note that there is an important class of noise shaping filters G, which depend on the system F and do not lead to the state augmentation in F G mentioned above. More precisely, if G is organized as a “parasitic” feedback specified by matrices L ∈ R m × n and M ∈ R m × m as
d W = L X d t + M d V ,
whereby the internal state X of the system F gives rise to the drift L X in the disturbance W (see Figure 2), then substitution of (19) into (7), (11) yields
F G ↔ A + B L B M C + D L D M .
In this case, the system F and the noise shaping filter G share the common state X in R n , thus making the state-space realizations (18) nonminimal. Despite being special, the noise structure (19) is typical for the worst-case random disturbances in the framework of anisotropy-based approach to system robustness with respect to statistically uncertain noise. This is discussed in Section 8, Section 9 and related to its discrete-time counterpart [60] through the conformal correspondence described in Section 7. Also, the above example blurs the line between internal uncertainties in the system and uncertainties in the dynamics of external disturbances.
Being a Gaussian Markov process with almost surely continuous sample paths and independent stationary increments with the covariance matrix
cov ( V ( s ) − V ( t ) ) = | s − t | I m , s , t ∈ R ,
in accordance with the Ito isometry (here, I m is the identity matrix of order m), the standard Wiener process V has almost surely nowhere differentiable sample paths of unbounded variation and nonzero quadratic variation over any nondegenerate time interval [29]. Such nonsmoothness is inherited by the Ito processes Z, X, W in (7), (8), (14). Furthermore, in the case of nonzero static gain matrices f 0 , g 0 , the variances of Z, W grow unboundedly over time (despite the stability of the system F and the noise shaping filter G due to their dynamics matrices A, α being Hurwitz). We will therefore consider filtered versions of these processes.

4. Filtered Processes and Transfer Functions

As a more regular (in the sense of the variances) representation of the input and output processes V, W, Z of the system F and the noise shaping filter G in Figure 1, consider their filtered versions V T , W T , Z T governed by SDEs
d V T = − Ω V T d t + 2 Ω d V ,
d W T = − Ω W T d t + 2 Ω d W ,
d Z T = − Ω Z T d t + 2 Ω d Z .
Here, T > 0 is an auxiliary time scale parameter which gives rise to the frequency parameter
Ω : = 1 T .
With V being a standard Wiener process (to which W in (14) reduces when g = 0 , g 0 = I m ), the SDE (22) has a unique invariant measure in the form of the standard normal distribution and generates an OU process [29] in R m . The latter is a zero-mean stationary Gaussian diffusion process with the covariance function
cov ( V T ( s ) , V T ( t ) ) = e − Ω | s − t | I m , s , t ∈ R ,
so that the variance
E ( | V T ( t ) | 2 ) = m
remains constant, and T quantifies the correlation time of the process. However, since we will be concerned with the infinite-horizon asymptotic behaviour of stable systems, it is convenient to endow (22)–(24) with zero initial conditions
V T ( 0 ) = 0 , W T ( 0 ) = 0 , Z T ( 0 ) = 0 .
Then the filtered processes V T , W T , Z T are represented in terms of V, W, Z at any time t ⩾ 0 as
V T ( t ) = ∫ 0 t ϕ ( t − τ ) d V ( τ ) ,
W T ( t ) = ∫ 0 t ϕ ( t − τ ) d W ( τ ) ,
Z T ( t ) = ∫ 0 t ϕ ( t − τ ) d Z ( τ ) ,
with
ϕ ( τ ) : = 2 Ω e − Ω τ , τ ⩾ 0 ,
which makes them only asymptotically stationary in the long run. The asymptotic input-output properties of the system F, governed by (7), (11) with a Hurwitz dynamics matrix A, and those of the noise shaping filter G in (14) can be formulated in terms of the transfer functions
F ( s ) : = C ( s I n − A ) − 1 B + D
(analytic in a neighbourhood of the closed right half-plane C + : = { s ∈ C : Re s ⩾ 0 } ), and
G ( s ) : = ∫ R + e − s t g ′ ( t ) d t + d = s ∫ R + e − s t g ( t ) d t + g 0
(with a slight abuse of notation, we identify the LCTI systems under consideration with their transfer functions). Here, for simplicity, the noise shaping filter G is also assumed to be a stable system with a finite-dimensional state ξ , described by (15)–(17), so that (33) is a rational function
G ( s ) = c ( s I ν − α ) − 1 β + d ,
analytic in a neighbourhood of C + . The transfer function G factorizes the spectral density S : R → H m + for the Gaussian process W from (15) with zero-mean stationary increments as
S ( ω ) : = G ( i ω ) G ( i ω ) * , ω ∈ R ,
where H m + is the set of complex positive semi-definite Hermitian matrices of order m, and ( · ) * : = ( ( · ) ¯ ) T is the complex conjugate transpose. Their covariance structure, described by (3), is represented as
H ( φ , ψ ) = 1 2 π ∫ R φ ^ ( ω ) * S ( ω ) ψ ^ ( ω ) d ω
for any functions φ , ψ ∈ L 2 ( R , R m ) in terms of the Fourier transforms
φ ^ ( ω ) : = ∫ R e − i ω t φ ( t ) d t , ψ ^ ( ω ) : = ∫ R e − i ω t ψ ( t ) d t ,
with the nominal standard Wiener process model (4) being a particular case of (36) when S = I m .
Similarly to deterministic linear systems, the transfer functions F, G specify the linear relations
Z ^ ( s ) = F ( s ) W ^ ( s ) , W ^ ( s ) = G ( s ) V ^ ( s )
between the Laplace transforms of the input and output in the case of zero initial states X ( 0 ) = 0 and ξ ( 0 ) = 0 :
V ^ ( s ) : = ∫ R + e − s t d V ( t ) ,
W ^ ( s ) : = ∫ R + e − s t d W ( t ) ,
Z ^ ( s ) : = ∫ R + e − s t d Z ( t ) ,
where the Ito integrals are well-defined for any s ∈ C with Re s > 0 . The same relations, as in (37),
Z ^ T ( s ) = F ( s ) W ^ T ( s ) , W ^ T ( s ) = G ( s ) V ^ T ( s )
hold for the usual Laplace transforms (as opposed to the Ito incremental ones in (38)–(40))
V ^ T ( s ) : = ∫ R + e − s t V T ( t ) d t = Φ ( s ) V ^ ( s ) ,
W ^ T ( s ) : = ∫ R + e − s t W T ( t ) d t = Φ ( s ) W ^ ( s ) ,
Z ^ T ( s ) : = ∫ R + e − s t Z T ( t ) d t = Φ ( s ) Z ^ ( s )
of the filtered processes V T , W T , Z T in (28)–(30) as illustrated by Figure 3, where the transfer function
Φ ( s ) : = ∫ R + e − s t ϕ ( t ) d t = 2 Ω s + Ω = 2 T 1 + T s , Re s > − Ω ,
specifies a low-pass filter with the impulse response ϕ in (31) and the cutoff frequency Ω in (25).
Indeed, in view of (42)–(45), the relations (41) are equivalent to (37) since the scalar-valued function Φ is nonzero everywhere and commutes with any transfer matrix. In the linear time invariant setting, this commutativity is equivalent to the commutativity of the corresponding input-output operators.
Note that, although the filtered processes Z T , W T , V T are related by the same input-output operators F, G as Z, W, V, their dynamics (represented by the lower part of the diagram in Figure 3) are governed in state space by pathwise ordinary differential equations (ODEs)
X ˙ T = A X T + B W T , Z T = C X T + D W T ,
ξ ˙ T = α ξ T + β V T , W T = c ξ T + d V T ,
where ( ) ˙ is the time derivative. Accordingly, the filtered state processes X T , ξ T have almost surely continuously differentiable sample paths and are related to the original states X, ξ (see the upper part of the diagram in Figure 3) by the ODEs
X ˙ T = − Ω X T + 2 Ω X , ξ ˙ T = − Ω ξ T + 2 Ω ξ ,
where the low-pass filter Φ in the usual ODE form (instead of the incremental SDE structure) does provide a smoothing effect. These ODEs are also endowed with zero initial conditions
X T ( 0 ) = 0 , ξ T ( 0 ) = 0 .
In the nominal white noise regime, when W reproduces the standard Wiener process V, so that c = 0 , d = I m in (15), and W T = V T in accordance with the second equality in (47), the filtered system dynamics (46) are driven by the OU process V T .
The above mentioned smoothing effect manifests itself in that, upon appropriate scaling, the filtered state processes X T , ξ T asymptotically reproduce the original state processes X, ξ in the sense that
1 2 T X T ( t ) ξ T ( t ) = Ω ∫ 0 t e Ω ( τ − t ) X ( τ ) ξ ( τ ) d τ ⟶ a . s . X ( t ) ξ ( t ) , as T → 0 + ,
with Ω depending on T according to (25). Here, the almost sure convergence to X ( t ) , ξ ( t ) holds for any fixed but otherwise arbitrary t ⩾ 0 since X, ξ have almost surely continuous sample paths (which are therefore bounded on any finite time interval) and due to the weak convergence [7] of the exponential distribution with the probability density function (PDF)
Ω 2 ϕ ( τ ) = Ω e − Ω τ , τ ⩾ 0
(arising from (31)) to the atomic probability measure on Borel subsets of R + concentrated at the origin 0, as Ω → + ∞ .
Although the processes V T , W T , Z T in (22)–(24) inherit nonsmoothness of sample paths from V, W, Z, they capture (approximately) only relatively slow components of the original processes (with frequencies ≪ Ω or, equivalently, time scales ≫ T ). Since practical applications are usually concerned with the system behaviour in a bounded frequency range (specified by the cutoff frequency Ω ), we will describe the sensitivity of the system output to the input noise in terms of the filtered processes by taking advantage of the smoothing effect of their ODE dynamics (46)–(48).

5. Root-Mean-Square Gain for Filtered Processes

For a given value of the time scale parameter T > 0 , the RMS gain of the system F under consideration can be quantified in terms of the filtered input and output W T , Z T in (23), (24) by
[ ] F [ ] : = lim sup t → + ∞ ∫ 0 t E ( | Z T ( τ ) | 2 ) d τ ∫ 0 t E ( | W T ( τ ) | 2 ) d τ
(the trivial case of zero inputs is not considered). The following theorem, which is a continuous-time counterpart of [58, Lemma 2], shows that the upper limit in (51) is in fact a limit. Its formulation employs an auxiliary function
Σ ( ω ) : = | Φ ( i ω ) | 2 = 2 Ω Ω 2 + ω 2 = 2 T 1 + ( ω T ) 2 , ω ∈ R ,
which is associated with (45). The scalar function Σ specifies the spectral density Σ I m of the OU process V T in R m from (22) as the Fourier transform of the covariance function (26) in the stationary regime:
Σ ( ω ) = ∫ R e − i ω t − Ω | t | d t .
In a similar fashion, the functions Σ ( ω ) S ( ω ) and Σ ( ω ) F ( i ω ) S ( ω ) F ( i ω ) * , with ω ∈ R , describe the spectral densities of the filtered noise and output processes W T , Z T in (23), (24), respectively, where S is the spectral density (35) for the increments of the process W in the sense of (3), (36).
Theorem 1. 
Suppose the system F in (7), (11) and the noise shaping filter G in (15) are stable. Then the RMS gain (51) holds as a limit and is computed as
[ ] F [ ] = lim t → + ∞ E ( | Z T ( t ) | 2 ) lim t → + ∞ E ( | W T ( t ) | 2 ) = ∫ R Σ ( ω ) 〈 Λ ( ω ) , S ( ω ) 〉 d ω ∫ R Σ ( ω ) Tr S ( ω ) d ω .
Here, the function Σ is given by (52), 〈 · , · 〉 is the Frobenius inner product of matrices, and the spectral density S of the process W and the function Λ : R → H m + are associated with the transfer functions (32)–(34) by (35) and
Λ ( ω ) : = F ( i ω ) * F ( i ω ) , ω ∈ R .
Proof. 
In view of (15), the solution (29) of the SDE (23) with the zero initial condition from (27) takes the form
W T ( t ) = ∫ 0 t ϕ ( t − τ ) ( c ξ ( τ ) d τ + d d V ( τ ) ) = ∫ 0 t ϕ ( t − τ ) c ∫ 0 τ e ( τ − u ) α β d V ( d u ) d τ + d d V ( τ ) = ∫ 0 t h ( t − u ) d V ( u ) .
Here,
h ( τ ) : = ( ϕ * ψ ) ( τ ) = ∫ 0 τ ϕ ( τ − u ) ψ ( u ) d u = ∫ 0 τ ϕ ( τ − u ) c e u α β d u + ϕ ( τ ) d , τ ⩾ 0 ,
is the convolution of the impulse responses of the low-pass filter Φ and the noise shaping filter G, which are given by (31) and
ψ ( τ ) : = c e τ α β + d δ ( τ ) , τ ⩾ 0 ,
with δ the Dirac delta function [57]. Since V is a standard Wiener process in R m , application of the Ito isometry to (56) leads to
E ( | W T ( t ) | 2 ) = ∫ 0 t ∥ h ( u ) ∥ F 2 d u , t ⩾ 0 .
Due to the square integrability of the transfer function Φ G (which is the Laplace transform of the function h : R + → R m × m from (57)) over the imaginary axis combined with the Plancherel theorem, the function h is square integrable over R + , and (58) leads to the monotonic convergence
lim t → + ∞ E ( | W T ( t ) | 2 ) = ∫ R + ∥ h ( u ) ∥ F 2 d u = 1 2 π ∫ R | Φ ( i ω ) | 2 ∥ G ( i ω ) ∥ F 2 d ω = 1 2 π ∫ R Σ ( ω ) Tr S ( ω ) d ω
in view of (52), (35). The same limit is shared by the Cesaro means of E ( | W T ( τ ) | 2 ) as a function of τ ⩾ 0 :
lim t → + ∞ 1 t ∫ 0 t E ( | W T ( τ ) | 2 ) d τ = lim t → + ∞ E ( | W T ( t ) | 2 ) = 1 2 π ∫ R Σ ( ω ) Tr S ( ω ) d ω .
By applying a similar reasoning to the filtered system output Z T governed by (24), it follows that
lim t → + ∞ 1 t ∫ 0 t E ( | Z T ( τ ) | 2 ) d τ = lim t → + ∞ E ( | Z T ( t ) | 2 ) = 1 2 π ∫ R Σ ( ω ) ∥ F ( i ω ) G ( i ω ) ∥ F 2 d ω = 1 2 π ∫ R Σ ( ω ) Tr ( F ( i ω ) S ( ω ) F ( i ω ) * ) d ω = 1 2 π ∫ R Σ ( ω ) 〈 Λ ( ω ) , S ( ω ) 〉 d ω ,
where (55) is also used. A combination of (59), (60) implies the existence of a limit in (51) which is given by (54). □
The RMS gain [ ] F [ ] in (54) is a semi-norm of the system transfer function F in (32). It is well-defined for any bounded (and not necessarily integrable) spectral density S of the noise (the trivial case when S = 0 almost everywhere is not considered). This is secured by the presence of the integrable function Σ from (52) as a factor in the integrands. The dependence of the RMS gain on the time scale parameter T > 0 and the noise spectral density S will be indicated by the subscripts as
[ ] F [ ] = [ ] F [ ] T , S .
Note that [ ] F [ ] T , S is invariant under the scaling S ↦ κ S with an arbitrary constant κ > 0 (which cancels out in the numerator and denominator in (54)):
[ ] F [ ] T , κ S = [ ] F [ ] T , S .
Also, if the system F is isometric (that is, inner) up to a nonzero multiplicative constant, so that there exists λ > 0 such that the function (55) satisfies Λ ( ω ) = λ I m for all ω ∈ R , then the RMS gain reduces to
[ ] F [ ] T , S = ∫ R Σ ( ω ) 〈 λ I m , S ( ω ) 〉 d ω ∫ R Σ ( ω ) Tr S ( ω ) d ω = λ
and does not depend on the noise spectral density S. In what follows, such systems F will be referred to as round systems (with all the other systems being called nonround). In general, application of the inequalities
λ min ( L ) Tr M ⩽ 〈 L , M 〉 ⩽ λ max ( L ) Tr M ,
which hold for arbitrary Hermitian matrices L, M of equal dimensions with M ≽ 0 , leads to
inf ω ∈ R λ min ( Λ ( ω ) ) ⩽ [ ] F [ ] T , S ⩽ sup ω ∈ R λ max ( Λ ( ω ) ) = ∥ F ∥ ∞ .
Here, λ min ( · ) , λ max ( · ) are the smallest and largest eigenvalues of a Hermitian matrix, and ∥ · ∥ ∞ is the H ∞ -norm [20] of a transfer function, so that (62) is a particular case of (63). If the input and output dimensions of the system satisfy m > p , then the matrix Λ ( ω ) in (55) is singular (at every frequency ω ∈ R ), thus making the left-hand side of (63) vanish. For arbitrary dimensions, the RMS gain [ ] F [ ] T , S can approach any intermediate value in (63) by an appropriate choice of the spectral density S as discussed below.
Theorem 2. 
Suppose the system F in (7), (11) is stable. Then for any μ from the interval in (63), that is, satisfying
inf ω ∈ R λ min ( Λ ( ω ) ) ⩽ μ ⩽ ∥ F ∥ ∞ ,
and any ϵ > 0 , there exists a rational spectral density S (associated with a stable noise shaping filter G in (15)) such that
| [ ] F [ ] T , S − μ | < ϵ .
Proof. 
With any γ > 0 , a frequency ω 0 ∈ R and a unit vector u ∈ C m , we associate a rational spectral density S γ : R → H m + :
S γ ( ω ) : = γ π 1 γ 2 + ( ω − ω 0 ) 2 u u * + 1 γ 2 + ( ω + ω 0 ) 2 u ¯ u T ,
which satisfies ∫ R Tr S γ ( ω ) d ω = 2 . Due to the weak convergence of the Cauchy distribution with the PDF
1 π γ γ 2 + ( ω − ω 0 ) 2 , ω ∈ R ,
to the atomic probability measure concentrated at ω 0 , as γ → 0 + (and similarly for the opposite frequency − ω 0 ), the spectral density (64) is convergent in the distributional sense [57] as
lim γ → 0 + S γ ( ω ) = δ ( ω − ω 0 ) u u * + δ ( ω + ω 0 ) u ¯ u T .
Since the functions Σ , Λ in (52), (55) are bounded and continuous, then (65) implies that
lim γ → 0 + ∫ R Σ ( ω ) 〈 Λ ( ω ) , S γ ( ω ) 〉 d ω = 2 Σ ( ω 0 ) ∥ u ∥ Λ ( ω 0 ) 2 ,
lim γ → 0 + ∫ R Σ ( ω ) Tr S γ ( ω ) d ω = 2 Σ ( ω 0 ) ,
where ∥ v ∥ M : = | M v | = v * M v is a weighted Euclidean semi-norm of a complex vector v specified by an appropriately dimensioned positive semi-definite Hermitian matrix M. Here, use is also made of the assumption | u | = 1 and the property
Λ ( − ω ) = Λ ( ω ) ¯ = Λ ( ω ) T ,
whereby Λ ( − ω ) is isospectral to Λ ( ω ) , and ∥ u ¯ ∥ Λ ( − ω ) = ∥ u ∥ Λ ( ω ) . In view of (66), (67), the corresponding RMS gain in (54) satisfies
lim γ → 0 + [ ] F [ ] T , S γ = ∥ u ∥ Λ ( ω 0 ) ∈ θ ( ω 0 ) ,
where θ is an auxiliary set-valued function which maps a frequency ω ∈ R to the interval
θ ( ω ) : = λ min ( Λ ( ω ) ) , λ max ( Λ ( ω ) ) .
Any given point of θ ( ω 0 ) in (69) is achievable by an appropriate choice of a unit vector u ∈ C m since
∥ u ∥ Λ ( ω ) : u ∈ C m , | u | = 1 = θ ( ω )
for any ω ∈ R . With the endpoints of this interval being continuous even functions of ω (the continuity is inherited from Λ ), the map θ in (70) covers the interior of the interval in (63) in the sense that
inf ω ∈ R λ min ( Λ ( ω ) ) , ∥ F ∥ ∞ ⊂ ⋃ ω ∈ R θ ( ω ) .
Therefore, for any μ from the interval in (63) and any ϵ > 0 , there exists ω 0 ∈ R and a unit vector u ∈ C m such that | ∥ u ∥ Λ ( ω 0 ) − μ | < ϵ . In view of (69), the corresponding spectral density S γ in (64), associated with such ω 0 and u, delivers the RMS gain which satisfies | [ ] F [ ] T , S γ − ∥ u ∥ Λ ( ω 0 ) | < ϵ for all sufficiently small γ > 0 , and hence, | [ ] F [ ] T , S γ − μ | < 2 ϵ by the triangle inequality. □
It follows from Theorem 2 that, in the absence of specific additional constraints on the spectral density S of the noise W, the second inequality in (63) cannot be improved in the sense that
sup S [ ] F [ ] T , S = ∥ F ∥ ∞ .
Moreover, the supremum can be restricted (without affecting its value) to the class of rational spectral densities S : R → H m + . Indeed, the proof of the theorem provides a particular way to construct a maximizing sequence of rational spectral densities S γ in (64), with u being a unit eigenvector of the matrix Λ ( ω 0 ) associated with its largest eigenvalue. Such spectral densities exhibit “energy concentration” about certain frequencies and in certain directions in C m , which depend on the system F and, being exceptional in this sense, are not necessarily “targeted” by the noise W, especially when the latter, up to scaling, is not far from the isotropic standard Wiener process.

6. RMS Gain with Respect to Isotropic White-Noise Inputs

As opposed to the energy concentration used in the proof of Theorem 2, consider an isotropic white-noise case when the spectral density of the input W is a constant scalar matrix:
S ( ω ) = κ I m , ω ∈ R ,
where κ > 0 is a scalar parameter. In this case, W is a standard Wiener process up to the multiplicative constant κ (and can be obtained from V by letting g = 0 , g 0 = κ I m in (14)), so that the SDE (23) in its stationary regime makes 1 κ W T an OU process. Then, by substituting (71) into (54), the RMS gain takes the form
[ ] F [ ] T , κ I m = [ ] F [ ] T , I m = ∫ R Σ ( ω ) Tr Λ ( ω ) d ω m ∫ R Σ ( ω ) d ω = 1 2 π m ∫ R Σ ( ω ) Tr Λ ( ω ) d ω = 1 2 π m ∫ T Tr Λ Ω tan φ 2 d φ ,
since the function Σ in (52) satisfies
∫ R Σ ( ω ) d ω = 2 π ,
in accordance with the Fourier transform (53). In (72), use is also made of the frequency transformation
ω = Ω tan φ 2 , φ : = 2 arctan ( ω T ) ,
so that
∂ ω φ = 2 T 1 + ( ω T ) 2 = Σ ( ω )
(or, equivalently, Σ ( ω ) d ω = d φ ), where the new integration variable φ takes values in the interval
T : = ( − π , π ) ,
which represents the unit circle
{ e i φ : φ ∈ T } = { z ∈ C : | z | = 1 } ∖ { − 1 }
in the complex plane, punctured at − 1 . The right-hand side of (72) does not depend on κ in accordance with the scale invariance (61) and is organized as a weighted H 2 -norm [20] of the transfer function F, which involves the parameter Ω from (25).
We will now discuss the asymptotic behaviour of the RMS gain (72) as a function of T, when T → + ∞ and T → 0 + .
As T → + ∞ (so that Ω → 0 + ), the OU process W T acquires long-range correlations. In this case, the spectral density Σ in (52) converges to 2 π δ in the distributional sense. The effect of such a process on the system is, in essence, equivalent to that of a constant input. The corresponding limit
lim T → + ∞ [ ] F [ ] T , I m = lim Ω → 0 + [ ] F [ ] T , I m = 1 m Tr Λ ( 0 ) = 1 m ∥ F ( 0 ) ∥ F ,
which is obtained by applying Lebesgue’s dominated convergence theorem to the integral in the RMS gain (72), involves the static gain matrix F ( 0 ) = D − C A − 1 B of the system in view of (32).
By a similar reasoning, as the correlation time T of the OU input W T goes to zero (or, equivalently, as Ω → + ∞ ), the spectral density (52) becomes constant ( Σ ( ω ) ≈ 2 T ) over the widening frequency interval | ω | ≪ Ω , in which case, the RMS gain (72) approaches a different limit:
lim T → 0 + [ ] F [ ] T , I m = lim Ω → + ∞ [ ] F [ ] T , I m = 1 m Tr lim ω → ∞ Λ ( ω ) = 1 m ∥ D ∥ F .
The limits (77), (78) of the RMS gain (with respect to an isotropic white noise in the sense of (71)) do not reduce to the standard H 2 -norm
∥ F ∥ 2 : = 1 2 π ∫ R Tr Λ ( ω ) d ω
which is finite only when the system transfer function (32) is strictly proper, that is, if D = 0 . In the latter case, the limit in (78) vanishes, and the asymptotic behaviour of the RMS gain is described by
[ ] F [ ] T , I m = T π m ∫ R Tr Λ ( ω ) 1 + ( ω T ) 2 d ω ∼ ∥ F ∥ 2 2 T m , as T → 0 + ,
where use is made of the last equality in (52) in combination with the limit relation
lim T → 0 ∫ R Tr Λ ( ω ) 1 + ( ω T ) 2 d ω = 2 π ∥ F ∥ 2 2 ,
which follows from (79) by Lebesgue’s dominated convergence theorem since Tr Λ ( ω ) is integrable over ω ∈ R for strictly proper stable systems F.
The limits (77), (78) in the isotropic white-noise case being discussed manifest themselves when the time scale parameter T of the low-pass filtering is large, or, respectively, small, in comparison with the transient times in the system F, which can be described in terms of the set
T : = 1 | λ | : λ ∈ S ,
where S denotes the spectrum of the Hurwitz matrix A. The fulfillment of either of the relations
T ≪ min T = 1 r ( A ) , max T = r ( A − 1 ) ≪ T
(with r ( · ) the spectral radius of a square matrix) indicates whether the OU process W T is nearly white or strongly coloured for the system F, respectively. The relative simplicity of this comparison comes from the fact that the OU process has only one time scale parameter T (which specifies the characteristic width Ω of the effective frequency range for the process), whereas more complicated random inputs can have multiple time scales, similarly to the system F itself.
The behaviour of the RMS gain with respect to isotropic white-noise inputs, considered above, is qualitatively different from its discrete-time counterpart [58] despite similarities in their definitions. Indeed, in the discrete-time settings, the frequency range is finite and can be identified with the interval T in (76), whereas the continuous-time processes may contain arbitrarily fast components (with arbitrarily short time scales or, equivalently, high frequencies) and have the infinite frequency range.
On the other hand, the last representation in (72) is in terms of the H 2 -norm of a discrete-time transfer function related to (32) by a conformal correspondence. This correspondence applies not only to the isotropic white-noise case but also to a wide class of stationary Gaussian disturbances discussed below.

7. Conformal Correspondence between Continuous and Discrete Time Settings

For what follows, consider an involutive conformal map (a modified Cayley transform [48])
K ( z ) = 1 − z 1 + z
between the open unit disk and the open right half-plane in the complex plane:
K : { z ∈ C : | z | < 1 } → { s ∈ C : Re s > 0 } .
These two domains pertain to the discrete and continuous time settings, respectively. The map K is a smooth bijection of the punctured unit circle { z ∈ C : | z | = 1 } ∖ { − 1 } onto the imaginary axis:
K ( e i φ ) = e − i φ / 2 − e i φ / 2 e − i φ / 2 + e i φ / 2 = − i tan φ 2 , φ ∈ T ,
with T from (76). This property is inherited by the scaled version Ω K of the map K for any cutoff frequency Ω > 0 in (25). The resulting conformal map Ω K gives rise to a linear operator Ψ which maps the transfer functions F, G of the system and the noise shaping filter in (32)–(34) to the transfer functions
F T ( z ) : = F ( Ω K ( z ) ) ,
G T ( z ) : = G ( Ω K ( z ) ) ,
which are analytic in the open unit disk { z ∈ C : | z | < 1 } and correspond to stable LDTI systems. Up to a factor of two in Ω K , the operator Ψ is identical to Tustin’s transform [8] which converts LCTI systems to LDTI systems and vice versa. Similarly to (55), (35), we associate with F T , G T the functions Λ T , S T : T → H m + by
Λ T ( φ ) : = F T ( e i φ ) * F T ( e i φ ) = Λ − Ω tan φ 2 ,
S T ( φ ) : = G T ( e i φ ) G T ( e i φ ) * = S − Ω tan φ 2 ,
where the rightmost equalities follow from (83). The significance of these functions is clarified below by using the connection (75) between the spectral density Σ of the OU process in (52) and the logarithmic derivative
( ln K ( s ) ) ′ = 2 s 2 − 1
of the conformal map K in (81) (recall that, being an involution, K coincides with its functional inverse K − 1 ).
Theorem 3. 
Suppose the system F in (7), (11) and the noise shaping filter G in (15) are stable. Then the RMS gain (54) can be represented in terms of the functions Λ T , S T from (86), (87) as
[ ] F [ ] T , S = ∫ T 〈 Λ T ( φ ) , S T ( φ ) 〉 d φ ∫ T Tr S T ( φ ) d φ .
Proof. 
Similarly to (68), the spectral density S in (35) satisfies S ( − ω ) = S ( ω ) ¯ = S ( ω ) T , and hence, both 〈 Λ ( ω ) , S ( ω ) 〉 = 〈 Λ ( − ω ) , S ( − ω ) 〉 and Tr S ( ω ) = Tr S ( − ω ) are even functions of ω ∈ R . In combination with the frequency transformation in (74), (75), this allows the numerator and denominator in (54) to be represented as
∫ R Σ ( ω ) 〈 Λ ( ω ) , S ( ω ) 〉 d ω = ∫ R Σ ( ω ) 〈 Λ ( − ω ) , S ( − ω ) 〉 d ω = ∫ T 〈 Λ − Ω tan φ 2 , S − Ω tan φ 2 〉 d φ = ∫ T 〈 Λ T ( φ ) , S T ( φ ) 〉 d φ ,
∫ R Σ ( ω ) Tr S ( ω ) d ω = ∫ R Σ ( ω ) Tr S ( − ω ) d ω = ∫ T Tr S − Ω tan φ 2 d φ = ∫ T Tr S T ( φ ) d φ ,
where the integration variable change is used along with (86), (87). Substitution of (89), (90) into (54) establishes (88). □
Note that the function S T : T → H m + in (87) is the spectral density of an auxiliary stationary zero-mean Gaussian random sequence
ϖ : = ( ϖ k ) k ∈ Z
in R m whose elements are indexed by the set of integers Z . Their variance (which is constant in time due to stationarity) is
E ( | ϖ k | 2 ) = 1 2 π ∫ T Tr S T ( φ ) d φ = 1 2 π ∫ R Σ ( ω ) Tr S ( ω ) d ω , k ∈ Z .
The sequence ϖ is the output of an LDTI shaping filter (with the transfer function G T in (85)) driven by a Gaussian white-noise sequence
υ : = ( υ k ) k ∈ Z
which consists of mutually independent standard normal random vectors in R m , so that
E υ k = 0 , E ( υ j υ k T ) = δ j k I m , j , k ∈ Z ,
where δ j k is the Kronecker delta. At the same time, ϖ from (91) is the input to an LDTI system (with the transfer function F T in (84)) whose output is a stationary zero-mean Gaussian random sequence
ζ : = ( ζ k ) k ∈ Z
in R p . The resulting setup is shown in Figure 4.
Since the spectral density of the sequence ζ is given by F T ( e i φ ) S T ( φ ) F T ( e i φ ) * , the common variance of its elements is computed as
E ( | ζ k | 2 ) = 1 2 π ∫ T Tr ( F T ( e i φ ) S T ( φ ) F T ( e i φ ) * ) d φ = 1 2 π ∫ T 〈 Λ T ( φ ) , S T ( φ ) 〉 d φ = 1 2 π ∫ R Σ ( ω ) 〈 Λ ( ω ) , S ( ω ) 〉 d ω , k ∈ Z .
In view of (92), (96) (see also [58]), the RMS gain (88) of the system F is identical to that of its discrete-time counterpart F T specified above:
[ ] F [ ] T , S = E ( | ζ 0 | 2 ) E ( | ϖ 0 | 2 ) = [ ] F T [ ] S T ,
where, without loss of generality, the variances in the numerator and denominator are taken at the initial moment of time due to stationarity of the sequences (91), (95). Note that in the stationary case, it is redundant to consider Cesaro means of moments (such as variances) instead of their constant values. The right-hand side of (97) is the RMS gain of the discrete-time transfer function F T with respect to stationary zero-mean Gaussian random sequences ϖ with the spectral density S T . This quantity depends on the spectral density S of the continuous time process W through its discrete-time image S T in (87) and can be computed for a given S both in the continuous and discrete time domains due to the T-dependent conformal correspondence between them.
For example, if W is a standard Wiener process up to a multiplicative constant (the isotropic white-noise case (71)), then the spectral density S T in (87) is the same constant scalar matrix, and ϖ is a zero-mean Gaussian white-noise sequence with the scalar covariance matrix. In this case, (97) reproduces (72). However, the conformal correspondence applies to a broader setting of worst-case RMS gains with respect to statistically uncertain disturbances, where the uncertainty can be formulated in terms of the discrete-time counterparts of the system and the noise shaping filter.

8. Anisotropy-Constrained Statistical Uncertainty and Worst-Case RMS Gain

Suppose the input W of the system F is a statistically uncertain random disturbance, which is produced at the output of an imprecisely known noise shaping filter G in Figure 1, with the only prior information about its spectral density S being that it belongs to a given class S . Then of interest is the worst-case value
[ ] F [ ] T , S : = sup S ∈ S [ ] F [ ] T , S
of the RMS gain (97) (we have slightly abused the notation). In particular, the class S can be described in terms of the deviation of S from constant scalar matrices (which correspond to the nominal isotropic white-noise model (71)). Such deviation is quantified, for example, by the mean anisotropy [58,60] of the stationary Gaussian random sequence (91) in R m , which, in view of (86), (92), takes the form
A T ( S ) : = A ¯ ( S T ) = − 1 2 ln det m E ( | ϖ 0 | 2 ) Γ = − 1 4 π ∫ T ln det m E ( | ϖ 0 | 2 ) S T ( φ ) d φ = − 1 4 π ∫ R Σ ( ω ) ln det 2 π m ∫ R Σ ( λ ) Tr S ( λ ) d λ S ( ω ) d ω = − T 2 π ∫ R 1 1 + ( ω T ) 2 ln det π m T ∫ R Tr S ( λ ) 1 + ( λ T ) 2 d λ S ( ω ) d ω ,
where 0 ≺ Γ = Γ T ∈ R m × m is an auxiliary matrix which is discussed below along with the main properties of (99). The quantity A T ( S ) is finite and nonnegative if the spectral density S of the noise W satisfies the following inequality:
∫ T ln det S T ( φ ) d φ = 2 T ∫ R ln det S ( ω ) 1 + ( ω T ) 2 d ω > − ∞ .
Although the fulfillment of this condition does not depend on a particular choice of T > 0 , an important role for the convergence of the second integral in (100) is played by the denominator. This is explained by the fact that an arbitrary spectral density S : R → H m + and its log-determinant cannot be simultaneously integrable on the real axis in view of the relations
∫ − b b ( Tr S ( ω ) − ln det S ( ω ) ) d ω ⩾ 2 b m → + ∞ , as b → + ∞ ,
whereby ∫ R Tr S ( ω ) d ω < + ∞ implies that ∫ R ln det S ( ω ) d ω = − ∞ . The inequality (101) employs the following lower bound for the integrand:
min Q ∈ H m + ( Tr Q − ln det Q ) = m ,
where the function being minimized is strictly convex and achieves its unique minimum at Q = I m . This can be verified by using the Frechet derivatives ∂ Q Tr Q = I m and ∂ Q ln det Q = Q − 1 , with the latter assuming that Q ≻ 0 .
Since the transfer function G T in (85) belongs to the Hardy space of C m × m -valued functions, analytic in the open unit disk and having a square integrable boundary value over the unit circle, then (100) is equivalent to det G T ( φ ) ≠ 0 for almost all φ ∈ T . This full-rank condition, associated with the inner-outer factorization [71] of the spectral density S T in (87), reflects the absence of linear dependencies between the entries of the random vectors ϖ k at the same or different moments of time. Also, this property is closely related to the total unpredictability [21,46] of such random sequences in the sense of nonsingularity of the conditional covariance matrix
Γ : = cov ( ϖ k ∣ F k − 1 )
given the past history ( ϖ j ) j < k of the sequence ϖ in (91). Here, F : = ( F k ) k ∈ Z is the natural filtration for ϖ consisting of the the σ -algebras
F k : = σ { ϖ k , ϖ k − 1 , ϖ k − 2 , … } .
In the stationary Gaussian case being considered, the matrix Γ (which is used in (99)) does not depend on discrete time k and is nonrandom, whereby it coincides with the unconditional covariance matrix of the one-step prediction error ϖ ˜ k associated with the sequence ϖ by
ϖ ˜ k : = ϖ k − ϖ ^ k , ϖ ^ k : = E ( ϖ k ∣ F k − 1 ) .
The F -predictable sequence ϖ ^ : = ( ϖ ^ k ) k ∈ Z and the F -martingale difference sequence ϖ ˜ : = ( ϖ ˜ k ) k ∈ Z provide the Doob decomposition [49] for ϖ :
ϖ k = ϖ ^ k + ϖ ˜ k , k ∈ Z .
By the Szegö-Kolmogorov theorem [24,31], as discussed in the proof of [60, Lemma 1], the matrix (103) is linked to the spectral density S T of ϖ as
ln det Γ = lim N → + ∞ ln det cov ( ϖ N ) N = 1 2 π ∫ T ln det S T ( φ ) d φ ,
where
ϖ N : = ( ϖ k ) 0 ⩽ k < N
is an R m N -valued zero-mean Gaussian random vector formed from N consecutive elements ϖ 0 , … , ϖ N − 1 of the sequence ϖ in (91), whose covariance matrix is recovered from S T as
E ( ϖ j ϖ k T ) = 1 2 π ∫ T e i ( j − k ) φ S T ( φ ) d φ .
In application to the stationary zero-mean Gaussian sequence ϖ with the spectral density S T , the origin of the mean anisotropy functional (99) is clarified by the limit theorems from [58] and [65] as
lim N → + ∞ A ∘ ( ℧ N ) N = lim N → + ∞ A ( ϖ N ) N = A ¯ ( S T ) .
Here, the original “spherical” anisotropy functional from [58]
A ∘ ( ℧ N ) : = D ( Q N ∥ U m N ) = E ln q N ( ℧ N ) = ∫ S m N q N ( u ) ln q N ( u ) U m N ( d u )
is the KL relative entropy [12] of the distribution Q N of the unit random vector
℧ N : = 1 | ϖ N | ϖ N
with a PDF q N : S m N → R + with respect to the uniform distribution U m N on the unit sphere
S m N : = { u ∈ R m N : | u | = 1 } .
The other anisotropy functional, introduced subsequently in [65] (and inspired by a similar yet one-dimensional power-entropy functional from [5]), is given by
A ( ϖ N ) : = min λ > 0 D ( Π N ∥ N λ I m N ) = m N 2 ln 2 π e m N E ( | ϖ N | 2 ) − h ( ϖ N ) = − 1 2 ln det m E ( | ϖ 0 | 2 ) cov ( ϖ N ) ,
which is the minimum relative entropy of the distribution Π N of the random vector ϖ N from (107) with respect to isotropic Gaussian distributions N λ I m N in R m N with zero mean and scalar covariance matrices λ I m N . Here, h ( · ) is the differential entropy (with respect to the usual Lebesgue measure) which lends itself to closed-form computation for Gaussian random vectors, thus making the second anisotropy functional (109) more practical than its predecessor (108). Indeed,
h ( ϖ N ) : = − E ln p N ( ϖ N ) = m N 2 ln ( 2 π e ) + 1 2 ln det cov ( ϖ N ) ,
which is obtained by using the PDF p N : R m N → R + of the random vector ϖ N from (107) given by
p N ( w ) = ( 2 π ) − m N / 2 det cov ( ϖ N ) e − 1 2 ∥ w ∥ cov ( ϖ N ) − 1 2 , w ∈ R m N .
Note that (110) clarifies the entropy-theoretic meaning of (106) by its connection with the differential entropy rate
lim N → + ∞ h ( ϖ N ) N = m 2 ln ( 2 π e ) + 1 2 ln det Γ = 1 2 ln det ( 2 π e Γ )
as a particular case of the Shannon-McMillan-Breiman theorem [12] in application to the stationary Gaussian sequence ϖ .
The mean anisotropy A T ( S ) in (99) is invariant under the scaling and “rotation” transformations S ( ω ) ↦ λ U ( i ω ) S ( ω ) U ( i ω ) * for any constant λ > 0 and all-pass transfer functions U (that is, such that the matrix U ( i ω ) is unitary at all frequencies ω ∈ R ). Furthermore, A T ( S ) , which is always nonnegative, vanishes if and only if the spectral density S T of the auxiliary sequence ϖ in (91), and hence, S in view of (87), is a constant scalar matrix, which (in the Gaussian case) holds if and only if the input disturbance W is a standard Wiener process up to a multiplicative constant. The above properties are inherited by A T ( S ) from its discrete-time counterpart, and so also is the closely related decomposition
A T ( S ) = A T spat ( S ) + A T temp ( S )
of the mean anisotropy functional (99) into the “spatial” and ”temporal” components (cf. [14])
A T spat ( S ) : = − 1 2 ln det m E ( | ϖ 0 | 2 ) E ( ϖ 0 ϖ 0 T )
= − 1 2 ln det m ∫ R Tr S ( λ ) 1 + ( λ T ) 2 d λ ∫ R 1 1 + ( ω T ) 2 S ( ω ) d ω , A T temp ( S ) : = 1 2 ln det ( Γ − 1 E ( ϖ 0 ϖ 0 T ) )
= T 2 π ∫ R 1 1 + ( ω T ) 2 ln det T π S ( ω ) − 1 ∫ R 1 1 + ( λ T ) 2 S ( λ ) d λ d ω ,
which are also nonnegative. In particular, A T temp ( S ) ⩾ 0 because this quantity coincides with Shannon’s mutual information [12] between an element ϖ k of the stationary Gaussian sequence ϖ and its past history ( ϖ j ) j < k :
A T temp ( S ) = I ( ϖ k ; ( ϖ j ) j < k ) = h ( ϖ k ) − h ( ϖ k ∣ ( ϖ j ) j < k ) = lim N → + ∞ I ( ϖ 0 ; ( ϖ − j ) 1 ⩽ j ⩽ N ) ,
where h ( · ∣ · ) is the conditional differential entropy. The nonnegativeness of A T temp ( S ) can also be verified directly by using the inequality Γ ≼ E ( ϖ 0 ϖ 0 T ) for the matrix (103) in the Gaussian case or, alternatively, Jensen’s inequality in combination with the normalization property of Σ in (73) and the strict concavity of ln det ( · ) on the cone of complex positive definite Hermitian matrices (which was used in (102)). The last argument also shows that A T temp ( S ) = 0 in (113) if and only if the spectral density S is a constant positive definite matrix, that is, when the noise process W is temporally white in the sense of having independent increments.
Similarly to discrete-time settings, the properties of A T ( S ) in (99) allow it to be used as a measure of deviation from the nominal isotropic white-noise model for specifying a particular uncertainty class S in (98):
S T , a : = { S : R → H m + : A T ( S ) ⩽ a } .
This class consists of all those spectral densities S of the input disturbance process W, whose discrete-time counterparts S T in (87) satisfy the upper constraint on the mean anisotropy (99) of the corresponding stationary Gaussian sequence ϖ with the variance (92). Since the map S ↦ S T is bijective, the worst-case RMS gain (98), associated with (114), takes the form
| | | F | | | T , a : = [ ] F [ ] T , S T , a = sup S ∈ S T , a [ ] F [ ] T , S = sup S ∈ S T , a ∫ T 〈 Λ T ( φ ) , S T ( φ ) 〉 d φ ∫ T Tr S T ( φ ) d φ = | | | F T | | | a
and coincides with the a-anisotropic norm of the discrete-time system F T . The latter norm (and hence, the two-parameter ( T , a ) -anisotropic norm | | | F | | | T , a of the underlying LCTI system) lends itself to state-space computation [60].

9. Computation of Continuous-Time Anisotropic Norm in State Space

In order to compute the norm | | | F | | | T , a of the LCTI system F in state space through its discrete-time counterpart | | | F T | | | a in (115), we note that, in view of (25), (32), (81), the transfer function F T in (84) takes the form
F T ( z ) = C Ω 1 − z 1 + z I n − A − 1 B + D = ( 1 + z ) T C ( I n − T A − z ( I n + T A ) ) − 1 B + D = ( 1 + z ) C ( I n − z A T ) − 1 B T + D = z C T ( I n − z A T ) − 1 B T + D T .
This is the generating function for the impulse response with the z-transform F T ( 1 / z ) which corresponds to the LDTI system
x k + 1 = A T x k + B T ϖ k , ζ k = C T x k + D T ϖ k
with an R n -valued state sequence x : = ( x k ) k ∈ Z and the state-space realization matrices
A T : = ( I n + T A ) ( I n − T A ) − 1 = K ( − T A ) ,
B T : = T ( I n − T A ) − 1 B ,
C T : = 2 C ( I n − T A ) − 1 ,
D T : = T C ( I n − T A ) − 1 B + D ,
where the function K from (81) is evaluated [26] in (118) at the Hurwitz matrix T A . The system (117) can be viewed as a finite-difference scheme for numerical integration of the SDEs (7), (11) by the trapezoidal rule with stepsize 2 T . However, such interpretation assumes smallness of the time scale parameter T (for example, in the sense of the first relation in (80)), whereas the conformal correspondence between the LCTI and LDTI setups is valid for any T > 0 .
Now, for a fixed but otherwise arbitrary T > 0 , the relations (118)–(121) describe a smooth bijection
Υ : ( A , B , C , D ) ↦ ( A T , B T , C T , D T )
between the open sets of matrix quadruples such that A is Hurwitz and r ( A T ) < 1 . The structure of dependencies between the matrices under the map Υ is shown in Figure 5 and is inherited by the inverse map
Υ − 1 : ( A T , B T , C T , D T ) ↦ ( A , B , C , D ) ,
which, in view of (25), takes the form
A = Ω ( I n + A T ) − 1 ( A T − I n ) = − Ω K ( A T ) ,
B = 2 Ω ( I n + A T ) − 1 B T ,
C = C T ( I n + A T ) − 1 ,
D = D T − C T ( I n + A T ) − 1 B T .
Relations, similar to (116), (118)–(127), also hold for the transfer function G T of the discrete-time noise shaping filter in (85). As in the discrete-time case, the computation of the ( T , a ) -anisotropic norm (115) for the LCTI system F being considered is of interest only if F is nonround and the mean anisotropy level a is strictly positive (otherwise, the norm reduces trivially to the weighted H 2 -norm 1 m ∥ F T ∥ 2 ).
Theorem 4. 
Suppose the system F in (7), (11) is stable and nonround. Then its ( T , a ) -anisotropic norm (115) can be computed for any given T > 0 and a > 0 as
| | | F | | | T , a = 1 q 1 − m Tr ( L T P T L T T + M T 2 ) .
Here, P T = P T T ∈ R n × n is a positive semi-definite matrix which is the controllability Gramian for the pair
α T : = A T + B T L T , β T : = B T M T
and is a unique solution of the discrete algebraic Lyapunov equation (ALE)
P T = α T P T α T T + β T β T T ,
where the matrices A T , B T , C T , D T are given by (118)–(121), and the matrices L T ∈ R m × n and 0 ≺ M T = M T T ∈ R m × m are associated with a unique admissible solution R T = R T T ∈ R n × n of the discrete algebraic Riccati equation (ARE)
R T = A T T R T A T + q C T T C T + L T T M T − 2 L T ,
L T : = M T 2 ( B T T R T A T + q D T T C T ) ,
M T : = ( I m − q D T T D T − B T T R T B T ) − 1 / 2 .
The admissibility of R T is understood in the sense that I m − q D T T D T − B T T R T B T ≻ 0 is satisfied together with the stability condition
r ( α T ) < 1 ,
and the parameter
0 < q < 1 ∥ F ∥ ∞ 2
(on which the matrices R T , L T , M T , P T also depend) is a unique solution of the equation
− 1 2 ln det m Tr ( L T P T L T T + M T 2 ) M T 2 = a .
The worst-case noise spectral density is unique up to a multiplicative positive constant and is given by
S ( ω ) = ( I m − q Λ ( ω ) ) − 1 , ω ∈ R ,
in terms of (55). It is delivered by an input disturbance W according to the SDE (19), where the matrices L ∈ R m × n and M ∈ R m × m (with M not necessarily symmetric) are computed as
L = L T ( I n + α T ) − 1 , M = M T − L β T .
Proof. 
In regard to computing the ( T , a ) -anisotropic norm (115) of the LCTI system F, the assertion of the theorem is obtained by applying the discrete-time result of [60, Theorem 2] to the LDTI system F T in (117)–(121). However, for a proper adaptation of that result to the continuous-time setting, we will provide its key points on the probabilistic structure of the worst-case disturbance. To this end, we note that the stability and nonroundness of the system F are equivalent to the corresponding properties of its discrete-time counterpart F T . Furthermore, both systems have equal H ∞ -norms in the appropriate Hardy spaces associated with the right half-plane and the unit disk: ∥ F ∥ ∞ = ∥ F T ∥ ∞ . Recall that the accompanying material of [60, Section 5] (given in more detail in [14, Section 8]) describes the structure
ϖ k = L T x k + M T υ k
of the input disturbance of the discrete-time system (see Figure 6), implementing the worst-case spectral density S T in (87), which is unique up to a multiplicative positive constant [60, Theorem 1] and has the form
S T ( φ ) = ( I m − q Λ T ( φ ) ) − 1 , φ ∈ T .
Here, the parameter q, satisfying (135), is found from the saturation A ¯ ( S T ) = a of the constraint A ¯ ( S T ) ⩽ a on the mean anisotropy (99) in (114), (115).
The representation (140) of S T in terms of Λ T from (86) is equivalent to the isometric property of an auxiliary LDTI system
Θ T : = q F T G T − 1 ↔ A T B T q C T q D T − ρ T M T − 1 ,
which employs a matrix
ρ T : = M T − 1 L T
and has the input ϖ and the output
q ζ υ .
The right-hand side of (141) describes the state-space realization matrices of the system Θ T , with its bottom block row corresponding to the equation
υ k = − ρ T x k + M T − 1 ϖ k
obtained from (139) due to det M T ≠ 0 . The condition that the system Θ T is isometric is understood in the sense that if ϖ were an arbitrary square summable sequence in R m (instead of being a stationary Gaussian sequence whose sample paths are square summable only in the trivial case ϖ = 0 ) and hence, so also were υ , ζ in (93), (95), then their ℓ 2 -norms would be related by ∥ ϖ ∥ 2 2 = q ∥ ζ ∥ 2 2 + ∥ υ ∥ 2 2 . However, in the case of the worst-case stationary Gaussian sequence ϖ being considered, the isometric property of the system (141) manifests itself in terms of the variances as
E ( | ϖ k | 2 ) = q E ( | ζ k | 2 ) + m ,
where use is also made of the relation E ( | υ k | 2 ) = Tr I m = m which follows from (94). With the matrix R T in (131) being the observability Gramian of the system (141), the other two equations in the ARE (131)–(133) describe a sufficient state-space condition for the system Θ T to be isometric [60]. This condition is also necessary if the pair ( A T , B T ) is controllable [25]. Similarly to its inverse G T − 1 in (141), the shaping filter
G T ↔ α T β T L T M T ,
governed by the first of the equations (117) in combination with (139), shares the common state x with the system F T :
x k + 1 = α T x k + β T υ k , ϖ k = L T x k + M T υ k ,
where the matrices α T , β T are given by (129) and, as before, the input of the filter is the Gaussian white-noise sequence υ in R m with zero mean and identity covariance matrix. The stability of the filter (144) is secured by the condition (134) and, in combination with (94), leads to the equation (130) for the covariance matrix
P T : = cov ( x k )
of the state of the LDTI system F T under the worst-case input disturbance (139) being considered. Accordingly, the covariance matrix
cov ( ϖ k ) = L T P T L T T + M T 2
of the output of the discrete-time noise shaping filter (143) gives rise to its variance in the common denominator of (128), (136):
E ( | ϖ k | 2 ) = Tr ( L T P T L T T + M T 2 )
in view of the symmetry M T = M T T . Due to the stability of the shaping filter G T and the system F T itself (recall that (134) is fulfilled along with r ( A T ) < 1 ), and also since det M T ≠ 0 , the sequence ϖ generates the same filtration F as υ , with (139) providing its Doob decomposition (105) into the F -predictable and innovation components ϖ ^ , ϖ ˜ in (104) as
ϖ ^ k = L T x k , ϖ ˜ k = M T υ k .
Hence, with the matrix M T being symmetric, the one-step prediction error covariance matrix (103) takes the form
Γ = cov ( M T υ k ∣ F k − 1 ) = M T cov ( υ k ) M T T = M T 2 ,
thus leading to the numerator M T 2 in (136). The structure of the equivalent continuous-time input disturbance W is obtained by applying the inverse map Υ − 1 from (123) (in accordance with (124)–(127)) to the worst-case shaping filter (143), which leads to (19) with the matrices (138). Therefore, in view of (11), the worst-case continuous-time noise shaping filter G is governed by
d X = α X d t + β d V , d W = L X d t + M d V ,
so that
G ↔ α β L M ,
where
α : = A + B L , β : = B M
in accordance with (20). In view of the conformal correspondence (86), (87), the worst-case noise spectral density is obtained from (140) and takes the form of (137). Due to the properties of the Cayley transform (81) and the map Υ − 1 (see also Figure 5), the dynamics matrix α in (149)–(151) is related to its discrete-time counterpart α T in (129), (143), (144) by
α = Ω ( I n + α T ) − 1 ( α T − I n ) = − Ω K ( α T )
and, in view of the condition (134), is Hurwitz. The latter follows from (82) and the transformation of the spectrum for a function of a matrix [26]. □
Note that, by the same conformal correspondence argument as in the proof of Theorem 4 (using the bijection between the unit circle and the imaginary axis), the LCTI system
Θ : = q F G − 1 ↔ A B q C q D − ρ M − 1 ,
which involves an auxiliary matrix
ρ : = M − 1 L
and is associated with the worst-case disturbance W described in the theorem, inherits the property of being inner from its discrete-time counterpart Θ T in (141), so that its transfer function satisfies
Θ ( i ω ) * Θ ( i ω ) = I m , ω ∈ R .
Moreover, the structure (137) of the worst-case noise spectral density S is equivalent to the innerness of Θ . In particular, by continuity, the feedthrough matrix in (152) describes an isometric embedding from R m into R p + m :
lim ω → ∞ ( Θ ( i ω ) * Θ ( i ω ) ) = q D T M − T q D M − 1 = q D T D + ( M M T ) − 1 = I m ,
where M − T : = ( M − 1 ) T . From (154), or from a combination of (137) with (55), (32), (35), (150), it follows that
Δ : = M M T = lim ω → ∞ S ( ω ) = ( I m − q D T D ) − 1 .
The matrix on the right-hand side of (155) is well-defined and positive definite. Indeed, λ max ( D T D ) ⩽ ∥ F ∥ ∞ 2 and hence, (135) implies that q < 1 ∥ F ∥ ∞ 2 ⩽ 1 λ max ( D T D ) , whereby q D T D ≺ I m and Δ ≻ 0 .
As discussed above, similarly to the discrete-time representation in Figure 6, the worst-case disturbance W at the input of the LCTI system F in (7), (11) is formed in (19) by the feedback loop (see Figure 2), through which the system state X enters the drift L X of the disturbance. In line with this, we note that the stability condition (that the matrix α in (149)–(151) has to be Hurwitz) and the mean anisotropy constraint in (114) forbid the hypothetical “noise player” to use an arbitrarily large matrix L for destabilizing the system and force the opponent to mix the predictable component L ∫ 0 t X ( τ ) d τ of the disturbance W with the innovation process M V .
Accordingly, the matrix Δ in (155), which is the diffusion matrix of the worst-case noise W governed by (149), plays a role similar to that of Γ in (148). Indeed, both matrices quantify the second moments of the innovation components M d V and M T υ k of the input disturbances in the continuous and discrete-time representations (149) and (144), respectively.
In the worst-case noise scenario at the mean anisotropy level a ⩾ 0 , the latter admits the decomposition
a = a spat + a temp
into the spatial and temporal components which are found from (136) according to (112), (113) as
a spat = − 1 2 ln det m Tr ( L T P T L T T + M T 2 ) ( L T P T L T T + M T 2 )
= − 1 2 ln det m 〈 M T 2 , I m + Ξ T Ξ T T 〉 ( I m + Ξ T Ξ T T ) M T 2 , a temp = 1 2 ln det ( M T − 2 ( L T P T L T T + M T 2 ) )
= 1 2 ln det ( I m + Ξ T Ξ T T ) ,
where
Ξ T : = ρ T P T .
Here, use has been made of the matrix ρ T from (142) along with the fact that the matrix
L T P T L T T + M T 2 = M T ( I m + Ξ T Ξ T T ) M T 2 M T − 1
in (146) is related by a similarity transformation and is therefore isospectral to the matrix
( I m + Ξ T Ξ T T ) M T 2 .
Note that the temporal part a temp in (158) is completely specified by the singular values of the matrix Ξ T from (159).
While the mean anisotropy functional (99) and its spatio-temporal decomposition (111)–(113) have an entropy-theoretic interpretation in terms of the auxiliary Gaussian sequence (91) discussed in Section 8, and a spat in (157) admits two-sided bounds [14, p. 13] in terms of the condition number of the matrix (146), it is relevant to link the temporal component a temp in (158) with relative entropy rates for the worst-case noise W in its native continuous time.

10. Relative Entropy Rates for Worst-Case Disturbance

Consider the system F subject to the worst-case noise W from Theorem 4 (at a given mean anisotropy level a > 0 ) governed by the SDEs (149) with zero initial conditions W ( 0 ) = 0 and V ( 0 ) = 0 . For any t ⩾ 0 , the restriction W | [ 0 , t ] of W to the time interval [ 0 , t ] is a random element with values in the Banach space C 0 ( [ 0 , t ] , R m ) of continuous functions w : [ 0 , t ] → R m satisfying w ( 0 ) = 0 and equipped with the uniform norm. By Girsanov’s theorem [23], the probability distribution of W | [ 0 , t ] on Borel subsets of C 0 ( [ 0 , t ] , R m ) is absolutely continuous with respect to that of the Wiener process M V with the diffusion matrix Δ ≻ 0 in (155), and its Radon-Nikodym derivative, evaluated at W | [ 0 , t ] , is found from
ln R ( t ) = ∫ 0 t X ( τ ) T L T Δ − 1 d W ( τ ) − 1 2 ∫ 0 t ∥ L X ( τ ) ∥ Δ − 1 2 d τ = ∫ 0 t X ( τ ) T ρ T d V ( τ ) + 1 2 ∫ 0 t | ρ X ( τ ) | 2 d τ ,
where use is also made of the matrix ρ from (153). The validity of the representation (160) is guaranteed whenever an appropriately modified version of Novikov’s condition [43] is satisfied:
E * e 1 2 ∫ 0 t | ρ X ( τ ) | 2 d τ < + ∞ ,
where E * ( · ) is the expectation over a reference probability measure P * which considers M − 1 W a standard Wiener process in R m . The fulfillment of (161) for any t > 0 secures the martingale property (in the sense of P * ) on any bounded time interval for the random process R in (160) with respect to the natural filtration of W. Returning to the actual probability measure P with the expectation E ( · ) , according to which W is governed by (149) where V is a standard Wiener process, we note that (160) allows the corresponding Renyi’s relative entropy [44] of order 1 + ϵ to be computed for any ϵ > 0 small enough (in the sense specified below) as
R ϵ ( t ) : = 1 ϵ ln E ( R ( t ) ϵ ) = 1 ϵ ln E e ϵ ln R ( t ) = 1 ϵ ln E e ϵ ∫ 0 t X ( τ ) T ρ T d V ( τ ) + ϵ 2 ∫ 0 t | ρ X ( τ ) | 2 d τ = 1 ϵ ln E μ ϵ ( t ) e 1 2 ϵ ( 1 + ϵ ) ∫ 0 t | ρ X ( τ ) | 2 d τ = 1 ϵ ln E e 1 2 ϵ ( 1 + ϵ ) ∫ 0 t | ρ X ( τ ) | 2 d τ .
Here,
μ ϵ ( t ) : = e ϵ ∫ 0 t X ( τ ) T ρ T d V ( τ ) − 1 2 ϵ 2 ∫ 0 t | ρ X ( τ ) | 2 d τ ,
and use is made of its martingale property on any bounded time interval under the sufficient condition
E e 1 2 ϵ 2 ∫ 0 t | ρ X ( τ ) | 2 d τ < + ∞ , t > 0 .
The KL relative entropy of the probability distribution of W | [ 0 , t ] with respect to that of M V | [ 0 , t ] is recovered from (162), (160) as
R 0 ( t ) : = lim ϵ → 0 + R ϵ ( t ) = E ln R ( t ) = 1 2 ∫ 0 t E ( | ρ X ( τ ) | 2 ) d τ ⩽ R ϵ ( t ) ,
where the inequality (provided here for completeness of exposition) follows from Jensen’s inequality.
Note that the relative entropy (162) (and its limiting case (165)) takes the same value for the probability law of the filtered noise W T | [ 0 , t ] with respect to that of M V T | [ 0 , t ] because W T is obtained from W by the same bijective causal transformation as M V T from M V as specified by (22), (23), and this transformation preserves the natural filtration of the processes.
The theorem below on the relative entropy rates for the worst-case noise W employs the transfer function
N ( s ) : = ( s I n − α ) − 1 β , s ∈ C
of an auxiliary LCTI system which maps V to the state process X governed by the first SDE in (149) with the Hurwitz matrix α . In this worst-case noise scenario, the invariant covariance matrix of the process X, given by
P : = lim t → + ∞ P ( t ) = ∫ R + e t α β β T e t α T d t = 1 2 π ∫ R N ( i ω ) N ( i ω ) * d ω ,
coincides with the controllability Gramian of the pair ( α , β ) from (151) and satisfies a continuous ALE
α P + P α T + β β T = 0 .
Here, the covariance matrix
P ( t ) : = cov ( X ( t ) ) = ∫ 0 t e τ α β β T e τ α T d τ = P − e t α P e t α T , t ⩾ 0 ,
converges to its limit P in (167) monotonically, so that 0 ≼ P ( u ) ≼ P ( s ) ≼ P for any s ⩾ u ⩾ 0 .
Theorem 5. 
Suppose the system F in (7), (11) is subject to the worst-case noise W (at a given mean anisotropy level a > 0 ) governed by the SDEs (149) as described in Theorem 4 and its proof. Then for any ϵ satisfying
0 < ϵ < 1 2 1 + 4 ∥ ρ N ∥ ∞ − 2 − 1
in terms of the matrix ρ from (153) and the H ∞ -norm of the transfer function (166), the Renyi and KL relative entropies (162), (165) have the following rates:
lim t → + ∞ R ϵ ( t ) t = − 1 4 π ϵ ∫ R ln det ( I m − ϵ ( 1 + ϵ ) ρ N ( i ω ) N ( i ω ) * ρ T ) d ω ⩾ lim t → + ∞ R 0 ( t ) t = 1 2 ∥ Ξ ∥ F 2 ,
where
Ξ : = ρ P ,
and P is the matrix from (167), (168).
Proof. 
The zero-initialized Gaussian state process X in (149) has zero mean and a continuous covariance function
ϰ ( s , u ) : = cov ( X ( s ) , X ( u ) ) = e ( s − u ) α P ( u ) for s ⩾ u ⩾ 0 P ( s ) e ( u − s ) α T for u > s ⩾ 0 ,
where use is made of the covariance matrix from (169). By the convergence (167), the resulting limit of (173) takes the form
ϰ ∞ ( τ ) : = lim u → + ∞ ϰ ( u + τ , u ) = e τ α P if τ ⩾ 0 P e − τ α T if τ < 0 = 1 2 π ∫ R e i ω τ N ( i ω ) N ( i ω ) * d ω , τ ∈ R ,
which depends only on the time difference and is the covariance function of the process X in its stationary regime, where N is the transfer function from (166). For a fixed but otherwise arbitrary time horizon t > 0 , the function (173) gives rise to a compact positive semi-definite self-adjoint integral operator H t on the Hilbert space L 2 ( [ 0 , t ] , R m ) , whose R m × m -valued kernel function on the square [ 0 , t ] 2 is the covariance function ρ ϰ ρ T of the process ρ X , so that, similarly to (3),
E ∫ 0 t φ ( s ) T ρ X ( s ) d s ∫ 0 t ψ ( u ) T ρ X ( u ) d u = ∫ 0 t φ ( s ) T H t ( ψ ) ( s ) d s , H t ( ψ ) ( s ) : = ρ ∫ 0 t ϰ ( s , u ) ρ T ψ ( u ) d u , 0 ⩽ s ⩽ t ,
for any φ , ψ ∈ L 2 ( [ 0 , t ] , R m ) . The operator H t is majorized by a compact positive semi-definite self-adjoint Toeplitz integral operator K t on L 2 ( [ 0 , t ] , R m ) with the kernel function ρ ϰ ∞ ρ T associated with (174):
H t ≼ K t .
The L 2 -induced operator norms of H t and K t coincide with their largest eigenvalues and are nondecreasing functions of time t satisfying
λ max ( H t ) ⩽ λ max ( K t ) ⩽ lim τ → + ∞ λ max ( K τ ) = sup ω ∈ R λ max ( ρ N ( i ω ) N ( i ω ) * ρ T ) = ∥ ρ N ∥ ∞ 2 .
Here, the first inequality follows from (176), while the first equality follows from the fact that the function R ∋ ω ↦ ρ N ( i ω ) N ( i ω ) * ρ T ∈ H m + is the Fourier transform of the kernel function ρ ϰ ∞ ρ T of the operator K t in view of (174) and from the asymptotic properties of spectra of Toeplitz operators [24]. Hence, for any ϵ subject to (170), where the second inequality originates from the condition
ϵ ( 1 + ϵ ) < 1 ∥ ρ N ∥ ∞ 2 ,
the operator ϵ ( 1 + ϵ ) H t is a contraction, and so also is ϵ 2 H t . In combination with the fact that X is a zero-mean Gaussian process, the relations (177), (178) secure the fulfillment of the sufficient condition (164) for the martingale property of (163), which is used in (162), and make the right-hand side of (162) well-defined. Application of the results of [22] (see also the references therein) and the Fredholm formula [50] to the right-hand side of (162) yields
R ϵ ( t ) = − 1 2 ϵ Tr ln ( I − ϵ ( 1 + ϵ ) H t ) = 1 2 ∑ k = 1 + ∞ 1 k ϵ k − 1 ( 1 + ϵ ) k Tr ( H t k ) , t > 0 ,
where I is the identity operator. Since the function Q ↦ − Tr ln ( I − Q ) ∈ R + is monotonic with respect to a self-adjoint operator 0 ≼ Q ≺ I of finite trace, it follows from (176)–(179) that
R ϵ ( t ) ⩽ − 1 2 ϵ Tr ln ( I − ϵ ( 1 + ϵ ) K t ) .
Hence,
lim sup t → + ∞ R ϵ ( t ) t ⩽ − 1 2 ϵ lim t → + ∞ 1 t Tr ln ( I − ϵ ( 1 + ϵ ) K t ) = − 1 4 π ϵ ∫ R ln det ( I m − ϵ ( 1 + ϵ ) ρ N ( i ω ) N ( i ω ) * ρ T ) d ω ,
where the last equality follows from the Szegö limit theorem for Toeplitz operators [24]. On the other hand, (162) implies that
R ϵ ( t ) ⩾ 1 ϵ ln E e 1 2 ϵ ( 1 + ϵ ) ∫ τ t | ρ X ( s ) | 2 d s = − 1 2 ϵ Tr ln ( I − ϵ ( 1 + ϵ ) H τ , t ) , 0 ⩽ τ < t ,
where H τ , t is the covariance operator of the process ρ X on the time interval [ τ , t ] . More precisely, H τ , t is an integral operator on the space
L 2 ( [ τ , t ] , R m ) = T τ ( L 2 ( [ 0 , t − τ ] , R m ) )
with the kernel function ρ ϰ ρ T on [ τ , t ] 2 , where T τ is the unitary operator of translation by τ acting on a function φ as T τ ( φ ) ( s ) = φ ( s − τ ) , so that its adjoint is T τ † = T − τ . In particular, H 0 , t = H t as defined in (175). Due to the Hurwitz property of the matrix α in (151) leading to the monotonic convergence in (167), for any given δ ∈ ( 0 , 1 ] , there exists τ ⩾ 0 such that the function (169) satisfies
P ( t ) ≽ P ( τ ) ≽ ( 1 − δ ) P , t ⩾ τ .
This property can be verified (in the general case, when the pair ( α , β ) is not necessarily controllable and P in (167) can be singular) by decomposing the state space into the orthogonal sum R n = ker P ⊕ im P and noting that
x T e τ α P e τ α T x = | P e τ α T x | 2 = 0 , x ∈ ker P
for any τ ⩾ 0 , while the matrix P is positive definite on the reachable subspace im P , whereby P x ≠ 0 for any x ∈ im P ∖ { 0 } . Therefore, (182) is equivalent to
max x ∈ im P : | P x | = 1 | P e τ α T x | ⩽ δ
and can indeed be satisfied for any given δ > 0 by choosing τ large enough due to α being Hurwitz. By the dependence of the covariance function (173) on P in (169), the fulfillment of the condition (182) implies that
H τ , t ≽ ( 1 − δ ) T τ K t − τ T − τ , t > τ ,
where use is also made of the translation invariance of the kernel function ρ ϰ ∞ ρ T of the Toeplitz operator K t . By combining (181) with (183) and using the monotonicity argument as before along with the unitary equivalence (and thus, isospectrality) of the operators T τ K t − τ T − τ and K t − τ , it follows that
R ϵ ( t ) ⩾ − 1 2 ϵ Tr ln ( I − ϵ ( 1 + ϵ ) ( 1 − δ ) T τ K t − τ T − τ ) = − 1 2 ϵ Tr ln ( I − ϵ ( 1 + ϵ ) ( 1 − δ ) K t − τ ) , t > τ ,
and hence,
lim inf t → + ∞ R ϵ ( t ) t ⩾ − 1 2 ϵ lim t → + ∞ 1 t Tr ln ( I − ϵ ( 1 + ϵ ) ( 1 − δ ) K t − τ ) = − 1 4 π ϵ ∫ R ln det ( I m − ϵ ( 1 + ϵ ) ( 1 − δ ) ρ N ( i ω ) N ( i ω ) * ρ T ) d ω .
Since δ ∈ ( 0 , 1 ] is arbitrary, then by letting δ → 0 + , a comparison of (184) with (180) establishes the first equality in (171). The inequality and the second equality in (171) are obtained from (165), (167) by using (174) at τ = 0 along with (172). □
In view of the last equality in (162) and the fact that the function R ∋ ω ↦ ρ N ( i ω ) N ( i ω ) * ρ T ∈ H m + is the spectral density of the Gaussian process ρ X in the stationary regime of the first SDE from (149), the first equality in (171) is a particular case of the quadratic-exponential functional rates for stationary Gaussian processes in infinite-horizon risk-sensitive control [4,9,41].
The relative entropy rates (171) have the physical dimension of the inverse of time. The reciprocal quantity
τ * : = 2 ∥ Ξ ∥ F 2 ,
which involves the matrix (172), can be interpreted as characteristic time for the deviation of the worst-case noise W from the Wiener process M V to manifest itself in terms of the relative entropies (162), (165) in the stationary regime of (149) when they take the form
R ϵ ( t ) ⩾ R 0 ( t ) = t τ * , t ⩾ 0 .
Note that such deviation can be detected in the long run (at time horizons t ≫ τ * ) by statistical hypothesis testing [38,70], although detailed analysis of this issue is beyond the scope of the present paper. Also, a related quantity
m ∥ Ξ ∥ F 2 = m 2 τ *
describes qualitatively the local time scale at which the drift and diffusion terms in the modified form
M − 1 d W = ρ X d t + d V
of the second SDE from (149) make comparable contributions to the increment of the process M − 1 W . This is understood at the level of the second-order moments (in the stationary regime) including the relation
E ( | V ( s ) − V ( t ) | 2 ) = m | s − t | , s , t ∈ R ,
for the standard Wiener process V in R m from (21). More precisely, the drift-diffusion balance time (186) is obtained by formally equating m τ from (187) with E ( | ρ X | 2 ) τ 2 = ∥ Ξ ∥ F 2 τ 2 for the time difference τ : = | s − t | > 0 .
The structure of the matrix Ξ in (172) appearing in the KL relative entropy rate (171) is identical to that of the matrix Ξ T in (159) which participates in the temporal component (158) of the mean anisotropy level, with the matrices ρ , P in (153), (168) and ρ T , P T in (142), (130) being counterparts of each other in continuous and discrete time, respectively. This resemblance is not coincidental and is substantiated in the proof of the following theorem.
Theorem 6. 
As in Theorem 5, suppose the system F is subject to the worst-case noise W governed by the SDEs (149) as specified in Theorem 4 and its proof. Then the temporal component (157) of the mean anisotropy level a > 0 is linked to the KL relative entropy rate in (171) through the time scale (185) by
a temp ⩽ 2 σ T τ * ,
where
σ : = λ max ( Γ − 1 Δ )
is the largest eigenvalue for the linear matrix pencil Δ − λ Γ associated with the matrices Γ, Δ from (148), (155).
Proof. 
The inequality (188) can be established as a corollary from the intermediate inequalities
a temp ⩽ 1 2 ∥ Ξ T ∥ F 2 ⩽ σ T ∥ Ξ ∥ F 2 ,
where the right-hand side coincides with that of (188) in view of (185). The first inequality in (190) is obtained by combining (158) with the fact that the function ln det ( · ) is concave on the set of positive definite matrices (as mentioned before) and vanishes at the identity matrix, where the Frechet derivative of this function satisfies ∂ Q ln det Q | Q = I m = I m , so that
ln det ( I m + Ξ T Ξ T T ) ⩽ 〈 I m , Ξ T Ξ T T 〉 = ∥ Ξ T ∥ F 2 .
We will now prove the second inequality in (190). The discrete-time state-space realization (144) gives rise to the transfer function for the map υ ↦ x :
N T ( z ) : = z ( I n − z α T ) − 1 β T , z ∈ C ,
with the matrices α T , β T from (129). In view of (134), the invariant covariance matrix P T of the stationary Gaussian sequence x in (145), which satisfies the discrete ALE (130), is expressed in terms of (191) as
P T = 1 2 π ∫ T N T ( e i φ ) N T ( e i φ ) * d φ .
The matrix P T should not be confused with the invariant covariance matrix of the filtered state process X T in (46), which, in the worst-case noise scenario, is governed by the ODE
X ˙ T = A X T + B ( L X T + M V T ) = α X T + β V T ,
where the matrices (151) are used, and V T is the OU process as before. Indeed, by combining the spectral density Σ I m of V T from (52) with (166), (193) and the initial condition for X T from (49), it follows that
J T : = lim t → + ∞ cov ( X T ( t ) ) = 1 2 π ∫ R Σ ( ω ) N ( i ω ) N ( i ω ) * d ω = 1 2 π ∫ T N i Ω tan φ 2 N i Ω tan φ 2 * d φ = 1 2 π ∫ T N − i Ω tan φ 2 N − i Ω tan φ 2 * d φ = 1 2 π ∫ T N ( Ω K ( e i φ ) ) N ( Ω K ( e i φ ) ) * d φ = 1 2 π i ∮ | z | = 1 N ( Ω K ( z ) ) N ( Ω K ( z ) ) * d z z ,
with the integration variable change according to (75), (83). The last integrand in (194) can be computed similarly to (116) by using
N ( Ω K ( z ) ) = Ω 1 − z 1 + z I n − α − 1 β = ( 1 + z ) ( I n − z α T ) − 1 β T = 2 z ( I n − T α ) − 1 ( I n − z α T ) − 1 β T + T ( I n − T α ) − 1 β = ( I n − T α ) − 1 ( 2 N T ( z ) + T β ) ,
where the last equality involves the transfer function N T from (191). Substitution of (195) into (194) yields
J T = 1 2 π i ( I n − T α ) − 1 ∮ | z | = 1 ( 2 N T ( z ) + T β ) ( 2 N T ( z ) * + T β T ) d z z ( I n − T α ) − T = ( I n − T α ) − 1 2 π i ∮ | z | = 1 N T ( z ) N T ( z ) * d z z + T 2 β β T ( I n − T α ) − T = ( I n − T α ) − 1 ( 4 P T + T 2 β β T ) ( I n − T α ) − T = 4 ( I n − T α ) − 1 P T ( I n − T α ) − T + β T β T T .
Here, (192) is used along with the relations
∮ | z | = 1 N T ( z ) d z z = 0 , ∮ | z | = 1 N T ( z ) * d z z = ∮ | z | = 1 N T ( 1 / z ) T d z z = 0
in view of the vanishing residues Res z = 0 N T ( z ) z = 0 and Res z = ∞ N T ( 1 / z ) z = 0 by the structure of (191). Also, the last equality in (196) employs the relation
β T = T ( I n − T α ) − 1 β
between the input matrices of the worst-case noise shaping filter G in (150) and its discrete-time counterpart G T in (143). On the other hand, a combination of the second equality in (194) with (52), (167) leads to
J T ≼ sup ω ∈ R Σ ( ω ) 1 2 π ∫ R N ( i ω ) N ( i ω ) * d ω = 2 T P .
Therefore, by (196), (197),
4 ( I n − T α ) − 1 P T ( I n − T α ) − T + β T β T T ≼ 2 T P .
The left and right multiplication of both sides of (198) by the matrices L and L T , respectively, leads to
L T P T L T T ≼ L T P T L T T + L β T β T T L T ≼ 2 T L P L T .
Here, use is also made of the relation
L T = 2 L ( I n − T α ) − 1
between the output matrices of the worst-case noise shaping filter G in (150) and its discrete-time counterpart G T in (143). The left and right multiplication of (199) by the symmetric matrix M T − 1 yields
Ξ T Ξ T T = ρ T P T ρ T T = M T − 1 L T P T L T T M T − 1 ≼ 2 T M T − 1 L P L T M T − 1 = 2 T M T − 1 M ρ P ρ T M T M T − 1 = 2 T M T − 1 M Ξ Ξ T M T M T − 1 ,
where use is also made of the matrices Ξ T , ρ T from (159), (142) and Ξ , ρ from (172), (153). By taking the trace on both sides of (200), it follows that
∥ Ξ T ∥ F 2 ⩽ 2 T Tr ( M T − 1 M Ξ Ξ T M T M T − 1 ) = 2 T Tr ( Ξ T M T M T − 2 M Ξ ) ⩽ 2 T λ max ( M T Γ − 1 M ) ∥ Ξ ∥ F 2 ,
with Γ from (148). Since the matrix M T Γ − 1 M is isospectral to Γ − 1 M M T = Γ − 1 Δ in view of (155), with the largest eigenvalue in (189), then (201) establishes the second inequality in (190), thus completing the proof. □
Since Theorem 6 involves the generalized spectrum of the matrices Δ and Γ which quantify the second-order moments of the innovation components of the worst-case disturbance in its continuous and discrete-time representations, we provide an upper bound for it as follows.
Lemma 1. 
The largest generalized eigenvalue (189) for the matrices Γ, Δ in (148), (155), associated with the worst-case noise shaping filter in Theorem 4, satisfies
σ ⩽ 1 + q λ max ( ( D T D − D T T D T ) Δ ) ,
where q is the parameter from (135).
Proof. 
From (148) and positive semi-definiteness of the solution R T of the ARE (131)–(133), it follows that
Γ − 1 = M T − 2 = I m − q D T T D T − B T T R T B T ≼ I m − q D T T D T .
Since Δ ≻ 0 in (155), the matrix Γ − 1 Δ is isospectral to Δ Γ − 1 Δ which, in view of (203), satisfies
Δ Γ − 1 Δ ≼ Δ ( I m − q D T T D T ) Δ = Δ ( Δ − 1 + q ( D T D − D T T D T ) ) Δ = I m + q Δ ( D T D − D T T D T ) Δ .
Due to monotonicity of the function λ max ( · ) on the subspace of real symmetric (or complex Hermitian) matrices with respect to the cone of positive semi-definite matrices, (204) implies that
λ max ( Δ Γ − 1 Δ ) ⩽ 1 + q λ max ( Δ ( D T D − D T T D T ) Δ ) ,
which leads to (202) in view of the same similarity transformation and isospectrality argument as above. □
The inequality (188) remains valid if the geometric factor σ is replaced with its upper bound from (202). This inequality, or its equivalent form
τ * ⩽ 2 σ a temp T ,
provides an insight into the relation between the temporal part a temp of the mean anisotropy level a > 0 and the degree of distinguishability of the worst-case noise W from its martingale component M V in terms of the characteristic time τ * for their discrepancy to manifest itself through relative entropy. This makes Theorem 6 applicable to a rational choice of the parameter a as the amount of statistical uncertainty in the external disturbance acting on the LCTI system.

11. Continuous-Time Anisotropic Norm Computation for RLC Circuit

As a numerical illustration of the above results, consider a two-loop RLC circuit in Figure 7 with resistance, inductance and capacitance coefficients R k , L k , C k > 0 for the kth loop, k = 1 , 2 .
The circuit loops are inductively coupled, which is quantified by the mutual inductance coefficient L 12 , so that the magnetic field energy stored by the coupled inductors is given by the quadratic form
1 2 ∑ k = 1 2 L k J k 2 + L 12 J 1 J 2 = 1 2 ∥ J ∥ Π 2 , J : = J 1 J 2 .
Here, J k is the current in the kth loop, and use is made of an auxiliary positive definite matrix
Π : = L 1 L 12 L 12 L 2 .
The loops involve two noise sources (for example, of thermal or crosstalk origin [45,75]) with irregular voltages whose integrals over time (such as flux linkages) are represented by an R 2 -valued Ito process
W : = W 1 W 2 .
Accordingly, the integrals of the noise voltages are understood in the generalized sense since W is not differentiable with respect to time. The electric charges Q k at the capacitors have continuously differentiable sample paths with probability one, while their time derivatives
Q ˙ k = J k
are Ito processes. With Q k playing the role of generalized coordinates, the Lagrangian dynamics formalism along with (205) and Kirchhoff’s voltage law lead to a set of two SDEs
L k d Q ˙ k + L 12 d Q ˙ 3 − k + R k Q ˙ k + 1 C k Q k d t = d W k , k = 1 , 2 ,
which are coupled through the mutual inductance L 12 . The SDEs (208) can be assembled into one SDE (11) for the state process X, given by
X : = Q Q ˙ , Q : = Q 1 Q 2 ,
with the state and input dimensions n = 4 , m = 2 in view of (207) and the state-space realization matrices
A : = 0 I 2 − Π − 1 E − Π − 1 R , B : = 0 Π − 1 .
The latter are expressed in terms of the matrix Π from (206) and (also positive definite) matrices
E : = 1 C 1 0 0 1 C 2 , R : = R 1 0 0 R 2 .
The resulting system F is a stable linear dissipative stochastic Hamiltonian system [66], with Π , E, R playing the role of the generalized mass, stiffness and damping matrices, respectively, and the Hamiltonian
1 2 ( ∥ Q ∥ E 2 + ∥ Q ˙ ∥ Π 2 ) = 1 2 ( ∥ Q ∥ E 2 + ∥ Π Q ˙ ∥ Π − 1 2 )
describing the total electric and magnetic field energy stored by the capacitors and inductors of the RLC circuit. Here, the vector Π Q ˙ , consisting of the flux linkages at the inductors, corresponds to the generalized momentum in accordance with the electromechanical analogy. The Hurwitz property of the matrix A in (210) is secured by the positive definiteness of the matrices Π and (211).
If the robust performance analysis of the RLC circuit is concerned, for example, with the sensitivity of the voltage Q 1 C 1 at the first capacitor and the voltage R 2 J 2 = R 2 Q ˙ 2 at the second resistor to the voltage noises, then the system output Z in (7) can be specified by the matrices
C : = 1 C 1 0 0 0 0 0 0 R 2 , D : = 0 ,
in accordance with (209). Indeed, an appropriately scaled version of the filtered output process Z T in (46) satisfies
1 2 T Z T ( t ) = C 1 2 T X T ( t ) ⟶ a . s . C X ( t ) = 1 C 1 Q 1 ( t ) R 2 J 2 ( t ) , as T → 0 + ,
for any t ⩾ 0 in view of (50), and thus asymptotically reproduces the first capacitor and second resistor voltages of interest.
With the following values of the circuit parameters (their physical dimensions are omitted for brevity)
R 1 = 0.3190 , R 2 = 0.6324 , L 1 = 1.1235 , L 2 = 2.2478 , L 12 = 0.8593 , C 1 = 0.4927 , C 2 = 0.2501
in (206), (210)–(212), the state-space realization of the system F being considered is given by
F ↔ 0 0 1.0000 0 0 0 0 0 0 1.0000 0 0 − 2.5530 1.9227 − 0.4013 0.3041 1.2579 − 0.4809 0.9760 − 2.5138 0.1534 − 0.3976 − 0.4809 0.6287 2.0296 0 0 0 0 0 0 0 0 0.6324 0 0 .
The spectrum of the matrix A is
S = { − 0.3077 ± 1.9516 i , − 0.0917 ± 1.0747 i }
(so that the system is highly resonant with two lightly damped oscillatory modes), and the bounds in (80) are
1 r ( A ) = 0.5062 , r ( A − 1 ) = 0.9271 .
The lower of these bounds (see the first relation in (80)) exceeds noticeably the time scale parameter
T = 0.0810
of the conformal correspondence which is used in what follows along with the cutoff frequency
Ω = 12.3481
from (25). Therefore, the effective frequency range of the low-pas filter Φ in (22)–(24), which specifies the filtered input and output W T , Z T for the RMS gain (54), is adequate for capturing the transient processes in the system F. The matrices (118)–(121) of its discrete-time counterpart F T take the form
F T ↔ 0.9685 0.0229 0.1545 0.0055 0.0078 − 0.0029 0.0116 0.9690 0.0028 0.1545 − 0.0029 0.0039 − 0.3890 0.2832 0.9074 0.0677 0.0958 − 0.0354 0.1438 − 0.3832 0.0342 0.9084 − 0.0354 0.0479 3.9953 0.0465 0.3135 0.0111 0.0158 − 0.0058 0.0909 − 0.2423 0.0217 1.2069 − 0.0224 0.0303 .
The behaviour of the singular values of the transfer function F T in (116) on the unit circle (see Figure 8) shows that the system F T is substantially nonround (and hence, so also is the system F).
Accordingly, there is a large gap between the scaled H 2 -norm and the H ∞ -norm of the discrete-time system F T :
1 m ∥ F T ∥ 2 = 0.4701 , ∥ F T ∥ ∞ = 3.8617 .
These norms are the endpoints of the range of the ( T , a ) -anisotropic norm | | | F | | | T , a of the system (as the mean anisotropy level a varies from 0 to + ∞ ), computed using Theorem 4 (with Newton’s iterations [60, Section 4], [14, Section 9]) and shown in Figure 9.
For example, at
a = 0.5000 ,
the norm being considered is
| | | F | | | T , a = 2.4650 ,
and the matrices (138) of the worst-case noise shaping filter (149) are given by
L = 0.0697 0.0861 0.2543 0.2487 − 0.0422 0.0009 0.1163 0.2334 , M = 1.0000 − 0.0002 0.0002 1.0000 .
In comparison with (213), the spectrum of the corresponding matrix α in (151) is closer to the imaginary axis:
{ − 0.2528 ± 1.9485 i , − 0.0011 ± 1.0659 i } ,
so that the parasitic feedback loop in Figure 2 leads to a less stable system (20). While the matrix L is relatively small, M is close to the identity matrix I 2 . Moreover, since D = 0 in this example as indicated in (212), the matrix M is orthogonal in view of (155), although its orthogonality is slightly distorted in (216) by the finite accuracy of digital representation. The resulting martingale part M V of the worst-case noise W has the identity diffusion matrix
Δ = I 2
and thus inherits from V the property of being a standard Wiener process in R 2 . In the worst-case noise scenario at the mean anisotropy level (215), the spatial and temporal components in (156)–(158) are
a spat = 0.0752 , a temp = 0.4248 .
The spatial component comes from the covariance matrix (146) of the auxiliary stationary Gaussian sequence (91), which is also the invariant covariance matrix of the filtered version W T of W:
L T P T L T T + M T 2 = lim t → + ∞ cov ( W T ( t ) ) = 1.9948 0.5508 0.5508 1.3801
(its eigenvalues are 2.3182 and 1.0567 ). The KL relative entropy rate (171) of the worst-case noise W with respect to its martingale part M V , and the characteristic time scale (185) for their discrepancy to manifest itself are
1 2 ∥ Ξ ∥ F 2 = 4.1316 , τ * = 0.2420 .
The geometric factor in (189) is
σ = 0.9873 ,
and its upper bound in (202) is 1.0000 . In addition to (217), the intermediate term in (190) and the right-hand side of (188) are
1 2 ∥ Ξ T ∥ F 2 = 0.6431 , 2 σ T τ * = 0.6607 .
The time scale τ * in (219) noticeably (yet insignificantly) exceeds the Tustin transform parameter T in (214), with τ * T = 2.9887 . In this sense, the worst-case noise at the mean anisotropy level (215) can informally be qualified as moderately coloured, while comparison of τ * with other time scales can also be considered. Typical sample paths of the filtered versions
W T = L X T + M V T , Z T = ( C + D L ) X T + D M V T
of the noise process W and the output signal Z of the RLC circuit are provided in Figure 10, Figure 11 along with those of L X T .
They are obtained by the numerical integration of the SDE
d X T V T = α β 0 − Ω I m X T V T d t + 0 2 Ω I m d V
(which combines the ODE (193) with the SDE (22) and uses the matrices (151)) in such a way that the probability law of the jointly Gaussian processes X T , V T in their stationary regime is exactly reproduced. Note that the elliptical shape and tilt of the scatter plot in Figure 10 is in accordance with the eigenstructure of the invariant covariance matrix (218), including the positive correlation between the components of W T considered at the same moment of time.

12. Concluding Remarks

We have outlined a particular way of extending the discrete-time anisotropy-based criteria to LCTI systems governed by SDEs with statistically uncertain Ito processes as external noise inputs. This approach uses the RMS gain of the system in terms of filtered versions of the input and output processes. The time scale T of the low-pass filter parameterizes Tustin’s transform of the original LCTI system F to its LDTI counterpart F T with the same RMS gain, though understood in the usual sense for fragments (or steady-state RMS values) of stationary Gaussian random sequences.
The resulting two-parameter norm | | | F | | | T , a is defined as the a-anisotropic norm | | | F T | | | a of the effective discrete-time system, with the input mean anisotropy threshold a quantifying indirectly the deviation of the spectral density of the Ito process at the input of the original system from constant scalar matrices. The computation of this norm reduces to the numerical solution of a set of matrix algebraic Riccati, Lyapunov and log-determinant equations developed 30 years ago in the discrete-time anisotropy-based control theoretic framework. Under Tustin’s inverse transform, the worst-case disturbance inherits the general feedback structure, whereby its drift depends linearly on the internal state of the system.
Therefore, in combination with Tustin’s direct and inverse transforms, the methods of anisotropy-based robust performance analysis and control design, developed earlier for discrete-time systems, are applicable to continuous-time settings. In particular, this allows the state-space solutions [61,63] of discrete-time anisotropy-based control and filtering problems to be converted to their continuous-time counterparts. However, such extension is limited to infinite-horizon settings for time invariant systems since it substantially employs the commutativity between two LCTI systems as input-output operators, provided one of them has a scalar transfer function. Accordingly, an extension of finite-horizon time-varying formulations of the discrete-time anisotropy-based theory to their continuous-time counterparts requires the development of alternative approaches, which will be reported elsewhere.

Funding

The original results of the discrete-time anisotropy-based control theory were obtained by the author under the support of the Russian Foundation for Basic Research grant 95-01-00447 in 1995–1997 (while the author was with the State Research Institute of Aviation Systems and the Institute for Information Transmission Problems, the Russian Academy of Sciences) and the subsequent support from the Australian Research Council grant A10027063 in 2000–2002 (while the author was with the Mathematics Department of the University of Queensland). The present support from the Australian Research Council is also acknowledged.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

Abbreviations

The following abbreviations are used in this paper:
ALE algebraic Lyapunov equation
ARE algebraic Riccati equation
KL Kullback-Leibler
LCTI linear continuous time invariant
LDTI linear discrete time invariant
ODE ordinary differential equation
OU Ornstein-Uhlenbeck
PDF probability density function
RLC resistance, inductance, capacitance
RMS root-mean-square
SDE stochastic differential equation

References

  1. Alfsen, E.M. A simplified constructive proof of existence and uniqueness of Haar measure. Math. Scand. 1963, 12, 106–116. [Google Scholar] [CrossRef]
  2. Belov, A.A.; Kurdyukov, A.P. Calculation of the anisotropic norm of the descriptor system. Autom. Remote Control 2010, 71, 1022–1033. [Google Scholar] [CrossRef]
  3. Belov, I.R.; Kustov, A.Yu. The asymptotic behavior of anisotropic DOF controller at infinitesimal values of upper bound of input’s mean anisotropy. Autom. Remote Contr. 2025, 86, 942–952. [Google Scholar]
  4. Bensoussan, A.; van Schuppen, J.H. Optimal control of partially observable stochastic systems with an exponential-of-integral performance index. SIAM J. Control Optim. 1985, 23, 599–613. [Google Scholar] [CrossRef]
  5. Bernhard, H.-P. A tight upper bound on the gain of linear and non-linear predictors for stationary stochastic processes. IEEE Trans. Sign. Proc. 1998, 46, 2909–2917. [Google Scholar] [CrossRef]
  6. Bernstein, D.S.; Haddad, W.M. LQG control with an H∞ performance bound: a Riccati equation approach. IEEE Trans. Autom. Contr. 1989, 34, 293–305. [Google Scholar] [CrossRef]
  7. Billingsley, P. Convergence of Probability Measures; John Wiley & Sons: New York, 1968. [Google Scholar]
  8. Bissel, C. A history of automatic control. In Springer Handbook of Automation; Nof, S.Y., Ed.; Springer, 2009; pp. 53–69. [Google Scholar]
  9. Biswas, A.; Borkar, V.S. Ergodic risk-sensitive control – a survey. Annu. Rev. Control 2023, 55, 118–141. [Google Scholar] [CrossRef]
  10. Charalambous, C.D.; Rezaei, F. Stochastic uncertain systems subject to relative entropy constraints: Induced norms and monotonicity properties of minimax games. IEEE Trans. Autom. Contr. 2007, 52, 647–663. [Google Scholar] [CrossRef]
  11. Christensen, J.P.R. On some measures analogous to Haar measure. Math. Scand. 1970, 26, 103–106. [Google Scholar] [CrossRef]
  12. Cover, T.M.; Thomas, J.A. Elements of Information Theory, 2nd ed.; Wiley: Hoboken, NJ, 2006. [Google Scholar]
  13. Diamond, P.; Kurdjukov, A.P.; Semyonov, A.V.; Vladimirov, I.G. Homotopy methods and anisotropy-based stochastic H∞-optimization of control systems. CADSMAP Research Report 97-14. 1997.
  14. Diamond, P.; Vladimirov, I.; Kurdjukov, A.; Semyonov, A. Anisotropy-based performance analysis of linear discrete time invariant control systems. Int. J. Contr. 2001, 74, 28–42. [Google Scholar] [CrossRef]
  15. Diamond, P.; Kloeden, P.E.; Vladimirov, I.G. Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattice. J. Appl. Math. Stoch. Anal. (preprint: CADSMAP Research Report 02-02, 2002). 2003, 16, 209–231. [Google Scholar] [CrossRef]
  16. Dowell, E.H. A Modern Course in Aeroelasticity, 5th Ed. ed; Springer: London, 2015. [Google Scholar]
  17. Doyle, J.C.; Glover, K.; Khargonekar, P.P.; Francis, B.A. State-space solutions to standard H2 and H∞ control problems. IEEE Trans. Autom. Contr. 1989, 34, 831–847. [Google Scholar] [CrossRef]
  18. Dunford, N.; Schwartz, J.T. Linear Operators; Interscience: New York; pp. 1958–1971.
  19. Fedoryuk, M.V. Ordinary Differential Equations, 2nd Ed. ed; Nauka: Moscow, 1985. [Google Scholar]
  20. Francis, B.A. A Course in H∞-Control Theory; Springer: Berlin, 1987. [Google Scholar]
  21. Gikhman, I.I.; Skorokhod, A.V. The Theory of Stochastic Processes; Springer: Berlin, 2004. [Google Scholar]
  22. Ginovian, M.S. On Toeplitz type quadratic functionals of stationary Gaussian processes. Probab. Theory Relat. Fields 1994, 100, 395–406. [Google Scholar] [CrossRef]
  23. Girsanov, I.V. On transforming a certain class of stochastic processes by absolutely continuous substitution of measures. Theory Probab. Appl. 1960, 5, 285–301. [Google Scholar] [CrossRef] [PubMed]
  24. Grenander, U.; Szegö, G. Toeplitz Forms and Their Applications; University of California Press: Berkeley, Los-Angeles, 1958. [Google Scholar]
  25. Gu, D.-W.; Tsai, M.C.; O’Young, S.D.; Postlethwaite, I. State-space formulae for discrete-time H∞ optimization. Int. J. Contr. 1989, 49, 1683–1723. [Google Scholar] [CrossRef]
  26. Higham, N.J. Functions of Matrices; SIAM: Philadelphia, 2008. [Google Scholar]
  27. Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: New York, 2007. [Google Scholar]
  28. Kalman, R.E. A new approach to linear filtering and prediction problems. J. Basic Eng. 1960, 82, 35–45. [Google Scholar] [CrossRef]
  29. Karatzas, I.; Shreve, S.E. Brownian Motion and Stochastic Calculus, 2nd Ed. ed; Springer: New York, 1991. [Google Scholar]
  30. Kolmanovskii, V.B.; Nosov, V.R. Stability of Functional Differential Equations; Academic Press: New York, 1986. [Google Scholar]
  31. Kolmogorov, A.N. Interpolation and extrapolation of stationary random sequences. Izv. Akad. Nauk SSSR Ser. Mat. 1941, 5, 3–14. [Google Scholar]
  32. Kurdyukov, A.P.; Maksimov, E.A. Robust stability of linear discrete stationary systems with uncertainty bounded in the anisotropic norm. Autom. Remote Contr. 2004, 65, 1977–1990. [Google Scholar] [CrossRef]
  33. Kurdyukov, A.P.; Vladimirov, I.G. Propagation of mean anisotropy of signals in filter connections. In Proceedings of the 17th IFAC World Congress, Seoul, South Korea; IFAC, 6-11 July 2008; 2008; pp. 6313–6318. [Google Scholar]
  34. Kustov, A.Yu.; Timin, V.N. Suboptimal anisotropy-based control for linear discrete time varying systems with noncentered disturbances. Proc. 20th IFAC World Congr. Fr. IFAC Pap. 2017, vol. 50(no. 1), 6122–6127. [Google Scholar] [CrossRef]
  35. Kustov, A.Yu. State-space formulas for anisotropic norm of linear discrete time varying stochastic system. In Proceedings of the 15th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), Mexico City, Mexico, 5-7 September 2018; pp. 1–6. [Google Scholar]
  36. Kustov, A.Y. Parametrization of optimal anisotropic controllers. Autom. Remote Control 2023, 84, 1055–1064. [Google Scholar] [CrossRef]
  37. Kustov, A.Y.; Yurchenkov, A.V. Anisotropy-based analysis problem for linear discrete time invariant systems with fixed-point arithmetic in control actions space. In Proceedings of the 2023 IEEE 11th International Conference on Systems and Control (ICSC), Sousse, Tunisia, 18-20 December 2023; pp. 964–968. [Google Scholar]
  38. Liptser, R.S.; Shiryaev, A.N. Statistics of Random Processes II: Applications; Springer: Berlin, 2001. [Google Scholar]
  39. Mattila, P. Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability; Cambridge University Press: Cambridge, 1995. [Google Scholar]
  40. Maximov, E.A.; Kurdyukov, A.P.; Vladimirov, I.G. Anisotropic norm bounded real lemma for linear discrete time varying systems. In Proceedings of the 18th IFAC World Congress (Milan, Italy, IFAC, 28 August - 2 September 2011; 2011; pp. 4701–4706. [Google Scholar]
  41. Mustafa, D.; Glover, K. Minimum Entropy H∞ Control; Springer-Verlag: Berlin, 1990. [Google Scholar]
  42. Nagpal, K.M.; Khargonekar, P.P. Filtering and smoothing in an H∞-setting. IEEE Trans. Autom. Contr. 1991, 36, 152–166. [Google Scholar] [CrossRef]
  43. Novikov, A.A. On an identity for stochastic integrals. Theory Probab. Its Appl. 1973, 17, 717–720. [Google Scholar] [CrossRef]
  44. Renyi, A. On measures of entropy and information. Proc. 4th Berkeley Symp. Math. Stat. Prob. 1961, I, 547–561. [Google Scholar]
  45. Robinson, F.N.H. Noise and Fluctuations in Electronic Devices and Circuits; Clarendon Press: Oxford, 1974. [Google Scholar]
  46. Rozanov, Yu.A. Stationary Random Processes; Holden-Day: San-Francisco, 1967. [Google Scholar]
  47. Semyonov, A.V.; Vladimirov, I.G.; Kurdjukov, A.P. Stochastic approach to H-infinity optimization. In Proceedings of the 33rd IEEE Conference on Decision and Control (Lake Buena Vista, Florida, USA, 14-16 Dec 1994; IEEE, 1994; 3, pp. 2249–2250. [Google Scholar]
  48. Shabat, B.V. Introduction to Complex Analysis; AMS: Providence, R.I., 1992. [Google Scholar]
  49. Shiryaev, A.N. Probability, 2nd Ed. ed; Springer: New York, 1996. [Google Scholar]
  50. Simon, B. Trace Ideals and Their Applications, 2nd Ed. ed; American Mathematical Society: Providence, RI, 2005. [Google Scholar]
  51. Stoica, A.-M.; Yaesh, I. A bounded real lemma type-result with respect to the anisotropic norm setup for stochastic systems with multiplicative noise. Automatica 2017, 84, 174–180. [Google Scholar] [CrossRef]
  52. Tchaikovsky, M.M.; Kurdyukov, A.P.; Timin, V.N. Strict anisotropic norm bounded real lemma in terms of inequalities. In Proceedings of the 18th IFAC World Congress, Milano, Italy, August 28–September 2, 2011; pp. 2332–2337. [Google Scholar]
  53. Tchaikovsky, M.M. Static output feedback anisotropic controller design by LMI-based approach: general and special cases. In Proceedings of the 2012 American Control Conference, Montreal, Canada, June 27-29, 2012; pp. 5208–5213. [Google Scholar]
  54. Tchaikovsky, M.M.; Timin, V.N.; Kustov, A.Yu.; Kurdyukov, A.P. Numerical procedures for anisotropic analysis of time-invariant systems and synthesis of suboptimal anisotropic controllers and filters. Autom. Remote Contr. 2018, 79, 128–144. [Google Scholar] [CrossRef]
  55. Timin, V.N. Anisotropy-based suboptimal filtering for the linear discrete time-invariant systems. Autom. Remote Contr. 2013, 74, 1773–1785. [Google Scholar] [CrossRef]
  56. Ugrinovskii, V.A.; Petersen, I.R. Minimax LQG control of stochastic partially observed uncertain systems. SIAM J. Contr. Optim. 2001, 40, 1189–1226. [Google Scholar] [CrossRef]
  57. Vladimirov, V.S. Methods of the Theory of Generalized Functions; Taylor & Francis: London, 2002. [Google Scholar]
  58. Vladimirov, I.G.; Kurdjukov, A.P.; Semyonov, A.V. Anisotropy of signals and entropy of linear stationary systems. Dokl. Maths 1995, 51, 388–390. [Google Scholar]
  59. Vladimirov, I.G.; Kurdjukov, A.P.; Semyonov, A.V. A stochastic problem of H∞-optimization. Dokl. Maths 1995, 52, 155–157. [Google Scholar]
  60. Vladimirov, I.G.; Kurdjukov, A.P.; Semyonov, A.V. On computing the anisotropic norm of linear discrete-time-invariant systems. In Proceedings of the 13th IFAC World Congress (San Francisco, California USA, July 1996), IFAC, 1996; pp. 179–184. [Google Scholar]
  61. Vladimirov, I.G.; Kurdjukov, A.P.; Semyonov, A.V. State-space solution to anisotropy-based stochastic H∞-optimization problem. In Proceedings of the 13th IFAC World Congress (San Francisco, California USA, July 1996), IFAC, 1996; pp. 427–432. [Google Scholar]
  62. Vladimirov, I.G.; Kurdjukov, A.P.; Semyonov, A.V. Asymptotics of the anisotropic norm of linear time-invariant systems. Autom. Remote Control 1999, 60, 359–366. [Google Scholar]
  63. Vladimirov, I.G. Anisotropy-based optimal filtering in linear discrete time invariant systems. Centre for Applied Dynamical Systems, Mathematical Analysis and Probability, The University of Queensland, Brisbane, Australia, CADSMAP Research Report 01-03, November 2001; 9 December 2014; Available online: https://arxiv.org/abs/1412.3010.
  64. Vladimirov, I.G.; Diamond, P. Robust filtering in finite horizon linear discrete time varying systems by minimum anisotropic norm criterion. CADSMAP Research Report 01-05. 2001. [Google Scholar]
  65. Vladimirov, I.G.; Diamond, P.; Kloeden, P.E. Anisotropy-based robust performance analysis of finite horizon linear discrete time varying systems. Autom. Remote Contr. (preprint: CADSMAP Research Report 01-01, 2001). 2006, 67, 1265–1282. [Google Scholar] [CrossRef]
  66. Vladimirov, I.G.; Petersen, I.R. Dissipative linear stochastic Hamiltonian systems. In Proceedings of the 2018 Australian & New Zealand Control Conference (ANZCC), Melbourne, VIC, Australia, 2018; pp. 227–232. [Google Scholar]
  67. Vladimirov, I.G. Anisotropy-based robust performance criteria for statistically uncertain linear continuous time invariant stochastic systems. arXiv. 5 March 2019. Available online: https://arxiv.org/abs/1903.01692.
  68. Vladimirov, I.G. Entropy bounds for invariant measure perturbations in stochastic systems with uncertain noise. Automatica 2026, 191(113100), 1–12. [Google Scholar] [CrossRef]
  69. Wiener, N. Extrapolation, Interpolation, and Smoothing of Stationary Time Series; Wiley: New York, 1949. [Google Scholar]
  70. Wilks, S.S. Mathematical Statistics; Wiley & Sons: London, 1962. [Google Scholar]
  71. Wilson, G.T. The factorization of matricial spectral densities. SIAM J. Appl. Math. 1972, 23, 420–426. [Google Scholar] [CrossRef]
  72. Yurchenkov, A.V.; Kustov, A.Yu.; Timin, V.N. The sensor network estimation with dropouts: anisotropy-based approach. Automatica 2023, 151, 110924. [Google Scholar] [CrossRef]
  73. Yurchenkov, A.V.; Belov, I.R. Bounded real lemma for the anisotropic norm of time-invariant systems with multiplicative noises. Differ. Equ. 2023, 59, 1557–1567. [Google Scholar] [CrossRef]
  74. Zames, G. Feedback and optimal sensitivity: model reference transformations, multiplicative seminorms and approximate inverses. IEEE Trans. Autom. Contr. 1981, 26, 301–320. [Google Scholar] [CrossRef]
  75. Zhang, J.; Friedman, E. G. Mutual inductance modeling for multiple RLC interconnects with application to shield insertion. In Proceedings of the IEEE International SOC Conference, Santa Clara, CA, USA, 2004; pp. 344–347. [Google Scholar]
Figure 1. The LCTI system F with the output Z and input W produced by a causal LCTI noise shaping filter G from the standard Wiener process V.
Figure 1. The LCTI system F with the output Z and input W produced by a causal LCTI noise shaping filter G from the standard Wiener process V.
Preprints 232557 g001
Figure 2. The noise shaping filter G described by (19) exploits the internal state X of the system F through the feedback loop specified by the matrix L, which leads to a drift in the resulting disturbance W.
Figure 2. The noise shaping filter G described by (19) exploits the internal state X of the system F through the feedback loop specified by the matrix L, which leads to a drift in the resulting disturbance W.
Preprints 232557 g002
Figure 3. The LCTI system F with the output Z and input W produced by an LCTI noise shaping filter G from the standard Wiener process V, and their filtered versions Z T , W T , V T obtained using the low-pass filter Φ . The processes Z T , W T , V T are related by the same input-output operators F, G as Z, W, V (cf. (37)–(45)).
Figure 3. The LCTI system F with the output Z and input W produced by an LCTI noise shaping filter G from the standard Wiener process V, and their filtered versions Z T , W T , V T obtained using the low-pass filter Φ . The processes Z T , W T , V T are related by the same input-output operators F, G as Z, W, V (cf. (37)–(45)).
Preprints 232557 g003
Figure 4. The block diagram of Figure 3 augmented by the linear operator Ψ (represented by double arrows) which maps the continuous-time transfer functions F, G to their discrete-time counterparts F T , G T in (84), (85). Also shown are the auxiliary random sequences ζ , ϖ , υ related by the LDTI systems F T , G T . The RMS gain of F with respect to W T in (54) is equal to that of F T with respect to ϖ in (97).
Figure 4. The block diagram of Figure 3 augmented by the linear operator Ψ (represented by double arrows) which maps the continuous-time transfer functions F, G to their discrete-time counterparts F T , G T in (84), (85). Also shown are the auxiliary random sequences ζ , ϖ , υ related by the LDTI systems F T , G T . The RMS gain of F with respect to W T in (54) is equal to that of F T with respect to ϖ in (97).
Preprints 232557 g004
Figure 5. The dependencies between the matrices under the map Υ in (122) described by (118)–(121) (the graph on the left) and its inverse Υ − 1 in (123)–(127) (the graph on the right). Here, the arrow ◯ u ⟶ ◯ v indicates dependence of v on u. For example, under the map Υ , the matrix A T depends only on A, the matrix B T depends on A and B, while the matrix D T depends on all four matrices A , B , C , D .
Figure 5. The dependencies between the matrices under the map Υ in (122) described by (118)–(121) (the graph on the left) and its inverse Υ − 1 in (123)–(127) (the graph on the right). Here, the arrow ◯ u ⟶ ◯ v indicates dependence of v on u. For example, under the map Υ , the matrix A T depends only on A, the matrix B T depends on A and B, while the matrix D T depends on all four matrices A , B , C , D .
Preprints 232557 g005
Figure 6. The worst-case noise shaping filter for the LDTI system F T with a “parasitic” feedback loop, through which the state x k of the system enters the predictable part L T x k of the Doob decomposition (104), (105), (147) of the input disturbance ϖ k .
Figure 6. The worst-case noise shaping filter for the LDTI system F T with a “parasitic” feedback loop, through which the state x k of the system enters the predictable part L T x k of the Doob decomposition (104), (105), (147) of the input disturbance ϖ k .
Preprints 232557 g006
Figure 7. A two-loop RLC circuit with inductive coupling between the loops involving two noise voltage sources.
Figure 7. A two-loop RLC circuit with inductive coupling between the loops involving two noise voltage sources.
Preprints 232557 g007
Figure 8. Singular values of the discrete-time transfer matrix F T ( z ) in (116) on the unit circle | z | = 1 parameterized by z = e i φ , with φ ∈ T from (76). The discrete-time frequency interval | φ | < π / 2 corresponds to the continuous-time frequency interval ( − Ω , Ω ) , where Ω is the cutoff frequency (25).
Figure 8. Singular values of the discrete-time transfer matrix F T ( z ) in (116) on the unit circle | z | = 1 parameterized by z = e i φ , with φ ∈ T from (76). The discrete-time frequency interval | φ | < π / 2 corresponds to the continuous-time frequency interval ( − Ω , Ω ) , where Ω is the cutoff frequency (25).
Preprints 232557 g008
Figure 9. The two-parameter anisotropic norm | | | F | | | T , a of the LCTI system F, associated with the RLC circuit, as a function of the input mean anisotropy level a ⩾ 0 for the discrete-time counterpart F T of the system.
Figure 9. The two-parameter anisotropic norm | | | F | | | T , a of the LCTI system F, associated with the RLC circuit, as a function of the input mean anisotropy level a ⩾ 0 for the discrete-time counterpart F T of the system.
Preprints 232557 g009
Figure 10. The entries of the filtered version W T (the dotted lines with time step 0.0081 ) of the worst-case noise W for the RLC circuit, shown along with the drift L X T (represented by the solid lines).
Figure 10. The entries of the filtered version W T (the dotted lines with time step 0.0081 ) of the worst-case noise W for the RLC circuit, shown along with the drift L X T (represented by the solid lines).
Preprints 232557 g010
Figure 11. The entries of the filtered version Z T of the output Z of the RLC circuit subject to the worst-case noise W.
Figure 11. The entries of the filtered version Z T of the output Z of the RLC circuit subject to the worst-case noise W.
Preprints 232557 g011
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.