A probabilistic framework for problems with real structured uncertainty in systems and control
type: Item
instance of: scholarly article
title: A probabilistic framework for problems with real structured uncertainty in systems and control
zbMATH Open document ID: 1002.93021
DOI: 10.1016/S0005-1098(02)00015-8
author: Fabrizio Dabbene
author: Giuseppe Calafiore
published in: Automatica
publication date: 2002-09-05T00:00:00Z
review text: The authors begin by studying the generation of real random matrix samples having uniform distribution in structured (spectral) norm bounded sets. The distribution of the singular values of uniformly distributed real matrices is analyzed, and a polynomial-time algorithm for their generation is presented. The techniques developed are then used in a probabilistic setting to solve problems subject to real structured uncertainty.
Mathematics Subject Classification ID: 93B60
Mathematics Subject Classification ID: 65C10
Mathematics Subject Classification ID: 93B35
Mathematics Subject Classification ID: 93E25
Mathematics Subject Classification ID: 15B52
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 1797110
zbMATH Keywords: randomized algorithms
zbMATH Keywords: robustness
zbMATH Keywords: structured real uncertainty
zbMATH Keywords: singular value distribution
zbMATH Keywords: random matrices
reviewed by: Andrew Dale
describes a project that uses: LMI toolbox
MaRDI profile type: Publication
cites work: Q3796553
cites work: Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
cites work: The uniform distribution: A rigorous justification for its use in robustness analysis
cites work: A survey of computational complexity results in systems and control
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Q4524056
cites work: Randomized algorithms for probabilistic robustness with real and complex structured uncertainty.
cites work: Robust maximum likelihood estimation in the linear model
cites work: Stochastic algorithms for exact and approximate feasibility of robust LMIs
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: Q3230381
cites work: Q3723577
cites work: Random variate generation for multivariate unimodal densities
cites work: Robust filtering for discrete-time systems with bounded noise and parametric uncertainty
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Q3725277
cites work: Several NP-hard problems arising in robust stability analysis
cites work: Checking robust nonsingularity is NP-hard
cites work: Random spherical uncertainty in estimation and robustness
cites work: Q4304296
cites work: A formula for computation of the real stability radius
cites work: A Monte Carlo approach to the analysis of control system robustness
cites work: Q5845916
cites work: The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
cites work: Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
cites work: Q4240474
cites work: Determinants and their applications in mathematical physics
cites work: Q4253255
cites work: Randomized algorithms for robust controller synthesis using statistical learning theory
cites work: Probabilistic solutions to some NP-hard matrix problems
cites work: Q4435456
cites work: Robust Kalman filtering for uncertain discrete-time systems
cites work: Q3128879
description: scientific article; zbMATH DE number 1797110