Families of rational maps and iterative root-finding algorithms
Curtis Tracy McMullen
Reading Time
at 250 WPM32 minutes
The average reader, reading at a speed of 250 WPM, would take 32 minutes to read Families of rational maps and iterative root-finding algorithms.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
2
days at 30 min/day
32
total minutes
Families of rational maps and iterative root-finding algorithms
Published
1985
Pages
32
Subjects
A study of a modified form of Newton's method for real root approximations
Tables of indices and primitive roots
Root locus technique and a digital computer solution
Tumminello theory of numerical roots
Di un nuovo metodo generale di estrarre le radici numeriche
開諸乘方捷術
Frequently Asked Questions
How many pages are in Families of rational maps and iterative root-finding algorithms?
This edition of Families of rational maps and iterative root-finding algorithms has approximately 32 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Families of rational maps and iterative root-finding algorithms?
For most readers, Families of rational maps and iterative root-finding algorithms typically takes between 40m and 27m to complete. This is based on the book's length of approximately 8,000 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 32m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 2 days • Estimated word count: 8,000 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Families of rational maps and iterative root-finding algorithms?
The estimated word count for Families of rational maps and iterative root-finding algorithms is approximately 8,000 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Families of rational maps and iterative root-finding algorithms?
Families of rational maps and iterative root-finding algorithms was written by Curtis Tracy McMullen.
When was Families of rational maps and iterative root-finding algorithms published?
The publication date for this specific edition is 1985. The original work may have been published on a different date.