{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/101738"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/101738","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Sparse matrix spaces","abstract":"This thesis addresses theoretical questions that arise in the design and control of decentralized multi-agent systems. These systems are characterized by their communication, or network, topology, which indicates which agents a given agent can communicate with. An important problem, which occurs for example in information transmission and distributed computations, is the design of a control system based on a given network topology. In this work, we study the following related question: for a specified network topology, can one find a set of interaction laws that yield stable dynamics for the ensemble of agents? We restrict our analysis to systems with strictly linear dynamics. In mathematical terms, we consider vector spaces of real square matrices for which every entry is either fixed at zero, or an arbitrary real number. We call them sparse matrix spaces, abbreviated SMS, and examine under what conditions they contain matrices for which all eigenvalues have strictly negative real parts. We call an SMS with this property stable. We start by reviewing the necessary background from control theory and graph theory. Then we discuss some general results related to sparse matrix spaces, and then focus on SMSs which have symmetric structure, that is, all fixed at zero entries are symmetric with respect to the main diagonal. Using graph theory techniques, we derive necessary and sufficient conditions which determine whether a given symmetric SMS is stable. Finally, we present a result by Lin (1974), in which the author considers pairs of sparse matrix spaces and studies under what conditions one can find two matrices in them, which form a controllable pair.","abstract_html":"This thesis addresses theoretical questions that arise in the design and control of decentralized multi-agent systems. These systems are characterized by their communication, or network, topology, which indicates which agents a given agent can communicate with. An important problem, which occurs for example in information transmission and distributed computations, is the design of a control system based on a given network topology. In this work, we study the following related question: for a specified network topology, can one find a set of interaction laws that yield stable dynamics for the ensemble of agents? We restrict our analysis to systems with strictly linear dynamics. In mathematical terms, we consider vector spaces of real square matrices for which every entry is either fixed at zero, or an arbitrary real number. We call them sparse matrix spaces, abbreviated SMS, and examine under what conditions they contain matrices for which all eigenvalues have strictly negative real parts. We call an SMS with this property stable. We start by reviewing the necessary background from control theory and graph theory. Then we discuss some general results related to sparse matrix spaces, and then focus on SMSs which have symmetric structure, that is, all fixed at zero entries are symmetric with respect to the main diagonal. Using graph theory techniques, we derive necessary and sufficient conditions which determine whether a given symmetric SMS is stable. Finally, we present a result by Lin (1974), in which the author considers pairs of sparse matrix spaces and studies under what conditions one can find two matrices in them, which form a controllable pair.","abstract_has_math":false,"creators":["Kirkoryan, Artur"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Belabbas, Mohamed-Ali"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018-09-27T16:45:26Z","date_published":"2018-09-27T16:45:26Z","updated_at":"2026-07-22T22:24:40Z","subjects":["SMS, stability"],"languages":["en"],"rights":["Copyright 2018 Artur Kirkoryan"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/101738","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Belabbas, Mohamed-Ali"]},{"key":"dc:creator","label":"Author","values":["Kirkoryan, Artur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2018-09-27T16:45:26Z","2020-09-28T09:15:22Z","2017-12-13","2018-08"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["SMS, stability"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2018 Artur Kirkoryan"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/101738"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis addresses theoretical questions that arise in the design and control of decentralized multi-agent systems. These systems are characterized by their communication, or network, topology, which indicates which agents a given agent can communicate with. An important problem, which occurs for example in information transmission and distributed computations, is the design of a control system based on a given network topology. In this work, we study the following related question: for a specified network topology, can one find a set of interaction laws that yield stable dynamics for the ensemble of agents? We restrict our analysis to systems with strictly linear dynamics. In mathematical terms, we consider vector spaces of real square matrices for which every entry is either fixed at zero, or an arbitrary real number. We call them sparse matrix spaces, abbreviated SMS, and examine under what conditions they contain matrices for which all eigenvalues have strictly negative real parts. We call an SMS with this property stable. We start by reviewing the necessary background from control theory and graph theory. Then we discuss some general results related to sparse matrix spaces, and then focus on SMSs which have symmetric structure, that is, all fixed at zero entries are symmetric with respect to the main diagonal. Using graph theory techniques, we derive necessary and sufficient conditions which determine whether a given symmetric SMS is stable. Finally, we present a result by Lin (1974), in which the author considers pairs of sparse matrix spaces and studies under what conditions one can find two matrices in them, which form a controllable pair.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2020-08-01","The student, Artur Kirkoryan, accepted the attached license on 2017-12-13 at 11:22.","The student, Artur Kirkoryan, submitted this Thesis for approval on 2017-12-13 at 11:27.","This Thesis was approved for publication on 2017-12-13 at 13:25.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11969 on 2018-09-27 at 11:32:39","Made available in DSpace on 2018-09-27T16:45:26Z (GMT). No. of bitstreams: 2 KIRKORYAN-THESIS-2018.pdf: 276612 bytes, checksum: 0ffe0b868f1a31218af1cb53092173e0 (MD5) LICENSE.txt: 4212 bytes, checksum: bac2aa965183844be7ca3c0c5a476308 (MD5) Previous issue date: 2017-12-13","Embargo set by: Seth Robbins for item 107838 Lift date: 2020-09-27T16:45:39Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 107838 Lift date: 2020-09-27T16:47:41Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 107838 on 2020-09-28T09:15:22Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Sparse matrix spaces"]}]}],"canonical_facts":{"dc:contributor":["Belabbas, Mohamed-Ali"],"dc:creator":["Kirkoryan, Artur"],"dc:date":["2018-09-27T16:45:26Z","2020-09-28T09:15:22Z","2017-12-13","2018-08"],"dc:description":["This thesis addresses theoretical questions that arise in the design and control of decentralized multi-agent systems. These systems are characterized by their communication, or network, topology, which indicates which agents a given agent can communicate with. An important problem, which occurs for example in information transmission and distributed computations, is the design of a control system based on a given network topology. In this work, we study the following related question: for a specified network topology, can one find a set of interaction laws that yield stable dynamics for the ensemble of agents? We restrict our analysis to systems with strictly linear dynamics. In mathematical terms, we consider vector spaces of real square matrices for which every entry is either fixed at zero, or an arbitrary real number. We call them sparse matrix spaces, abbreviated SMS, and examine under what conditions they contain matrices for which all eigenvalues have strictly negative real parts. We call an SMS with this property stable. We start by reviewing the necessary background from control theory and graph theory. Then we discuss some general results related to sparse matrix spaces, and then focus on SMSs which have symmetric structure, that is, all fixed at zero entries are symmetric with respect to the main diagonal. Using graph theory techniques, we derive necessary and sufficient conditions which determine whether a given symmetric SMS is stable. Finally, we present a result by Lin (1974), in which the author considers pairs of sparse matrix spaces and studies under what conditions one can find two matrices in them, which form a controllable pair.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2020-08-01","The student, Artur Kirkoryan, accepted the attached license on 2017-12-13 at 11:22.","The student, Artur Kirkoryan, submitted this Thesis for approval on 2017-12-13 at 11:27.","This Thesis was approved for publication on 2017-12-13 at 13:25.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11969 on 2018-09-27 at 11:32:39","Made available in DSpace on 2018-09-27T16:45:26Z (GMT). No. of bitstreams: 2 KIRKORYAN-THESIS-2018.pdf: 276612 bytes, checksum: 0ffe0b868f1a31218af1cb53092173e0 (MD5) LICENSE.txt: 4212 bytes, checksum: bac2aa965183844be7ca3c0c5a476308 (MD5) Previous issue date: 2017-12-13","Embargo set by: Seth Robbins for item 107838 Lift date: 2020-09-27T16:45:39Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 107838 Lift date: 2020-09-27T16:47:41Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited Restriction Lifted for Item 107838 on 2020-09-28T09:15:22Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/101738"],"dc:language":["en"],"dc:rights":["Copyright 2018 Artur Kirkoryan"],"dc:subject":["SMS, stability"],"dc:title":["Sparse matrix spaces"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:40Z"}