Search

Computing analytic B\'ezout identities remains a difficult task, which has many applications in control theory. Flat PDE systems have cast a new light on this problem. We consider here a simple case of special interest: a rod of length $a+b$, insulated at both ends and heated at point $x=a$. The case $a=0$ is classical, the temperature of the other end $\theta(b,t)$ being then a flat output, with parametrization $\theta(x,t)=\cosh((b-x)(\partial/\partial t)^{1/2}\theta(b,t)$. When $a$ and $b$ are integers, with $a$ odd and $b$ even, the system is flat and the flat output is obtained from the B\'ezout identity $f(x)\cosh(ax)+g(x)\cosh(bx)=1$, the omputation of which boils down to a B\'ezout identity of Chebyshev polynomials. But this form is not the most efficient and a smaller expression $f(x)=\sum_{k=1}^{n} c_{k}\cosh(kx)$ may be computed in linear time. These results are compared with an approximations by a finite system, using a classical discretization. We provide experimental computations, approximating a non rational value $r$ by a sequence of fractions $b/a$, showing that the power series for the B\'ezout relation seems to converge., Comment: 24 pages, 5 figures

We consider flat differential control systems for which there exist flat outputs that are part of the state variables and study them using Jacobi bound. We introduce a notion of saddle Jacobi bound for an ordinary differential system of $n$ equations in $n+m$ variables. Systems with saddle Jacobi number equal to $0$ generalize various notions of chained and diagonal systems and form the widest class of systems admitting subsets of state variables as flat output, for which flat parametrization may be computed without differentiating the initial equations. We investigate apparent and intrinsic flat singularities of such systems. As an illustration, we consider the case of a simplified aircraft model, providing new flat outputs and showing that it is flat at all points except possibly in stalling conditions. Finally, we present numerical simulations showing that a feedback using those flat outputs is robust to perturbations and can also compensate model errors, when using a more realistic aerodynamic model., Comment: 41 pages, 8 figures

Aircraft models may be considered as flat if one neglects some terms associated to aerodynamics. Computational experiments in Maple show that in some cases a suitably designed feed-back allows to follow such trajectories, when applied to the non-flat model. However some maneuvers may be hard or even impossible to achieve with this flat approximation. In this paper, we propose an iterated process to compute a more achievable trajectory, starting from the flat reference trajectory. More precisely, the unknown neglected terms in the flat model are iteratively re-evaluated using the values obtained at the previous step. This process may be interpreted as a new trajectory parametrization, using an infinite number of derivatives, a property that may be called \emph{generalized flatness}. We illustrate the pertinence of this approach in flight conditions of increasing difficulties, from single engine flight, to aileron roll., Comment: 28 pages, 11 figures

A generalization of L{\"u}roth's theorem expresses that every transcendence degree 1 subfield of the rational function field is a simple extension. In this note we show that a classical proof of this theorem also holds to prove this generalization., Comment: 5 pages

Jacobi's results on the computation of the order and of the normal forms of a differential system are translated in the formalism of differential algebra. In the quasi-regular case, we give complete proofs according to Jacobi's arguments. The main result is {\it Jacobi's bound}, still conjectural in the general case: the order of a differential system $P_{1}, \ldots, P_{n}$ is not greater than the maximum $\cal O$ of the sums $\sum_{i=1}^{n} a_{i,\sigma(i)}$, for all permutations $\sigma$ of the indices, where $a_{i,j}:={\rm ord}_{x_{j}}P_{i}$, \emph{viz.}\ the \emph{tropical determinant of the matrix $(a_{i,j})$}. The order is precisely equal to $\cal O$ iff Jacobi's \emph{truncated determinant} does not vanish. Jacobi also gave a polynomial time algorithm to compute $\cal O$, similar to Kuhn's "Hungarian method" and some variants of shortest path algorithms, related to the computation of integers $\ell_{i}$ such that a normal form may be obtained, in the generic case, by differentiating $\ell_{i}$ times equation $P_{i}$. Fundamental results about changes of orderings and the various normal forms a system may have, including differential resolvents, are also provided., Comment: 104 pages, 10 figures, index of words and names, index of notations

We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear polynomials; this result is here extended to a product of linear differential polynomials depending of the same arbitrary differential polynomial., Comment: 12 pages. In French. With an extended abstract in English

We study the set of intrinsic singularities of flat affine systems with $n-1$ controls and $n$ states using the notion of Lie-B\"acklund atlas, previously introduced by the authors. For this purpose, we prove two easily computable sufficient conditions to construct flat outputs as a set of independent first integrals of distributions of vector fields, the first one in a generic case, namely in a neighborhood of a point where the $n-1$ control vector fields are independent, and the second one at a degenerate point where $p-1$ control vector fields are dependent of the $n-p$ others, with $p>1$. We show that the set of intrinsic singularities includes the set of points where the system does not satisfy the strong accessibility rank condition and is included in the set where the distribution of vector fields, introduced in the generic case, is singular. We conclude this analysis by three examples of apparent singularites of flat systems in generic and non generic degenerate cases., Comment: 24 pages

Many familiar events feature a distinctive sound: paper crumpling or tearing, squeaking doors, drumming rain or boiling water. Such characteristic sounds actually carry a profusion of informations about the fleeting physical processes at the root of acoustic emission, which appears appealing especially in situations precluding direct or in-situ measurements, such as e.g. the rupture of micron-thick liquid sheet. Here we report on such a link between fast interfacial hydrodynamics and sound. The acoustic emission of a bursting soap bubble is captured by means of antennae and deciphered with the conceptual framework of aeroacoustics. This reveals that capillary forces, thin-film hydrodynamics, but also out-of-equilibrium surfactants dynamics all shape the capillary burst sound. Whereas ultra-fast imagery only captures the shapes of flows, the acoustic signature radiated by hydrodynamical forces offers a timely complement for it allows a direct experimental access to these dynamical quantities., Comment: 6 pages, 3 figures

We investigate the automatic differentiation of hybrid models, viz. models that may contain delays, logical tests and discontinuities or loops. We consider differentiation with respect to parameters, initial conditions or the time. We emphasize the case of a small number of derivations and iterated differentiations are mostly treated with a foccus on high order iterations of the same derivation. The models we consider may involve arithmetic operations, elementary functions, logical tests but also more elaborate components such as delays, integrators, equations and differential equations solvers. This survey has no pretention to exhaustivity but tries to fil a gap in the litterature where each kind of of component may be documented, but seldom their common use. The general approach is illustrated by computer algebra experiments, stressing the interest of performing differentiation, whenever possible, on high level objects, before any translation in Fortran or C code. We include ordinary differential systems with discontinuity, with a special interest for those comming from discontinuous Lagrangians. We conclude with an overview of the graphic methodology developped in the Diffedge software for Simulink hybrid models. Not all possibilities are covered, but the methodology can be adapted. The result of automatic differentiation is a new block diagram and so it can be easily translated to produce real time embedded programs. We welcome any comments or suggestions of references that we may have missed., Comment: 47 p. Source files from computer experiments available

Un sous-syst\`eme de dimension diff\'erentielle au plus 2 d'une extension plate est plate. Si un tel syst\`eme plat est stationnaire, il admet des sorties plates ind\'ependantes du temps. A subsystem of a flat system of differential dimension at most 2 is flat. Furthermore, if such a flat system is stationary, we show that there exist flat utputs not depending on the time., Comment: 12 pages, in French. With an extended English abstract. A second version where the proof of the main theorem has been corrected using an extended new version of Rouchon's lemma

Noise pollution investigation takes advantage of two common methods of diagnosis: measurement using a Sound Level Meter and acoustical imaging. The former enables a detailed analysis of the surrounding noise spectrum whereas the latter is rather used for source localization. Both approaches complete each other, and merging them into a unique system, working in realtime, would offer new possibilities of dynamic diagnosis. This paper describes the design of a complete system for this purpose: imaging in realtime the acoustic field at different octave bands, with a convenient device. The acoustic field is sampled in time and space using an array of MEMS microphones. This recent technology enables a compact and fully digital design of the system. However, performing realtime imaging with resource-intensive algorithm on a large amount of measured data confronts with a technical challenge. This is overcome by executing the whole process on a Graphic Processing Unit, which has recently become an attractive device for parallel computing.

This paper presents a complete strategy for the geometry estimation of large microphone arrays of arbitrary shape. Largeness is intended here in both number of microphones (hundreds) and size (few meters). Such arrays can be used for various applications in open or confined spaces like acoustical imaging, source identification, or speech processing. For so large array systems,measuring the geometry by hand is impractical. Therefore a blind passive method is proposed. It is based on the analysis of the background acoustic noise, supposed to be a diffuse field. The proposed strategy is a two-step process. First the pairwise microphone distances are identified by matching their measured coherence function to the one predicted by the diffuse field theory. Second, a robust multidimensional scaling(MDS) algorithm is adapted and implemented. It takes advantage of local characteristics to reduce the set of distances and infer the geometry of the array. This work is an extension of previous studies, and it overcomes unsolved drawbacks. In particular it deals efficiently with the outliers known to ruin standard MDS algorithms. Experimental proofs of this ability are presented by treating the case of two arrays. They show that the proposed improvements manage large spatial arrays.

Regularization of the inverse problem is a complex issue when using Near-field Acoustic Holography (NAH) techniques to identify the vibrating sources. This paper shows that, for convex homogeneous plates with arbitrary boundary conditions, new regularization schemes can be developed, based on the sparsity of the normal velocity of the plate in a well-designed basis, i.e. the possibility to approximate it as a weighted sum of few elementary basis functions. In particular, these new techniques can handle discontinuities of the velocity field at the boundaries, which can be problematic with standard techniques. This comes at the cost of a higher computational complexity to solve the associated optimization problem, though it remains easily tractable with out-of-the-box software. Furthermore, this sparsity framework allows us to take advantage of the concept of Compressive Sampling: under some conditions on the sampling process (here, the design of a random array, which can be numerically and experimentally validated), it is possible to reconstruct the sparse signals with significantly less measurements (i.e., microphones) than classically required. After introducing the different concepts, this paper presents numerical and experimental results of NAH with two plate geometries, and compares the advantages and limitations of these sparsity-based techniques over standard Tikhonov regularization., Comment: Journal of the Acoustical Society of America (2012)

This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely algebraic (polynomial) equation plus an under-determined ODE (that is, a semi-explicit DAE system of differentiation index 1) in as many variables as the order of the input system. This can be done by means of a Kronecker-type algorithm with bounded complexity.

Jacobi is one of the most famous mathematicians of his century. His name is attached to many results in various fields of mathematics and his complete works in seven volumes have been available since the end of the XIXth century and are very often quoted in many papers. It is then surprising that some of his results may have fallen into oblivion, at least in part. We will try to describe some of Jacobi's results on ordinary differential equations and the available, published or unpublished material he left. We will then expose the selective interests of his followers and their own contributions. There are in fact many interrelated results: a bound on the order of a differential system, a necessary and sufficient condition, given by a determinant, for the bound to be reached, an algorithm to compute the bound in polynomial time, and processes for computing normal forms using as few derivatives as possible. We give for all of them the form under which they could have been proved or rediscovered, sometimes independently of Jacobi's findings. In conclusion, we give the state of the art and suggest some possible applications of Jacobi's bound to improve some algorithms in differential algebra., Comment: 23 pages, submitted to DART II proceedings This new version includes new historical precisions in section 7 "The assignment problem" about the death of Egervary (note 17). Some typos and references were corrected

We show that Jacobi's bound for the order of a system of ordinary differential equations stands in the case of a diffiety defined by a quasi-regular system. We extend the result when there are less equations than variables and characterize the case when the bound is reached., Comment: 6 pages, submitted to the CRAS de Paris

We provide a class of methods for the identification of a linear system with delay of the shape $x^{(n)}(t) = \sum_{i=0}^{n-1}a_{i}x^{(i)}(t) + bu(t-h)$. They allow the simultaneous identification of the parameters and delay, the observation of $x$ and its derivatives, knowing only generic input $u$ and output $x$. They are robust to the noise. Used in continuous time, they may follow the evolution of slowly varying parameters and noise. The method may be generalized to systems with two or more delays, e.g. $x''(t)+ax(t-h_{1})=bu(t-h_{2})$., Comment: 8 pages, 10 figures, 3 tables, extended version of a note submitted to the CRAS de Paris

We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is quasi-linear with respect to N. Similar results are also given in the non-linear case. This extends previous results obtained by Brent and Kung for scalar differential equations of order one and two.