期刊文献+

A SIMPLICIAL ALGORITHM FOR COMPUTING AN INTEGER ZERO POINT OF A MAPPING WITH THE DIRECTION PRESERVING PROPERTY

A SIMPLICIAL ALGORITHM FOR COMPUTING AN INTEGER ZERO POINT OF A MAPPING WITH THE DIRECTION PRESERVING PROPERTY
原文传递
导出
摘要 A mapping f : Z^n → Rn is said to possess the direction preserving property if fi(x) 〉 0 implies fi(y) ≥ 0 for any integer points x and y with ||x - y||∞≤ 1. In this paper, a simplicial algorithm is developed for computing an integer zero point of a mapping with the direction preserving property. We assume that there is an integer point x^0 with c ≤ x^0≤d satisfying that maxl≤i≤(xi - xi^0)fi(x) 〉 0 for any integer point x with f(x) ≠ 0 on the boundary of H = {x ∈R^n [c-e ≤ x〈d+e},wherecanddaretwo finite integer points with c 〈 d and e = (1, 1,... , 1)^T E R^n. This assumption is implied by one of two conditions for the existence of an integer zero point of a mapping with the preserving property in van der Laan et al. (2004). Under this assumption, starting at x^0, the algorithm follows a finite simplicial path and terminates at an integer zero point of the mapping. This result has applications in general economic equilibrium models with indivisible commodities. A mapping f : Z^n → Rn is said to possess the direction preserving property if fi(x) 〉 0 implies fi(y) ≥ 0 for any integer points x and y with ||x - y||∞≤ 1. In this paper, a simplicial algorithm is developed for computing an integer zero point of a mapping with the direction preserving property. We assume that there is an integer point x^0 with c ≤ x^0≤d satisfying that maxl≤i≤(xi - xi^0)fi(x) 〉 0 for any integer point x with f(x) ≠ 0 on the boundary of H = {x ∈R^n [c-e ≤ x〈d+e},wherecanddaretwo finite integer points with c 〈 d and e = (1, 1,... , 1)^T E R^n. This assumption is implied by one of two conditions for the existence of an integer zero point of a mapping with the preserving property in van der Laan et al. (2004). Under this assumption, starting at x^0, the algorithm follows a finite simplicial path and terminates at an integer zero point of the mapping. This result has applications in general economic equilibrium models with indivisible commodities.
出处 《Journal of Computational Mathematics》 SCIE CSCD 2006年第6期711-718,共8页 计算数学(英文)
关键词 Integer Zero Point Direction Preserving Simplicial Algorithm Triangulation Existence. Integer Zero Point, Direction Preserving, Simplicial Algorithm, Triangulation,Existence.
  • 相关文献

参考文献24

  • 1E.L. Allgower and K. Georg, Numerical Continuation Methods, Springer-Verlag, 1990.
  • 2C. Dang, The D1-triangulation of R^n for simplicial algorithms for computing solutions of nonlinear equations, Mathematics of Operations Research, 16 (1991), 148-161.
  • 3C. Dang, Triangulations and Simplicial Methods, Lecture Notes in Mathematical Systems and Economics, 421 (1995).
  • 4C. Dang, A constructive proof to the existence of an integer zero point of a mapping with the direction preserving property, Submitted, (2005).
  • 5C. Dang and H. van Maaren, A simplicial approach to the determination of an integral point of a simplex, Mathematics of Operations Research, 23 (1998), 403-415.
  • 6B.C. Eaves, Homotopies for the computation of fixed points. Mathematical Programming, 3 (1972),1-22.
  • 7B.C. Eaves and R. Saigal, Homotopies for the computation of fixed points on unbounded regions,Mathematical Programming, 8 (1972), 225-237.
  • 8P. Favati and F. Tardella, Convexity in nonlinear integer programming, Ricerca Operativa, 53(1990), 3-44.
  • 9W. Forster, Homotopy methods, Handbook of Global Optimization, Eds. R. Horst and P.M.Pardalos, Kluwer Academic Publishers, (1995).
  • 10H. Freudenthal, Simplizialzerlegungen von Beschrankter Flachheit, Annals of Mathematics, 43(1942), 580-582.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部