Skip to main content
Log in

Non-convex systems of sets for numerical analysis

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The notion of a system of sets generated by a family of functionals is introduced. A generalization of the classical support function of convex subsets of \(\mathbb R ^d\) allows to transfer the concept of the convex hull to these systems of sets. Approximation properties of the generalized convex hull and its use for practical computations are investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Baier R (1995) Mengenwertige Integration und die diskrete Approximation erreichbarer Mengen (Set-valued integration and discrete approximation of reachable sets). Bayreuth Math Schr 50. Dissertation, Universität Bayreuth, Bayreuth

  2. Beyn WJ, Rieger J (2007) Numerical fixed grid methods for differential inclusions. Computing 81(1):91–106

    Article  MathSciNet  MATH  Google Scholar 

  3. Beyn WJ, Rieger J (2012) Galerkin finite element methods for semilinear elliptic differential inclusions. To appear in DCDS-B

  4. Dellnitz M, Hohmann A (1997) A subdivision algorithm for the computation of unstable manifolds and global attractors. Numerische Mathematik 75:293–317

    Article  MathSciNet  MATH  Google Scholar 

  5. Dellnitz M, Junge O (2002) Set oriented numerical methods for dynamical systems. In: Fiedler B (ed) Handbook of dynamical systems, vol 2. North-Holland, Amsterdam, pp 221–264

  6. Giga Y (2006) Surface evolution equations. A level set approach. Monographs in Mathematics, vol 99. Birkhäuser, Basel

  7. Harrach B, Seo JK (2010) Exact shape-reconstruction by one-step linearization in electrical impedance tomography. SIAM J Math Anal 42(4):1505–1518

    Article  MathSciNet  MATH  Google Scholar 

  8. Haslinger J, Mäkinen RAE (2003) Introduction to shape optimization. Theory, approximation, and computation. Advances in design and control, vol 7. Society for Industrial and Applied Mathematics (SIAM), Philadelphia

  9. Moore RE, Baker Kearfott R, Cloud M (2009) Introduction to interval analysis. Society for Industrial and Applied Mathematics, Philadelphia

    Book  MATH  Google Scholar 

  10. Osher S, Fedkiw R (2003) Level set methods and dynamic implicit surfaces. In: Applied mathematical sciences, vol 153. Springer, New York

  11. Rieger J (2011) Discretizations of linear elliptic partial differential inclusions. Numer Funct Anal Optim 32(8):904–925

    Article  MathSciNet  MATH  Google Scholar 

  12. Rockafellar RT (1970) Convex analysis. In: Princeton mathematical series, vol 28. Princeton University Press, Princeton

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Janosch Rieger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rieger, J. Non-convex systems of sets for numerical analysis. Computing 95 (Suppl 1), 617–638 (2013). https://doi.org/10.1007/s00607-012-0241-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-012-0241-9

Keywords

Mathematics Subject Classification (2000)

Navigation