Fixed points : algorithms and applications /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores Corporativos: International Conference on Computing Fixed Points with Applications Clemson University, United States. Office of Naval Research, United States. Army Research Office
Otros Autores: Karamardian, Stepan, Garcia, C. B.
Formato: Electrónico Congresos, conferencias eBook
Idioma:Inglés
Publicado: New York : Academic Press, 1977.
Temas:
Fixed point theory > Congresses.
Equations, Simultaneous > Congresses.
Economics, Mathematical > Congresses.
Programming (Mathematics) > Congresses.
Th�eor�eme du point fixe > Congr�es.
Syst�emes d'�equations > Congr�es.
Math�ematiques �economiques > Congr�es.
Programmation (Math�ematiques) > Congr�es.
Economics, Mathematical
Equations, Simultaneous
Fixed point theory
Programming (Mathematics)
Analise numerica.
Point fixe, Th�eor�eme du > Congr�es.
�Equations, Syst�emes d' > Solutions num�eriques > Congr�es.
Programmation (math�ematiques) > Congr�es.
Congress
proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congr�es.
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Front Cover; Fixed Points: Algorithms and Applications; Copyright Page; Table of Contents; Contributors; Preface; Introduction; Chapter 1. Finding Roots of Polynomials By Pivoting; ABSTRACT; 1. Introduction and Summary; 2. Labelled Triangulations; 3. A Special Triangulation; 4. The Algorithm; 5. Convergence Proof; REFERENCES; Chapter 2. A New Simplicial Approximation Algorithm With Restarts: Relations Between Convergence and Labelings; ABSTRACT; 1. Introduction; 2. The Algorithm; 3. Termination and Existence Results; 4. Implementation; REFERENCES
  • Chapter 3. Complementary Pivot Theory and Markovia�ii Decision ChainsABSTRACT; 0. Notation; 1. Introduction; 2. Relation to Dynamic Programming; 3. Restating LZ(y) = y; 4. Bases and Adjacency; 5. The Algorithm; 6. The Algorithm Output; 7. A Ray Condition; 8. Total Regularity; 9. A Barrier Condition; 10. Comments; Acknowledgements; REFERENCES; Chapter 4. Application of a Fixed Point Search Algorithm to Nonlinear Boundary Value Problems Having Several Solutions; ABSTRACT; REFERENCES
  • Chapter 5. Generating Stationary Points for a Class of Mathematical Programming Problems by Fixed Point AlgorithmsABSTRACT; 1. Introduction; 2. A Combinatorial Theorem due to Scarf; 3� Proof of the Combinatorial Theorem; 4. Construction of an Algorithm to Approximate a Stationary Point; 5. A Procedure for Generating more than one Stationary Point; REFERENCES; Chapter 6. A Method of Continuation for Calculating a Brouwer Fixed Point; 1. Introduction; 2. Main Result; 3. The Algorithm; 4. Additional Results; REFERENCES; Chapter 7. Continuation Methods for Simplicial Mappings; ABSTRACT
  • 1. Definitions2. Main Results; 3. Applications; REFERENCES; Chapter 8. A Fixed Point Approach to Stability in Cooperative Games; ABSTRACT; 1. Introduction; 2. Subsolutions; REFERENCES; Chapter 9. Error Bounds for Approximate Fixed Points; ABSTRACT; 1. Introduction; 2. Error Bounds for Approximate Fixed Points; REFERENCES; Chapter 10. Computation of Fixed Point in a Nonconvex Region; ABSTRACT; 0. Notation; 1. Introduction; 2. Reduction of Indices; 3. Homeomorphism; 4. Algorithm; REFERENCES; Chapter 11. Investigations Into the Efficiency of the Fixed Point Algorithms; ABSTRACT; 0. Introduction
  • 1. Labelings2. Convergence Properties; 3. Triangulations; REFERENCES; Chapter 12. Almost-Complementary Paths in the Generalized Complementarity Problem; ABSTRACT; 1. Introduction; 2. The Fixed-Point Algorithm; 3 . Almost-Complete Points; 4. Browder's Theorem in Rn; 5. The Generalized Complementarity Problem; 6. Existence Conditions for the Generalized Complementarity Problem (GCP); Acknowledgment; REFERENCES; Chapter 13. A Computational Comparison of Fixed Point Algorithms Which Use Complementary Pivoting; ABSTRACT; 1. Introduction; 2. The Sn Class Algorithms

Ejemplares similares