IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v32y1990i5p469-480.html
   My bibliography  Save this article

A compact algorithm for the intersection and approximation of N-dimensional polytopes

Author

Listed:
  • Broman, V.
  • Shensa, M.J.

Abstract

In a very general sense, estimation problems are concerned with relating measurements to a (hopefully small) region containing the unknown state or parameters. Polytopes present a natural candidate for the representation and manipulation of such regions. In fact, assuming the existence of a suitable model, many problems may be reduced to one of efficiently representing N-dimensional polytopes and forming their intersections. The algorithm described in this paper provides a solution to the above problem which is reasonably efficient and requires very little computer code. Although originally developed for use in tracking, it can easily be implemented to perform system identification and has potential application to any problem requiring a versatile representation for N-dimensional convex sets.

Suggested Citation

  • Broman, V. & Shensa, M.J., 1990. "A compact algorithm for the intersection and approximation of N-dimensional polytopes," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 469-480.
    • Handle: RePEc:eee:matcom:v:32:y:1990:i:5:p:469-480
    DOI: 10.1016/0378-4754(90)90003-2
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378475490900032
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(90)90003-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mo, S.H. & Norton, J.P., 1990. "Fast and robust algorithm to compute exact polytope parameter bounds," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 481-493.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Walter, Eric & Piet-Lahanier, Hélène, 1990. "Estimation of parameter bounds from bounded-error data: a survey," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 449-468.
    2. Jaulin, Luc & Walter, Eric, 1993. "Guaranteed nonlinear parameter estimation from bounded-error data via interval analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(2), pages 123-137.
    3. Keesman, Karel, 1990. "Membership-set estimation using random scanning and principal component analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 535-543.
    4. Piet-Lahanier, H. & Walter, E., 1990. "Exact recursive characterization of feasible parameter sets in the linear case," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 495-504.
    5. Piet-Lahanier, Hélène & Veres, Sándor M. & Walter, Eric, 1992. "Comparison of methods for solving sets of linear inequalities in the bounded-error context," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 34(6), pages 515-524.
    6. Mo, S.H. & Norton, J.P., 1990. "Fast and robust algorithm to compute exact polytope parameter bounds," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 481-493.
    7. Clement, Thierry & Gentil, Sylviane, 1990. "Recursive membership set estimation for output-error models," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 505-513.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Keesman, Karel, 1990. "Membership-set estimation using random scanning and principal component analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 535-543.
    2. Norton, J.P. & Mo, S.H., 1990. "Parameter bounding for time-varying systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 527-534.
    3. Clement, Thierry & Gentil, Sylviane, 1990. "Recursive membership set estimation for output-error models," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 505-513.
    4. Walter, Eric & Piet-Lahanier, Hélène, 1990. "Estimation of parameter bounds from bounded-error data: a survey," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 449-468.
    5. Jaulin, Luc & Walter, Eric, 1993. "Guaranteed nonlinear parameter estimation from bounded-error data via interval analysis," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(2), pages 123-137.
    6. Piet-Lahanier, H. & Walter, E., 1990. "Exact recursive characterization of feasible parameter sets in the linear case," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 495-504.
    7. da Silva, Ivan N. & de Arruda, Lucia V.R. & do Amaral, Wagner C., 1999. "A novel approach to robust parameter estimation using neurofuzzy systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 48(3), pages 251-268.
    8. Pronzato, Luc & Walter, Eric, 1990. "Experiment design for bounded-error models," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(5), pages 571-584.
    9. Piet-Lahanier, Hélène & Veres, Sándor M. & Walter, Eric, 1992. "Comparison of methods for solving sets of linear inequalities in the bounded-error context," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 34(6), pages 515-524.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:32:y:1990:i:5:p:469-480. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.