A CLASS OF ALGORITHMS FOR IDENTIFICATION IN ETA-INFINITY

被引：78

作者：

GU, GX

KHARGONEKAR, PP

机构：

[1] UNIV MICHIGAN,DEPT ELECT ENGN & COMP SCI,ANN ARBOR,MI 48109

[2] LOUISIANA STATE UNIV,DEPT ELECT ENGN,BATON ROUGE,LA 70803

来源：

AUTOMATICA | 1992年 / 28卷 / 02期

基金：

美国国家科学基金会;

关键词：

SYSTEM IDENTIFICATION; FREQUENCY RESPONSE; LINEAR SYSTEMS; FAST FOURIER TRANSFORM; ERROR ANALYSIS;

D O I：

10.1016/0005-1098(92)90117-X

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a class of algorithms for the problem of system identification in H infinity are investigated. These algorithms are characterized by a two-stage structure and involve a class of window functions. Some conditions in terms of properties of the window functions are derived, which guarantee robust convergence of the algorithms. Identification errors are analyzed for several common window functions. This leads to some insights into the trade-off between the error induced by approximation and that due to noise.

引用

页码：299 / 312

页数：14

共 31 条

[21] ON BOUNDED BILINEAR FORMS [J].

NEHARI, Z .

ANNALS OF MATHEMATICS, 1957, 65 (01) :153-162

[22]

PARKER PJ, 1987, 26TH P C DEC CONTR L, P348

[23]

PARTINGTON JR, 1992, IN PRESS INT J CONTR

[24]

PARTINGTON JR, 1992, IN PRESS J MATH ANAL

[25]

RABINER L, 1975, THEORY APPLICATIONS

[26]

SMITH R, 1990, 1990 P AM CONTR C SA, P2394

[27]

TSE DNC, 1991, OPTIMAL ASYMPTOTIC I

[28]

YOUNCE R, 1990, 1990 P C DEC CONTR H, P3154

[29]

Young N., 1988, INTRO HILBERT SPACE

[30] METRIC COMPLEXITY OF CAUSAL LINEAR-SYSTEMS - EPSILON-ENTROPY AND EPSILON-DIMENSION FOR CONTINUOUS TIME [J].

ZAMES, G .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1979, 24 (02) :222-230

← 1 2 3 4 →