An algorithm for sampling subsets of H/sub /spl infin// with applications to risk-adjusted performance analysis and model (in)validation
Lists
Only you see this
Abstract
In spite of their potential to reduce computational complexity, the use of probabilistic methods in robust control has been mostly limited to parametric uncertainty, since the problem of sampling causal bounded operators is largely open. In this note, we take steps toward removing this limitation by proposing a computationally efficient algorithm aimed at uniformly sampling suitably chosen subsets of H/sub /spl infin//. As we show in the note, samples taken from these sets can be used to carry out model (in)validation and robust performance analysis in the presence of structured dynamic linear time-invariant uncertainty, problems known to be NP-hard in the number of uncertainty blocks.
BibTeX
@article{sznaier2005algorithm,
author = {Mario Sznaier and Constantino Lagoa and M.C. Mazzaro},
title = {{An algorithm for sampling subsets of H/sub /spl infin// with applications to risk-adjusted performance analysis and model (in)validation}},
journal = {IEEE Transactions on Automatic Control},
year = {2005},
doi = {10.1109/tac.2005.843852},
}Loading related content...