Abstract
The focus of this chapter is on the result that the complexity of a continuation algorithm can be bounded essentially by the square of the condition number of the homotopy.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blum, L., Cucker, F., Shub, M., Smale, S. (1998). Complexity and the Condition Number. In: Complexity and Real Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0701-6_14
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0701-6_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6873-4
Online ISBN: 978-1-4612-0701-6
eBook Packages: Springer Book Archive