MARC

LEADER 00000cam a2200000 i 4500
001 SCIDIR_ocn707452371
003 OCoLC
005 20231117044559.0
006 m o d
007 cr bn||||||abp
007 cr bn||||||ada
008 110315s1977 nyua ob 100 0 eng d
040 |a OCLCE  |b eng  |e pn  |c OCLCE  |d OCLCQ  |d OCLCF  |d OPELS  |d OCLCO  |d OCLCA  |d EBLCP  |d N$T  |d E7B  |d DEBSZ  |d OCLCO  |d OCL  |d YDXCP  |d OCLCO  |d OCL  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCQ  |d MERUC  |d OCLCQ  |d UKAHL  |d OCLCQ  |d VLY  |d LUN  |d OCLCQ  |d INARC  |d OCLCQ  |d OCLCO  |d COM  |d OCLCO  |d OCLCQ  |d OCLCO 
019 |a 898772171  |a 987674123  |a 1100973245  |a 1162031424  |a 1244727200 
020 |a 9780123980502  |q (electronic bk.) 
020 |a 012398050X  |q (electronic bk.) 
020 |a 9781483261133 
020 |a 1483261131 
035 |a (OCoLC)707452371  |z (OCoLC)898772171  |z (OCoLC)987674123  |z (OCoLC)1100973245  |z (OCoLC)1162031424  |z (OCoLC)1244727200 
042 |a dlr 
050 4 |a QA329.9  |b .I57 1974 
082 0 4 |a 515 
084 |a 31.00  |2 bcl 
111 2 |a International Conference on Computing Fixed Points with Applications  |n (1st :  |d 1974 :  |c Clemson University) 
245 1 0 |a Fixed points :  |b algorithms and applications /  |c edited by Stepan Karamardian, in collaboration with C.B. Garcia. 
260 |a New York :  |b Academic Press,  |c 1977. 
300 |a 1 online resource (x, 494 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
504 |a Includes bibliographical references. 
506 |3 Use copy  |f Restrictions unspecified  |2 star  |5 MiAaHDL 
533 |a Electronic reproduction.  |b [Place of publication not identified] :  |c HathiTrust Digital Library,  |d 2011.  |5 MiAaHDL 
538 |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.  |u http://purl.oclc.org/DLF/benchrepro0212  |5 MiAaHDL 
583 1 |a digitized  |c 2011  |h HathiTrust Digital Library  |l committed to preserve  |2 pda  |5 MiAaHDL 
588 0 |a Print version record. 
505 0 |a 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 
505 8 |a 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 
505 8 |a 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 
505 8 |a 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 
505 8 |a 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 
546 |a English. 
650 0 |a Fixed point theory  |v Congresses. 
650 0 |a Equations, Simultaneous  |v Congresses. 
650 0 |a Economics, Mathematical  |v Congresses. 
650 0 |a Programming (Mathematics)  |v Congresses. 
650 0 |a Fixed point theory  |x Congresses. 
650 0 |a Equations, Simultaneous  |x Congresses. 
650 0 |a Economics, Mathematical  |x Congresses. 
650 6 |a Th�eor�eme du point fixe  |0 (CaQQLa)201-0061239  |x Congr�es.  |0 (CaQQLa)201-0378208 
650 6 |a Syst�emes d'�equations  |0 (CaQQLa)201-0041484  |x Congr�es.  |0 (CaQQLa)201-0378208 
650 6 |a Math�ematiques �economiques  |0 (CaQQLa)201-0009143  |x Congr�es.  |0 (CaQQLa)201-0378208 
650 6 |a Programmation (Math�ematiques)  |0 (CaQQLa)201-0001238  |v Congr�es.  |0 (CaQQLa)201-0378219 
650 6 |a Th�eor�eme du point fixe  |0 (CaQQLa)201-0061239  |v Congr�es.  |0 (CaQQLa)201-0378219 
650 6 |a Syst�emes d'�equations  |0 (CaQQLa)201-0041484  |v Congr�es.  |0 (CaQQLa)201-0378219 
650 7 |a Economics, Mathematical  |2 fast  |0 (OCoLC)fst00902260 
650 7 |a Equations, Simultaneous  |2 fast  |0 (OCoLC)fst00914514 
650 7 |a Fixed point theory  |2 fast  |0 (OCoLC)fst00926886 
650 7 |a Programming (Mathematics)  |2 fast  |0 (OCoLC)fst01078701 
650 7 |a Analise numerica.  |2 larpcal 
650 7 |a Point fixe, Th�eor�eme du  |x Congr�es.  |2 ram 
650 7 |a �Equations, Syst�emes d'  |x Solutions num�eriques  |x Congr�es.  |2 ram 
650 7 |a Math�ematiques �economiques  |x Congr�es.  |2 ram 
650 7 |a Programmation (math�ematiques)  |x Congr�es.  |2 ram 
655 2 |a Congress  |0 (DNLM)D016423 
655 7 |a proceedings (reports)  |2 aat  |0 (CStmoGRI)aatgf300027316 
655 7 |a Conference papers and proceedings  |2 fast  |0 (OCoLC)fst01423772 
655 7 |a Conference papers and proceedings.  |2 lcgft 
655 7 |a Actes de congr�es.  |2 rvmgf  |0 (CaQQLa)RVMGF-000001049 
700 1 |a Karamardian, Stepan. 
700 1 |a Garcia, C. B. 
710 1 |a United States.  |b Office of Naval Research. 
710 1 |a United States.  |b Army Research Office. 
776 0 8 |i Print version:  |a International Conference on Computing Fixed Points with Applications (1st : 1974 : Clemson University).  |t Fixed points.  |d New York : Academic Press, 1977  |w (DLC) 76030678  |w (OCoLC)2645457 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780123980502  |z Texto completo