HP Forums / HP Calculators (and very old HP Computers) / General Forum v / On Convergence Rates of Root-Seeking Methods

Post Reply 
On Convergence Rates of Root-Seeking Methods
03-05-2018, 10:46 PM (This post was last modified: 03-05-2018 11:53 PM by Valentin Albillo.)
Post: #20
Valentin Albillo Offline
Senior Member
 		Posts: 1,100
Joined: Feb 2015
RE: On Convergence Rates of Root-Seeking Methods
(03-02-2018 01:00 PM)Mike (Stgt) Wrote:  Hi, Namir

what would you as root finding expert recommend to compute sqare roots up to 100'000 digits and more?

Sorry to intrude. You may want to have a look at this PDF document:

AMS Journals - Computing the square root of 2 to 1,000,000 digits

where they discuss the methods used in the past to compute square roots to many thousand places and the particular one they used to compute the square root of 2 to in excess of one million digits.

Also, to check your very own implementation simply google "square root of 2 to 1 million digits" and you'll immediately find a link to the full result.

Regards.
V.
.
  
All My Articles & other Materials here:  Valentin Albillo's HP Collection
 
Visit this user's website Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread



User(s) browsing this thread: 1 Guest(s)

Contact Us | The Museum of HP Calculators | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication