Abstract
For various mathematical objects, we want to become aware how to compute them. However, any algorithm produces no more than some other objects which, as we hope, are “close” to the ones in question. Thus, we need to have a rigorous definition of “closeness” for different objects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tyrtyshnikov, E.E. (1997). Lecture 1. In: A Brief Introduction to Numerical Analysis. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8136-4_1
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8136-4_1
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6413-2
Online ISBN: 978-0-8176-8136-4
eBook Packages: Springer Book Archive