### 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 language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 15 |

Volume | 2004-113 |

Publication status | Published - 2004 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2004-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.