Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results

R. B. Kellogg, T. Y. Li and J. Yorke
SIAM Journal on Numerical Analysis
Vol. 13, No. 4 (Sep., 1976), pp. 473-483
Stable URL: http://www.jstor.org/stable/2156239
Page Count: 11
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
Preview not available

Abstract

A constructive proof of the Brouwer fixed-point theorem is given, which leads to an algorithm for finding the fixed point. Some properties of the algorithm and some numerical results are also presented.

Page Thumbnails

  • Thumbnail: Page 
473
    473
  • Thumbnail: Page 
474
    474
  • Thumbnail: Page 
475
    475
  • Thumbnail: Page 
476
    476
  • Thumbnail: Page 
477
    477
  • Thumbnail: Page 
478
    478
  • Thumbnail: Page 
479
    479
  • Thumbnail: Page 
480
    480
  • Thumbnail: Page 
481
    481
  • Thumbnail: Page 
482
    482
  • Thumbnail: Page 
483
    483