Solving discrete zero point problems

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

Research output: Working paperDiscussion paperOther research output

528 Downloads (Pure)


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
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper


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


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

Cite this