2026-09-19T21:14:29Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/929722022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Pablo Parrilo. Cifuentes Pardo, Diego Fernando Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2015-01-20T15:31:15Z 2015-01-20T15:31:15Z 2014 2014 http://hdl.handle.net/1721.1/92972 900011196 Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 79-81). Chordal structure and bounded treewidth allow for efficient computation in linear algebra, graphical models, constraint satisfaction and many other areas. Nevertheless, it has not been studied whether chordality might also help solve systems of polynomials. We propose a new technique, which we refer to as chordal elimination, that relies in elimination theory and Gröbner bases. Chordal elimination can be seen as a generalization of sparse linear algebra. Unlike the linear case, the elimination process may not be exact. Nonetheless, we show that our methods are well-behaved for a large family of problems. We also use chordal elimination to obtain a good sparse description of a structured system of polynomials. By maintaining the graph structure in all computations, chordal elimination can outperform standard Gröbner basis algorithms in many cases. In particular, its computational complexity is linear for a restricted class of ideals. Chordal structure arises in many relevant applications and we propose the first method that takes full advantage of it. We demonstrate the suitability of our methods in examples from graph colorings, cryptography, sensor localization and differential equations. by Diego Fernando Cifuentes Pardo. S.M. 81 pages eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Exploiting chordal structure in systems of polynomial equations Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a35038c5-3394-422a-a49c-72782a214dab"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Exploiting chordal structure in systems of polynomial equations</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2014</PublicationDate> <Authors> <Author> <DisplayName>Cifuentes Pardo, Diego Fernando</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>Chordal structure and bounded treewidth allow for efficient computation in linear algebra, graphical models, constraint satisfaction and many other areas. Nevertheless, it has not been studied whether chordality might also help solve systems of polynomials. We propose a new technique, which we refer to as chordal elimination, that relies in elimination theory and Gröbner bases. Chordal elimination can be seen as a generalization of sparse linear algebra. Unlike the linear case, the elimination process may not be exact. Nonetheless, we show that our methods are well-behaved for a large family of problems. We also use chordal elimination to obtain a good sparse description of a structured system of polynomials. By maintaining the graph structure in all computations, chordal elimination can outperform standard Gröbner basis algorithms in many cases. In particular, its computational complexity is linear for a restricted class of ideals. Chordal structure arises in many relevant applications and we propose the first method that takes full advantage of it. We demonstrate the suitability of our methods in examples from graph colorings, cryptography, sensor localization and differential equations.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>