Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical analysis --- 519.6 --- 681.3*G1 --- Computational mathematics. Numerical analysis. Computer programming --- 681.3*G1 Numerical analysis --- 519.6 Computational mathematics. Numerical analysis. Computer programming

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical analysis --- 519.6 --- 681.3*G1 --- Computational mathematics. Numerical analysis. Computer programming --- 681.3*G1 Numerical analysis --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Analyse numérique. --- Numerical analysis. --- Mathématiques --- Analyse numérique --- Mathématiques --- Congresses

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Fixed-point algorithms have diverse applications in economics, optimization, game theory and the numerical solution of boundary-value problems. Since Scarf's pioneering work [56,57] on obtaining approximate fixed points of continuous mappings, a great deal of research has been done in extending the applicability and improving the efficiency of fixed-point methods. Much of this work is available only in research papers, although Scarf's book [58] gives a remarkably clear exposition of the power of fixed-point methods. However, the algorithms described by Scarf have been super~eded by the more sophisticated restart and homotopy techniques of Merrill [~8,~9] and Eaves and Saigal [1~,16]. To understand the more efficient algorithms one must become familiar with the notions of triangulation and simplicial approxi- tion, whereas Scarf stresses the concept of primitive set. These notes are intended to introduce to a wider audience the most recent fixed-point methods and their applications. Our approach is therefore via triangu- tions. For this reason, Scarf is cited less in this manuscript than his contri- tions would otherwise warrant. We have also confined our treatment of applications to the computation of economic equilibria and the solution of optimization problems. Hansen and Koopmans [28] apply fixed-point methods to the computation of an invariant optimal capital stock in an economic growth model. Applications to game theory are discussed in Scarf [56,58], Shapley [59], and Garcia, Lemke and Luethi [24]. Allgower [1] and Jeppson [31] use fixed-point algorithms to find many solutions to boundary-value problems.

Topology --- Operational research. Game theory --- Mathematics --- Physical Sciences & Mathematics --- Mathematical Theory --- 330.105 --- 519.6 --- 681.3*G1 --- Wiskundige economie. Wiskundige methoden in de economie --- Computational mathematics. Numerical analysis. Computer programming --- Numerical analysis --- 681.3*G1 Numerical analysis --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 330.105 Wiskundige economie. Wiskundige methoden in de economie --- Economics, Mathematical --- Fixed point theory --- Triangulating manifolds --- Mathématiques économiques --- Théorème du point fixe --- Mathématiques économiques --- Théorème du point fixe --- Point fixe, Théorème du --- Modeles economiques --- Topologie algebrique --- Homotopie

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

519.6 --- 681.3*G13 --- 681.3*G4 --- 681.3*G4 Mathematical software: algorithm analysis certification and testing efficiency portability reliability and robustness verification --- Mathematical software: algorithm analysis certification and testing efficiency portability reliability and robustness verification --- 681.3*G13 Numerical linear algebra: conditioning determinants Eigenvalues error analysis linear systems matrix inversion pseudoinverses sparse and very largesystems --- Numerical linear algebra: conditioning determinants Eigenvalues error analysis linear systems matrix inversion pseudoinverses sparse and very largesystems --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- 681.3*G4 Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 519.614 --- 629.78 --- #TELE:d.d. Prof. A. J. J. Oosterlinck --- 681.3*F1 --- 681.3*F21 --- 681.3*F1 Computation by abstract devices --- Computation by abstract devices --- 519.614 Numerical methods for computing eigenvalues and eigenvectors of matrices --- Numerical methods for computing eigenvalues and eigenvectors of matrices --- 681.3*F21 Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- Ruimteschip --- Programming --- Numerical solutions of algebraic equations --- EISPACK (Computer program) --- Langages de programmation --- Programming languages (Electronic computers) --- Langages de programmation.