Abstract
It is difficult (practically impossible) to invent a serious problem that would have not been reduced to a search for the minimum of a functional over some range. That is why the design and analysis of minimization methods is a vast field from which we select for discussion only some useful ideas and methods.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. K. Faddeev and V. N. Faddeeva. Computational Methods of Linear Algebra. San Francisco — London, 1963.
W. Baur and V. Strassen. The complexity of partial derivatives. Theor. Comput. Sci. 22: 317–330 (1983).
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 18. In: A Brief Introduction to Numerical Analysis. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8136-4_18
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8136-4_18
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