Skip to Main content Skip to Navigation
Conference papers

Left-invertibility under sparse assumption: the linear case

Abstract : This paper deals with the issue of dynamical left-invertibility for linear continuous-time dynamical systems. More precisely, we provide sufficient conditions in order to estimate unknown inputs, using known outputs, under sparse input assumptions for linear continuoustime dynamical systems that are not necessarily square. In fact, there exists an algorithm in the literature that allows verification of leftinvertibility for linear square systems; that is, systems with p known outputs and p unknown inputs. However, a similar algorithm does not exist for the rectangular case, where the number of inputs is much larger than the number of outputs. In this paper, we first use the square case algorithm as a stepping stone in order to propose a new algorithm for the rectangular case. However, it shown that even if the proposed algorithm converges successfully, it is not sufficient to estimate the unknown inputs. Consequently, it has been deemed necessary to include a sparse input assumption and to verify the wellknown Restrictive Isometric Property (RIP) conditions of a specific matrix. Finally, an academic example is given in order to highlight the feasibility of the proposed approach.
Document type :
Conference papers
Complete list of metadata
Contributor : Jean-Pierre Barbot <>
Submitted on : Wednesday, July 7, 2021 - 4:44:27 PM
Last modification on : Thursday, July 22, 2021 - 3:31:55 AM


Files produced by the author(s)


  • HAL Id : hal-03280876, version 1


Jean-Pierre Barbot, Krishna Busawon, C Edwards. Left-invertibility under sparse assumption: the linear case. European Control Conference, ECC21, Jun 2021, Rotterdam, Netherlands. ⟨hal-03280876⟩



Record views