|
|
|
|
||||
|
||||
Solving Discrete Zero Point ProblemsGerard Van der LaanVU University Amsterdam - Faculty of Economics and Business Administration; Tinbergen Institute - Tinbergen Institute Amsterdam (TIA) Dolf TalmanTilburg University - Department of Econometrics & Operations Research Zaifu YangYokohama National University - Faculty of Business Administration; Tilburg University - Department of Econometrics & Operations Research October 15, 2004 Tinbergen Institute Discussion Paper No. TI 2004-112/1; CentER Discussion Paper Series No. 2004-113 Abstract: In this paper, an algorithm is proposed to find a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space R (n). Starting with a given integral point, the algorithm generates a finite 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.
Number of Pages in PDF File: 16 Keywords: Discrete zero point, discrete fixed point, simplicial algorithm, triangulation JEL Classification: C61, C62, C68, C72, C58 working papers seriesDate posted: November 1, 2004Suggested CitationContact Information
|
|
|||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo3 in 0.813 seconds
