Abstract
When developing software for mathematical computations, we meet, apart from questions of code verification and empirical testing, a number of tasks at a higher level of abstraction. These include
-
(i)
Devising or selecting suitable algorithms to solve the problems, and being able to understand how these work;
-
(ii)
Selecting the ‘best’ algorithms according to certain criteria of efficiency, generality etc.;
-
(iii)
Proving that the chosen algorithms will work correctly for the class of problem which they are intended to solve.
Roll up that map; it will not be wanted these ten years.
William Pitt The Younger
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dew, P.M., James, K.R. (1983). Basic Mathematics and Applications. In: Introduction to Numerical Computation in Pascal. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3940-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3940-4_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3942-8
Online ISBN: 978-1-4757-3940-4
eBook Packages: Springer Book Archive