๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal iterative processes for root-finding

โœ Scribed by Richard Brent; Shmuel Winograd; Philip Wolfe

Publisher
Springer-Verlag
Year
1972
Tongue
English
Weight
688 KB
Volume
20
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Choosing Optimal Parameters in Iterative
Choosing Optimal Parameters in Iterative Processes
โœ S. Perfilov ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 515 KB

We consider the problem of choosing optimal parameters in certain iterative procedures. Specifically, we are interested in finite-step processes for which it is possible to estimate the computational cost and the error relaxation in terms of the process parameters. The problem of finding the optimal

Univariate Polynomials: Nearly Optimal A
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
โœ Victor Y. Pan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 552 KB

To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of t