Skip to main content
SpringerLink
Log in
Book cover

Discrete Iterations

A Metric Study

  • Book
  • © 1986

Overview

Authors:
  1. François Robert

    1. University of Grenoble, Institut IMAG, Saint Martin d’Heres, France

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Springer Series in Computational Mathematics (SSCM, volume 6)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Discrete Iterations and Automata Networks: Basic Concepts

    • François Robert
    Pages 1-25

  3. A Metric Tool

    • François Robert
    Pages 27-41

  4. The Boolean Perron-Frobenius and Stein-Rosenberg Theorems

    • François Robert
    Pages 43-55

  5. Boolean Contraction and Applications

    • François Robert
    Pages 57-78

  6. Comparison of Operating Modes

    • François Robert
    Pages 79-93

  7. The Discrete Derivative and Local Convergence

    • François Robert
    Pages 95-129

  8. A Discrete Newton Method

    • François Robert
    Pages 131-166

  9. General Conclusion

    • François Robert
    Pages 166-166

  10. Back Matter

    Pages 167-195
    Download chapter PDF
Back to top

Keywords

About this book

a c 9 h In presenting this monograph, I would like to indicate both its orientation as well as my personal reasons for being interested in discrete iterations (that is, iterations on a generally very large,jinite set). While working in numerical analysis I have been interested in two main aspects: - the algorithmic aspect: an iterative algorithm is a mathematical entity which behaves in a dynamic fashion. Even if it is started far from a solution, it will often tend to get closer and closer. - the mathematical aspect: this consists of a coherent and rigorous analy­ sis of convergence, with the aid of mathematical tools (these tools are mainly the use of norms for convergence proofs, the use of matrix algebra and so on). One may for example refer to the algorithmic and mathematical aspects of Newton's method in JRn as well as to the QR algorithm for eigenvalues of matrices. These two algorithms seem to me to be the most fascinating algorithms in numerical analysis, since both show a remarkable practical efficiency even though there exist relatively few global convergence results for them.

Authors and Affiliations

  • University of Grenoble, Institut IMAG, Saint Martin d’Heres, France

    François Robert

Bibliographic Information

  • Book Title: Discrete Iterations

  • Book Subtitle: A Metric Study

  • Authors: François Robert

  • Series Title: Springer Series in Computational Mathematics

  • DOI: https://doi.org/10.1007/978-3-642-61607-5

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1986

  • Softcover ISBN: 978-3-642-64882-3Published: 06 October 2011

  • eBook ISBN: 978-3-642-61607-5Published: 06 December 2012

  • Series ISSN: 0179-3632

  • Series E-ISSN: 2198-3712

  • Edition Number: 1

  • Number of Pages: XVI, 198

  • Topics: Numerical Analysis

Publish with us

Policies and ethics

Back to top

Search

Navigation