Abstract
Suppose that an iterative method M generates successive approximations \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}\to {X} _0 ,\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}\to {X} _1 , \ldots\) to a solution \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}\to {X} *\) of the system
of n nonlinear equations in n unknowns.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Plenum Press, New York
About this chapter
Cite this chapter
Brent, R. (1972). The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds) Complexity of Computer Computations. The IBM Research Symposia Series. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-2001-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-2001-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-2003-6
Online ISBN: 978-1-4684-2001-2
eBook Packages: Springer Book Archive