Solving discrete zero point problems

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.

MoreLess

Year of publication:	2004
Authors:	Talman, Dolf ; van der Laan, G. ; Yang, Z.F.
Institutions:	Tilburg University, Center for Economic Research
Subject:	discrete zero point \| discrete fixed point \| simplicial algorithm \| triangulation

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2004-113
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011091490