arXiv subjects

Martine Olivi

Publications and source records attributed to Martine Olivi.

6 recordsLinked to original sources

arXiv2019

Data-driven reference model selection and application to L-DDC design

The choice of a reference model in data-driven control techniques is a critical step. Indeed, it should represent the desired closed-loop performances and be achievable by the plant at the same time. In this paper, we propose a method to build such a reference model, both reproducible by the system and having a desired behaviour. It is applicable to Linear Time-Invariant (LTI) monovariable systems and relies on the estimation of the plant's instabilities through a data-driven stability analysis technique. The L-DDC (Loewner Data Driven Control) algorithm is used to illustrate the impact of the choice of the reference model on the control design process. Finally, the proposed choice of specifications allows to use a controller validation technique based on the small-gain theorem.

eess.SY↗

arXiv2018

Model-Free Closed-Loop Stability Analysis: A Linear Functional Approach

Performing a stability analysis during the design of any electronic circuit is critical to guarantee its correct operation. A closed-loop stability analysis can be performed by analysing the impedance presented by the circuit at a well-chosen node without internal access to the simulator. If any of the poles of this impedance lie in the complex right half-plane, the circuit is unstable. The classic way to detect unstable poles is to fit a rational model on the impedance. In this paper, a projection-based method is proposed which splits the impedance into a stable and an unstable part by projecting on an orthogonal basis of stable and unstable functions. When the unstable part lies significantly above the interpolation error of the method, the circuit is considered unstable. Working with a projection provides one, at small cost, with a first appraisal of the unstable part of the system. Both small-signal and large-signal stability analysis can be performed with this projection-based method. In the small-signal case, a low-order rational approximation can be fitted on the unstable part to find the location of the unstable poles.

eess.SY↗

arXiv2011

Minimal symmetric Darlington synthesis

We consider the symmetric Darlington synthesis of a p x p rational symmetric Schur function S with the constraint that the extension is of size 2p x 2p. Under the assumption that S is strictly contractive in at least one point of the imaginary axis, we determine the minimal McMillan degree of the extension. In particular, we show that it is generically given by the number of zeros of odd multiplicity of I-SS*. A constructive characterization of all such extensions is provided in terms of a symmetric realization of S and of the outer spectral factor of I-SS*. The authors's motivation for the problem stems from Surface Acoustic Wave filters where physical constraints on the electro-acoustic scattering matrix naturally raise this mathematical issue.

math.OC↗

arXiv2010

Nudelman interpolation, parametrizations of lossless functions and balanced realizations

We investigate the parametrization issue for discrete-time stable all-pass multivariable systems by means of a Schur algorithm involving a Nudelman interpolation condition. A recursive construction of balanced realizations is associated with it, that possesses a very good numerical behavior. Several atlases of charts or families of local parametrizations are presented and for each atlas a chart selection strategy is proposed. The last one can be viewed as a nice mutual encoding property of lossless functions and turns out to be very efficient. These parametrizations allow for solving optimization problems within the fields of system identification and optimal control.

math.OC↗

arXiv2010

Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm

In this paper, the connections are investigated between two different approaches towards the parametrization of multivariable stable all-pass systems in discrete-time. The first approach involves the tangential Schur algorithm, which employs linear fractional transformations. It stems from the theory of reproducing kernel Hilbert spaces and enables the direct construction of overlapping local parametrizations using Schur parameters and interpolation points. The second approach proceeds in terms of state-space realizations. In the scalar case, a balanced canonical form exists that can also be parametrized by Schur parameters. This canonical form can be constructed recursively, using unitary matrix operations. Here, this procedure is generalized to the multivariable case by establishing the connections with the first approach. It gives rise to balanced realizations and overlapping canonical forms directly in terms of the parameters used in the tangential Schur algorithm.

math.OC↗

arXiv2010

Canonical lossless state-space systems: Staircase forms and the Schur algorithm

A new finite atlas of overlapping balanced canonical forms for multivariate discrete-time lossless systems is presented. The canonical forms have the property that the controllability matrix is positive upper triangular up to a suitable permutation of its columns. This is a generalization of a similar balanced canonical form for continuous-time lossless systems. It is shown that this atlas is in fact a finite sub-atlas of the infinite atlas of overlapping balanced canonical forms for lossless systems that is associated with the tangential Schur algorithm; such canonical forms satisfy certain interpolation conditions on a corresponding sequence of lossless transfer matrices. The connection between these balanced canonical forms for lossless systems and the tangential Schur algorithm for lossless systems is a generalization of the same connection in the SISO case that was noted before. The results are directly applicable to obtain a finite sub-atlas of multivariate input-normal canonical forms for stable linear systems of given fixed order, which is minimal in the sense that no chart can be left out of the atlas without losing the property that the atlas covers the manifold.

math.OC↗