z-logo
Premium
Robustness analysis of flexible structures: practical algorithms
Author(s) -
Ferreres Gilles,
Magni JeanFrançois,
Biannic JeanMarc
Publication year - 2003
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.742
Subject(s) - robustness (evolution) , upper and lower bounds , algorithm , computer science , interval (graph theory) , singular value , interval arithmetic , mathematics , combinatorics , mathematical analysis , biochemistry , chemistry , eigenvalues and eigenvectors , physics , quantum mechanics , bounded function , gene
When analysing the robustness properties of a flexible system, the classical solution, which consists of computing lower and upper bounds of the structured singular value (s.s.v.) at each point of a frequency gridding, appears unreliable. This paper describes two algorithms, based on the same technical result: the first one directly computes an upper bound of the maximal s.s.v. over a frequency interval, while the second one eliminates frequency intervals, inside which the s.s.v. is guaranteed to be below a given value. Various strategies are then proposed, which combine these two techniques, and also integrate methods for computing a lower bound of the s.s.v. The computational efficiency of the scheme is illustrated on a real‐world application, namely a telescope mock‐up which is significant of a high order flexible system. Copyright © 2003 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom