Fast and robust algorithm to compute exact polytope parameter bounds

Mathematics and Computers in Simulation

Volumn 32, Issue 5-6, 1990, Pages 481-493

  Mo, S H ^a   Norton, J P ^b  

^a JAGUAR LAND ROVER   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; DYNAMICS; MATHEMATICAL TECHNIQUES - HEURISTIC; NOISE, SPURIOUS SIGNAL - SIGNAL TO NOISE RATIO; REDUNDANCY;

DEGENERATE VERTEX; POLYHEDRAL CONE; POLYTOPE PARAMETER BOUNDS; ROUND-OFF ERROR;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0025568468     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/0378-4754(90)90004-3     Document Type: Article

References (22)

1. Estimation of parameter bounds from bounded-error data: a survey
2. Identification and application of bounded-parameter models
3. On the value of information in system identification-bounded noise case
4. Estimation theory and uncertainty intervals evaluation in presence of unknown-but-bounded errors linear families of models and estimators
5. A compact algorithm for the intersection and approximation of N-dimensional polytopes
6. On the number of faces of a convex polytope
7. Parameter-bounding identification algorithms for bounded-noise records
8. Computation of bounded-parameter models of dynamical systems from bounded-noise records
9. Estimation de paramètres pour des modèles à erreur bornèe
10. Exact and recursive description of the feasible parameter set for bounded error models
11. Exact recursive characterization of feasible parameter sets in the linear case
12. An algorithm for determining irrelevant constraints and all vertices in system of linear inequalities
13. Redundancy and Linear Programs
14. Identifying redundant constraints and implicit equalities in system of linear constraints
15. An algorithm for finding all vertices of convex polyhedral sets
16. Finding faces of polytopes by simplicial decomposition part I: vertices and edges
17. Finding faces of polytopes by simplicial decomposition part II: higher dimensional faces
18. Least distance methods for the scheme of polytopes
19. A survey and comparison of methods for finding all vertices of convex polyhedral sets