Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/428374
Title: | Linear Dynamical Systems with Sparsity Constraints Theory and Algorithms |
Researcher: | Joseph, Geethu |
Guide(s): | Murthy, Chandra R |
Keywords: | Engineering Engineering and Technology Engineering Electrical and Electronic |
University: | Indian Institute of Science Bangalore |
Completed Date: | 2019 |
Abstract: | This thesis develops new mathematical theory and presents novel recovery algorithms for discrete linear dynamical systems (LDS) with sparsity constraints on either control inputs or initial state. The recovery problems in this framework manifest as the problem of reconstructing one or more sparse signals from a set of noisy underdetermined linear measurements. The goal of our work is to design algorithms for sparse signal recovery which can exploit the underlying structure in the measurement matrix and the unknown sparse vectors, and to analyze the impact of these structures on the efficacy of the recovery. We answer three fundamental and interconnected questions on sparse signal recovery problems that arise in the context of LDS. First, what are necessary and sufficient conditions for the existence of a sparse solution? Second, given that a sparse solution exists, what are good low-complexity algorithms that exploit the underlying signal structure? Third, when are these algorithms guaranteed to succeed? These questions are considered in the context of three different sparsity models, as described below. Within the LDS framework, we first consider the simplest sparsity model of a single unknown sparse initial state vector with no additional structure. This problem is known as the observability problem in the control theory literature, and the initial state can be recovered using standard compressed sensing (CS) algorithms. However, the recovery guarantees for this case are different from the classical sparse recovery guarantees because the measurement matrix that arises in LDS is fundamentally different from the matrices that are typically considered in the CS literature. We seek to obtain the conditions for observability of LDS when the initial state is sparse and the observation matrix is random. Taking advantage of randomness in the measurements, we use concentration inequalities to derive an upper bound on the minimum number of measurements that can ensure faithful recovery of the sparse initial state... |
Pagination: | xvi, 270 |
URI: | http://hdl.handle.net/10603/428374 |
Appears in Departments: | Electrical Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 61.3 kB | Adobe PDF | View/Open |
02_prelim pages.pdf | 381.91 kB | Adobe PDF | View/Open | |
03_table of contents.pdf | 143.26 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 51.02 kB | Adobe PDF | View/Open | |
05_chapter 1.pdf | 260.66 kB | Adobe PDF | View/Open | |
06_chapter 2.pdf | 391.34 kB | Adobe PDF | View/Open | |
07_chapter 3.pdf | 383.23 kB | Adobe PDF | View/Open | |
08_chapter 4.pdf | 537.41 kB | Adobe PDF | View/Open | |
09_chapter 5.pdf | 363.55 kB | Adobe PDF | View/Open | |
10_chapter 6.pdf | 498.23 kB | Adobe PDF | View/Open | |
11_chapter 7.pdf | 508.08 kB | Adobe PDF | View/Open | |
12_annexure.pdf | 571.21 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 190.41 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: