Discretisation of sparse linear systems: An optimisation approach

Author(s)

Souza, M. ^{[1, 2]} ; Geromel, J. C. ^[1] ; Colaneri, P. ^[3] ; Shorten, R. N. ^{[4, 2, 5]}

Affiliation

^[1] Univ Estadual Campinas, Sch Elect & Comp Engn, Campinas, SP - Brazil

^[2] Natl Univ Ireland Maynooth, Hamilton Inst, Maynooth, Kildare - Ireland

^[3] Politecn Milan, Dipartimento Elettron Informaz & Bioingn, I-20133 Milan - Italy

^[4] Univ Coll Dublin, Dublin 2 - Ireland

^[5] IBM Res Ireland, Dublin - Ireland

• Document type: Journal article
• Source: SYSTEMS & CONTROL LETTERS; v. 80, p. 42-49, JUN 2015.
• Web of Science Citations: 2

Abstract

This paper addresses the discretisation problem for sparse linear systems. Classical methods usually destroy sparsity patterns of continuous-time systems. We develop an optimisation procedure that yields the best approximation to the discrete-time dynamical matrix with a prescribed sparsity pattern and subject to stability and other constraints. By formulating this problem in an adequate manner, tools from convex optimisation can be then applied. Error bounds for the approximation are provided for special classes of matrices. Numerical examples are included. (c) 2015 Elsevier B.V. All rights reserved. (AU)

• FAPESP's process: 12/02781-7 - Control and State Estimation of Networked Dynamical Systems
• Grantee: Matheus Souza
• Support Opportunities: Scholarships in Brazil - Doctorate