{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/39893"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/39893","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Parameter sensitivity, estimation and convergence: an information approach","abstract":"Convergence rates are analyzed for Recursive Prediction (Output) Error Methods (RPEM) in the identification of linear state-space systems from (noisy) impulse response data) RPEM algorithms are derived which are suitable for the identification of the parameters in arbitrary state-space structures. Deterministic and stochastic versions of these identification algorithms are presented. These two classes indicate the number of realizations used in the identification, not the presence or absence of noise. The convergence analysis uses the eigen-information of the correlation matrix (really its inverse, the Fisher information matrix) for a chosen parameterization. This analysis explains why various state-space structures have different convergence properties, 1.e., why for the same system the estimation processes corresponding to different identification structures converge at different rates. The eigen-information of the parameter information matrix relates the system sensitivity and numerical conditioning in a manner which provides insight into the identification process. The relevant eigen-information is combined in the proposed scalar convergence time constant +. One important result is that identification of the usually identified direct form II parameters (the standard ARMA parameters) does not necessarily yield the fastest parameter set convergence for the system being identified. Identification from arbitrary input is also briefly considered, as is identification when the model order is different from the “true” system order.","abstract_html":"Convergence rates are analyzed for Recursive Prediction (Output) Error Methods (RPEM) in the identification of linear state-space systems from (noisy) impulse response data) RPEM algorithms are derived which are suitable for the identification of the parameters in arbitrary state-space structures. Deterministic and stochastic versions of these identification algorithms are presented. These two classes indicate the number of realizations used in the identification, not the presence or absence of noise. The convergence analysis uses the eigen-information of the correlation matrix (really its inverse, the Fisher information matrix) for a chosen parameterization. This analysis explains why various state-space structures have different convergence properties, 1.e., why for the same system the estimation processes corresponding to different identification structures converge at different rates. The eigen-information of the parameter information matrix relates the system sensitivity and numerical conditioning in a manner which provides insight into the identification process. The relevant eigen-information is combined in the proposed scalar convergence time constant +. One important result is that identification of the usually identified direct form II parameters (the standard ARMA parameters) does not necessarily yield the fastest parameter set convergence for the system being identified. Identification from arbitrary input is also briefly considered, as is identification when the model order is different from the “true” system order.","abstract_has_math":false,"creators":["DeBrunner, Victor Earl"],"institution":"Virginia Tech","degree_name":"Ph. D.","degree_level":"doctoral","degree_discipline":"Electrical Engineering","degree_department":"Electrical Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":["Beex, A. A. Louis"],"committee_members":["Beattie, Christopher A.","Bingular, Stanoje P.","Lindner, Douglas K.","Riad, Sedki Mohamed"],"year":1990,"date_issued":"1990-04-18","date_published":"1990-04-18","updated_at":"2026-07-22T22:19:19Z","subjects":[],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-10142005-135736"],"render_values":[{"text":"etd-10142005-135736","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/39893","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Beex, A. A. Louis"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Beattie, Christopher A.","Bingular, Stanoje P.","Lindner, Douglas K.","Riad, Sedki Mohamed"]},{"key":"dc:contributor.department","label":"Department","values":["Electrical Engineering"]},{"key":"dc:creator","label":"Author","values":["DeBrunner, Victor Earl"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:21:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:21:17Z","2005-10-14"]},{"key":"dc:date.issued","label":"Date","values":["1990-04-18"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-10142005-135736"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/39893"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Convergence rates are analyzed for Recursive Prediction (Output) Error Methods (RPEM) in the identification of linear state-space systems from (noisy) impulse response data) RPEM algorithms are derived which are suitable for the identification of the parameters in arbitrary state-space structures. Deterministic and stochastic versions of these identification algorithms are presented. These two classes indicate the number of realizations used in the identification, not the presence or absence of noise. The convergence analysis uses the eigen-information of the correlation matrix (really its inverse, the Fisher information matrix) for a chosen parameterization. This analysis explains why various state-space structures have different convergence properties, 1.e., why for the same system the estimation processes corresponding to different identification structures converge at different rates. The eigen-information of the parameter information matrix relates the system sensitivity and numerical conditioning in a manner which provides insight into the identification process. The relevant eigen-information is combined in the proposed scalar convergence time constant +. One important result is that identification of the usually identified direct form II parameters (the standard ARMA parameters) does not necessarily yield the fastest parameter set convergence for the system being identified. Identification from arbitrary input is also briefly considered, as is identification when the model order is different from the “true” system order."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Parameter sensitivity, estimation and convergence: an information approach"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Beex, A. A. Louis"],"dc:contributor.committeemember":["Beattie, Christopher A.","Bingular, Stanoje P.","Lindner, Douglas K.","Riad, Sedki Mohamed"],"dc:contributor.department":["Electrical Engineering"],"dc:creator":["DeBrunner, Victor Earl"],"dc:date.accessioned":["2014-03-14T21:21:17Z"],"dc:date.available":["2014-03-14T21:21:17Z","2005-10-14"],"dc:date.issued":["1990-04-18"],"dc:description.abstract":["Convergence rates are analyzed for Recursive Prediction (Output) Error Methods (RPEM) in the identification of linear state-space systems from (noisy) impulse response data) RPEM algorithms are derived which are suitable for the identification of the parameters in arbitrary state-space structures. Deterministic and stochastic versions of these identification algorithms are presented. These two classes indicate the number of realizations used in the identification, not the presence or absence of noise. The convergence analysis uses the eigen-information of the correlation matrix (really its inverse, the Fisher information matrix) for a chosen parameterization. This analysis explains why various state-space structures have different convergence properties, 1.e., why for the same system the estimation processes corresponding to different identification structures converge at different rates. The eigen-information of the parameter information matrix relates the system sensitivity and numerical conditioning in a manner which provides insight into the identification process. The relevant eigen-information is combined in the proposed scalar convergence time constant +. One important result is that identification of the usually identified direct form II parameters (the standard ARMA parameters) does not necessarily yield the fastest parameter set convergence for the system being identified. Identification from arbitrary input is also briefly considered, as is identification when the model order is different from the “true” system order."],"dc:description.degree":["Ph. D."],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-10142005-135736"],"dc:identifier.uri":["http://hdl.handle.net/10919/39893"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Parameter sensitivity, estimation and convergence: an information approach"],"dc:type":["Dissertation"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Ph. D."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:19Z"}