Solving discrete zero point problems

G. van der Laan, A.J.J. Talman, Z.F. Yang

Research output: Working paperDiscussion paperOther research output

406 Downloads (Pure)

Abstract

In this paper an algorithm is proposed to .nd a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space IRn.Starting with a given integral point, the algorithm generates a .nite sequence of adjacent integral simplices of varying dimension and terminates with, under certain convergency conditions, a vertex, which yields a discrete zero point of the function under consideration.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages15
Volume2004-113
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper
Volume2004-113

Keywords

  • discrete zero point
  • discrete fixed point
  • simplicial algorithm
  • triangulation

Fingerprint Dive into the research topics of 'Solving discrete zero point problems'. Together they form a unique fingerprint.

  • Cite this

    van der Laan, G., Talman, A. J. J., & Yang, Z. F. (2004). Solving discrete zero point problems. (CentER Discussion Paper; Vol. 2004-113). Operations research.