Algoritmos de punto fijo usando subdivisiones simpliciales

• Azofeifa, Carlos ^[1]
  1. [1] Universidad de Costa Rica

     Universidad de Costa Rica

     Hospital, Costa Rica

     
• Localización: Revista de Matemática: Teoría y Aplicaciones, ISSN 2215-3373, ISSN-e 2215-3373, Vol. 3, Nº. 1, 1996, págs. 71-81
• Idioma: español
• DOI: 10.15517/rmta.v3i1.128
• Enlaces
  • Texto completo (pdf)
• Resumen
  • español

    Se estudiará un algoritmo para aproximar puntos fijos usando subdivisiones simpliciales de un simplex S, el cual será comparado con un algoritmo del mismo tipo pero basado en conjuntos primitivos.

  • English

    In this paper we study an algorithm for approximating fixed points using simplicial subdivisions of the simplex. Furthermore, it is compared with algorithms of primitive sets.

• Referencias bibliográficas
  • Acuña, O.; Ulate; F. (1994) “Equilibrio walrasiano en economías de intercambio”, Revista de Matemática, 1(1): 1–16.
  • Azofeifa, C. (1995) “Aplicaciones de las técnicas de punto fijo”, Revista Ciencia y Tecnología, 14(1-2): 69–80.
  • Azofeifa, C. (1993) Aplicaciones de la Teoría de Punto Fijo, Tesis de Maestría, Universidad de Costa Rica, San Pedro.
  • Balinski; Cotle. (1978) Complementary and Fixed Point Problems. North-Holland, Amsterdam.
  • Belluce, L.P.; Kirk, W.A. (1967) Fixed Point Theorems for Certain Classes of Non-expansive Mappings, New York.
  • Border, K. (1985) Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge University Press.
  • Eaves, B.C (1972) “Homotopies for computation of fixed points”, Math. Progr., 3(1):1–22.
  • Fadell, E.; Fournier, G. (1981) Fixed Point Theory. Lectures Notes in Mathematics, Springer–Verlag, New York.
  • Franklin, J. (1980) Methods of Mathematical Economics Linear and Nonlinear Programming, Fixed Point Theorems. Springer–Verlag, New York.
  • Garcia, C.; Lemke, C.E.; Lueti. (1973) “Simplicial aproximation of an equilibrium point for non-cooperative n-persons games”, Math. Prog.,...
  • Hansen, T. (1968) On the Approximation of a Competitive Equilibrium Model. Ph.D.Thesis, Yale University.
  • Istratèscu, V. (1981) Fixed Point Theory. An Introduction.D. Reidel Publishing Company, Boston.
  • Kellogg, R.B.; Li, T.Y.; Yorke, J. (1977) “A method of continuation for calculating a Brouwer fixed point”, In Fixed Points: Algorithms and...
  • Kuhm, H.W. (1968) “Simplicial approximation of fixed points”, Proc. Nat. Acad. Sci.,61: 1238–1242.
  • Laan, G. van der; Talman, J.J. (1979) “A restart algorithm for computing fixed points without an extra dimension”, Math. Progr., 17: 74–84.
  • Lemke, C.E.; Howson, J.T. (1964) “Equilibrium points of bimatrix games”, SIAM J. Appl. Math., 12(2): 413-423.
  • Merrill, O.H. (1972) Applications and Extensions of an Algorithm that Computes Fixed Points of Certain Upper Semi-continuous Point to Set...
  • Scarf, H. (1973)The Computation of Economic Equilibria. Yale University Press.[19] Smale, S. (1976) “A convergent process of price adjustment...
  • Smart, D.R. (1974) Fixed Point Theorems. Cambridge Tracts in Mathematics, Great Britain.
  • Todd, M. (1980) The Computation of Fixed Points and Applications. Lectures Notes in Economics and Mathematical Systems, Springer–Verlag, New...
  • Todd, M. (1984) “Efficient methods of computing economic equilibria”, Applied General Equilibrium Analysis, H. Scarf & J. Shoven (eds.),...
  • Zamfirescu, T. (1972) “Fixed Point Theorems in Metric Spaces”, Arch. Matah., 23:292–298, MR 46 #9957.