Results 121 to 130 of about 17,567 (165)
Some of the next articles are maybe not open access.

Decentralized Real Structured Singular Value Synthesis

IFAC Proceedings Volumes, 1996
Abstract This paper describes and illustrates a practical methodology for robust, fixed-structure controller synthesis using a decentralized static output feedback problem formulation. To account for real-parameter structured uncertainty, scaled Popov bounds for the real structured singular value are employed.
R. Scott Erwin   +2 more
openaire   +1 more source

Structured Singular Value: µ

1999
The linear fractional transformation (LFT) is a common framework suitable for robust stability analysis using arguments based on the small gain theorem. An LFT is an interconnection of operators arranged in a feedback configuration. These operators may be constant matrices, time-domain state-space systems, or frequency-varying transfer functions ...
Rick Lind, Marty Brenner
openaire   +1 more source

Bounds on generalized structured singular values

[1992] Proceedings of the 31st IEEE Conference on Decision and Control, 2005
The authors present several bounds on the structured singular value (SSV). They first adopt a generalized notion of which is useful for problems where uncertainties are assumed to be bounded in an l/sub p/-induced matrix norm. Two different types of bounds, in terms of Perron root and interaction parameters, respectively, are given for the new SSV, and
J. Chen, C.N. Nett
openaire   +1 more source

Toward a structure singular value decomposition

26th IEEE Conference on Decision and Control, 1987
The concept of structured singular value was introduced by Doyle [1] as a tool for the analysis and synthesis of linear control systems with structured uncertainties. It is a key to the design of control systems under joint robustness and performance specifications and it nicely complements the H? approach to control system design [2,3]. It has already
Michael K. H. Fan, Andre L. Tits
openaire   +1 more source

Fixed Structure Computation of the Structured Singular Value

1993 American Control Conference, 1993
This paper addresses the robest stability and performance analysis problem using a fixed structure approach of the structured singular value. Specifically, using recent results on H 2 / H ? , a Riccati equation approach is formulated for complex-? with constant D-scales along with an H 2 performance bound.
Wassim M. Haddad   +2 more
openaire   +1 more source

Phase-sensitive structured singular value

1999
Given Γ ∈ C n ×n with Γ + Γ* ≥ 0, define the phase Φ(Γ) of Γ by $$\Phi \left( \Gamma \right) = {\cot ^{ - 1}}\left( {\sup \left\{ {b:\Gamma + \Gamma * - \frac{\beta }{j}\left( {\Gamma - \Gamma *} \right) \geqslant 0\forall \beta \in \left\{ { - b,\,b} \right\}} \right\}} \right).$$
André L. Tits, V. Balakrishnan
openaire   +1 more source

On structured singular values of reciprocal matrices

Proceedings of 1995 American Control Conference - ACC'95, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamamoto, Shigeru, Kimura, Hidenori
openaire   +1 more source

Accurate Singular Value Decompositions of Structured Matrices

SIAM Journal on Matrix Analysis and Applications, 2000
The author presents a new algorithm for singular value decomposition (SVD) with computational cost \(O(n^3)\) and high relative accuracy, in contrast to conventional numerical algorithms which compute SVD with high absolute accuracy. The new algorithm consists of two general steps: (i) computation of rank-revealing decomposition; (ii) computation of ...
openaire   +1 more source

Analysis of Interactions using Structured Singular Values

1986 American Control Conference, 1986
Multivariable controllers are often avoided in the chemical process industries in favor of simpler, diagonal or block-diagonal controllers. Such "decentralized" controllers are desirable because they result in control systems with fewer tuning parameters.
Pierre Grosdidier, Manfred Morari
openaire   +1 more source

Conservatism of randomized structured singular value

IEEE Transactions on Automatic Control, 2002
In this note, we study the conservatism of structured singular value computation by a randomized algorithm. It is proved that, if the maximization problem μ(M) = max ρ(MΔ) is solved by generating polynomial number of random Δ samples and then taking the maximum of the function at these sample points, for any fixed lower bound on the confidence level ...
openaire   +1 more source

Home - About - Disclaimer - Privacy