The computation of fixed points and applications
著者
書誌事項
The computation of fixed points and applications
(Lecture notes in economics and mathematical systems, 124)(Mathematical economics)
Springer-Verlag, 1976
- U.S.
- Germany
大学図書館所蔵 全58件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Bibliography: p. [126]-129
内容説明・目次
内容説明
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.
目次
I Brouwer's Theorem.- II Some Applications of Brouwer's Theorem.- III Triangulations.- IV Algorithms to Find Completely-Labelled Simplices.- V Extensions of Brouwer's Theorem.- VI Applications of Kakutani's Theorem and its Extensions.- VII Eaves' First Algorithm.- VIII Merrill's Algorithm.- IX Homotopy Algorithms.- X Triangulations with Continuous Refinement of Grid Size.- XI Measures of Efficiency for Triangulations.- References.
「Nielsen BookData」 より