Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Iteration Revisited Examples From a General Theory

Poul Wulff PedersenContact Information

(7)  Margerittens Kvarter 40, DK-2990 Nivaa, Denmark
Abstract
For’ any’ equation F(x) = 0 with an isolated solution x* which we want to compute, it will be shown that quantities pn can be defined and computed so that xpn+1:= xpn +pn · F(xpn)
will’ converge’ with’ any’ speed needed, i.e. starting with an xp0 in a neigbourhood of x*, xpN will for for some small value of N give x* within the precision you need. And it will do so even if the ’standard’ iteration xn+1:= xn+ F(xn) is divergent.

Contact Information Poul Wulff Pedersen
Email: p-w-p@get2net.dk
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.105 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)