Solving discrete zero point problems

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

Solving discrete zero point problems

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

Research output: Working paper › Discussion paper › Other research output

583 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 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

Access to Document

Cite this

@techreport{7199ad17969b4bd5b82afa7a98361fb7,

title = "Solving discrete zero point problems",

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.",

keywords = "discrete zero point, discrete fixed point, simplicial algorithm, triangulation",

author = "{van der Laan}, G. and A.J.J. Talman and Z.F. Yang",

note = "Pagination: 15",

year = "2004",

language = "English",

volume = "2004-113",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}

TY - UNPB

T1 - Solving discrete zero point problems

AU - van der Laan, G.

AU - Talman, A.J.J.

AU - Yang, Z.F.

N1 - Pagination: 15

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - discrete zero point

KW - discrete fixed point

KW - simplicial algorithm

KW - triangulation

M3 - Discussion paper

VL - 2004-113

T3 - CentER Discussion Paper

BT - Solving discrete zero point problems

PB - Operations research

CY - Tilburg

ER -

Solving discrete zero point problems

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this