A compact algorithm for the intersection and approximation of N-dimensional polytopes
- 31 December 1990
- journal article
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 32 (5-6) , 469-480
- https://doi.org/10.1016/0378-4754(90)90003-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast and robust algorithm to compute exact polytope parameter boundsMathematics and Computers in Simulation, 1990
- Exact and recursive description of the feasible parameter set for bounded error modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Identification of parameter bounds for ARMAX models from records with bounded noiseInternational Journal of Control, 1987
- Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimatorsIEEE Transactions on Automatic Control, 1982
- The propagation of parametric uncertainty via polytopesIEEE Transactions on Automatic Control, 1979
- Sets of possible states of linear systems given perturbed observationsIEEE Transactions on Automatic Control, 1968
- Recursive state estimation: Unknown but bounded errors and system inputsIEEE Transactions on Automatic Control, 1968