Skip to main content
Book Chapter

Guaranteed Set Computation with Subpavings

  • Kieffer M
  • Braems I
  • Walter É
  • et al.
Springer US, (2001), 167-178
DOI: 10.1007/978-1-4757-6484-0_14
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is about the approximate representation of compact sets using subpavings, i.e., unions of non-overlapping boxes, and about computation on these sets, with particular attention to implementation issues. Some basic operations such as evaluating the...

Cite

CITATION STYLE

APA

Kieffer, M., Braems, I., Walter, É., & Jaulin, L. (2001). Guaranteed Set Computation with Subpavings. In Scientific Computing, Validated Numerics, Interval Methods (pp. 167–178). Springer US. https://doi.org/10.1007/978-1-4757-6484-0_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free