Skip to main content

Part of the book series: Computer Science Series

  • 40 Accesses

Abstract

So far we have assumed that, given long enough, the programs we use will get as close to ‘the solution’ as we care to specify. That is what we mean in this book by the word ‘convergence’: it is not quite the same as the meaning of ‘convergence’ in a maths book. When we need to distinguish between the rigorous idea of convergence in maths books and the rough-and-ready approach to convergence we shall use in our computer programs we shall refer to them respectively as

  1. (i)

    true convergence, and

  2. (ii)

    pseudo-convergence.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1986 Gordon Reece

About this chapter

Cite this chapter

Reece, G. (1986). Convergence and Divergence. In: Microcomputer Modelling by Finite Differences. Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-09051-8_3

Download citation

Publish with us

Policies and ethics