{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/28724"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/28724","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Model reduction through an Hankel problem and finite state machines","abstract":"(cont.) computation required to produce the approximation is O((n2̂)/[epsilon]) where [epsilon] is the desired ℓ[omega] error and n is the original system order.","abstract_html":"(cont.) computation required to produce the approximation is O((n2̂)/[epsilon]) where [epsilon] is the desired ℓ[omega] error and n is the original system order.","abstract_has_math":false,"creators":["Jameson, Neal Ward, 1978-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Alex Megretski."],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004","date_published":"2004","updated_at":"2026-07-22T22:21:28Z","subjects":["Electrical Engineering and Computer Science."],"languages":["en_US"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/28724","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Alex Megretski."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Jameson, Neal Ward, 1978-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-09-27T17:59:40Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-09-27T17:59:40Z"]},{"key":"dc:date.issued","label":"Date","values":["2004"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/28724"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 30)."]},{"key":"dc:description.abstract","label":"Abstract","values":["(cont.) computation required to produce the approximation is O((n2̂)/[epsilon]) where [epsilon] is the desired ℓ[omega] error and n is the original system order.","The problem of linear time invariant model reduction seeks to transform a given model into a model that has fidelity to the original but allows for easier completion of desired tasks such as controller design and simulation. Hankel-norm approximation consistently performs very well in terms of H[omega] error and provides lower bounds on how well any model can approximate the given model; however, it requires substantial and sometimes prohibitive computation to produce the reduced system and calculate the lower bounds. Here we present a Hankel like approximation problem that allows easier computation of lower bounds. It is shown that the lower bounds produced by the new method do a reasonable job of approximating the lower bounds produced by Hankel-norm approximation. On the negative side, It is also shown that, for the new Hankel problem, there can be no theorem analogous to the major theorem of Hankel-norm approximation that actually produces a reduced model. For nonlinear model reduction, model order does not always predict how difficult it is to perform desired tasks, so we introduce the idea of using finite state machines to approximate models. Lower state count for a finite machine indicates lower computational time to perform many tasks. First, we show, through finite state machine approximation of (1/s+1), that finite state machines are feasible as approximations. That is to say that the amount of states required to approximate a system does not blow up as desired fidelity is increased. We then show that for a given class of linear time invariant models we can set a desired ℓ[omega] error and then find the finite state machine with the minimal number of states that achieves the desired error level. Moreover, the"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Model reduction through an Hankel problem and finite state machines"]}]}],"canonical_facts":{"dc:contributor.advisor":["Alex Megretski."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Jameson, Neal Ward, 1978-"],"dc:date.accessioned":["2005-09-27T17:59:40Z"],"dc:date.available":["2005-09-27T17:59:40Z"],"dc:date.issued":["2004"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 30)."],"dc:description.abstract":["(cont.) computation required to produce the approximation is O((n2̂)/[epsilon]) where [epsilon] is the desired ℓ[omega] error and n is the original system order.","The problem of linear time invariant model reduction seeks to transform a given model into a model that has fidelity to the original but allows for easier completion of desired tasks such as controller design and simulation. Hankel-norm approximation consistently performs very well in terms of H[omega] error and provides lower bounds on how well any model can approximate the given model; however, it requires substantial and sometimes prohibitive computation to produce the reduced system and calculate the lower bounds. Here we present a Hankel like approximation problem that allows easier computation of lower bounds. It is shown that the lower bounds produced by the new method do a reasonable job of approximating the lower bounds produced by Hankel-norm approximation. On the negative side, It is also shown that, for the new Hankel problem, there can be no theorem analogous to the major theorem of Hankel-norm approximation that actually produces a reduced model. For nonlinear model reduction, model order does not always predict how difficult it is to perform desired tasks, so we introduce the idea of using finite state machines to approximate models. Lower state count for a finite machine indicates lower computational time to perform many tasks. First, we show, through finite state machine approximation of (1/s+1), that finite state machines are feasible as approximations. That is to say that the amount of states required to approximate a system does not blow up as desired fidelity is increased. We then show that for a given class of linear time invariant models we can set a desired ℓ[omega] error and then find the finite state machine with the minimal number of states that achieves the desired error level. Moreover, the"],"dc:description.degree":["S.M."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/28724"],"dc:language.iso":["en_US"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Model reduction through an Hankel problem and finite state machines"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:28Z"}