From Wikipedia, the free encyclopedia
|
This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics. |
| Mathematics rating: |
Start Class |
Low Priority |
Field: Analysis |
| Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. |
|
|
The reader is greeted with a heaping helping of jargon, consider expanding the lead and making it more friendly-- Cronholm144 23:24, 12 May 2007 (UTC) |
|
This page could benefit from at least two more items:
1. A little more information on how the initial z_k values are chosen. Currently, the page just states that they are possible to compute, which is not useful for someone wanting to implement the method.
2. The formula for computing w_k involves evaluating p(x_k) and p'(x_k). What are those? Should it say p(z_k) and p'(z_k) instead?
//T
-
- 1) One can estimate the size of the roots from the size of the coefficients. Chose the initial points randomly inside the disk of the root radius or perhaps of 1.2 the root radius. The cited paper uses some Gräffe iterations to get a better estimate on the distribution of th roots and chooses initial points accordingly. Using the tangent version of the Graeffe iteration one could even guess approximations for the roots.
- 2.) Of course, that should be consistent.--LutzL (talk) 12:26, 20 April 2008 (UTC)
