
Notes and References
There are many excellent books for further reading on the topics so concisely
introduced in this text. Here we provide several pointers based on our personal
preferences, which, we hope, will help the reader to avoid getting overwhelmed
by the variety of available choices.
The following texts are good choices for learning more about numerical
methods for problems discussed in Part II of this text, as well as their com-
puter implementations: [9,14,18,24]. The classical book by Cormen et al. [13]
provides a great, in-depth introduction to algorithms. See [16, 28] for more
information on computational complexity.
The discussion in