Suboptimal Algorithms for Worst Case Identification in H and Model Validation

Document Type

Article

Publication Date

1-1-1994

Abstract

New algorithms based on convex programming are proposed for worst case system identification. The algorithms are optimal within a factor of two asymptotically. Further, model validation, or data consistency, is embedded in the identification process. Explicit worst case identification error bounds in the H∞ norm are also derived for both uniformly and nonuniformly spaced frequency response samples. © 1994 IEEE

Publication Source (Journal or Book title)

IEEE Transactions on Automatic Control

First Page

1657

Last Page

1661

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 6
  • Usage
    • Abstract Views: 5
  • Captures
    • Readers: 1
see details

Share

COinS