Fast and robust algorithm to compute exact polytope parameter bounds
When bounds on the parameters of a linear-in-the-parameters model are computed, the exact feasible parameter set defined by the bounds (a polytope) is usually approximated by a simpler shape such as an ellipsoid. However, such simpler bounds may be much looser than the exact bounds. A new algorithm for updating the exact bounds is presented and compared with other recently published methods. Computational results illustrate exact polytope-bound updating by this algorithm from records of realistic length.
Year of publication: |
1990
|
---|---|
Authors: | Mo, S.H. ; Norton, J.P. |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 32.1990, 5, p. 481-493
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Parameter bounding for time-varying systems
Norton, J.P., (1990)
-
Norton, J.P., (1999)
-
Linear time-varying models to investigate complex distributed dynamics: A rainfall-runoff example
Norton, J.P., (2005)
- More ...