Talk:Remez algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Mathematics (Rated Start-class, Low-priority)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Start Class
Low Priority
 Field:  Analysis
WikiProject Russia / Science & education (Rated Start-class, Low-importance)
WikiProject icon This article is within the scope of WikiProject Russia, a WikiProject dedicated to coverage of Russia on Wikipedia.
To participate: Feel free to edit the article attached to this page, join up at the project page, or contribute to the project discussion.
Start-Class article Start  This article has been rated as Start-Class on the project's quality scale.
 Low  This article has been rated as Low-importance on the project's importance scale.
Taskforce icon
This article is supported by the science and education in Russia task force.

Someone should modify the 'Procedure' section to flow more like: 's guide to remez algorithm.. much better and more reliable --skimnc — Preceding unsigned comment added by Skimnc (talkcontribs) 07:50, 19 September 2011 (UTC)

Does the person who made the changes before me have a source to cite? I don't see here that the algorithm as stated here converges. --Pftupper 02:27, 4 November 2006 (UTC)

Yes, see Tony Ralston's NA books, or Forman Acton's 00:04, 5 November 2006 (UTC)
I'm still not convinced. Please cite more specifically, title, date, section, definition number, page. Penguian (talk) 03:14, 20 January 2008 (UTC)
I too agree that this algorithm is not correct. Here is a simple description of it: —Preceding unsigned comment added by (talk) 10:06, 18 January 2010 (UTC)

Can someone explain to me what in the section "Procedure" the E is and where it does come from? Does it stand for Error, and if so, for what kind of error? This is totally unspecified —Preceding unsigned comment added by (talk) 15:43, 11 May 2009 (UTC)

Only the minmax[edit]

The first paragraph suggests that Remez algorithms can be used for more than arriving at just the minmax polynomial in the sense of Chebychev, such as optimal rational approximations. Then the second paragraph describes an algorithm restricted to the minmax. So I'm afraid this leaves a hole. My impression is that (from the titles of the papers) that this description is (more or less) correct for the original algorithm. I'm personnally interested in polynomial approximations. It looks like the modification in Remez algorithm is so small that authors tend to gloss over the difference. If nowadays Remez is used for these other types too, that must be acknowledged, of course. [An iteration who states that results (in floating point) must become equal is unsatisfactory IMHO.] —Preceding unsigned comment added by (talk) 19:40, 8 October 2010 (UTC)

Lebesgue constant[edit]

In the section "On the choice of initialization", much important information about the Lebesgue constant is provided while in turn missing in Lebesgue constant: maybe move part of it? — Preceding unsigned comment added by (talk) 03:46, 17 September 2012 (UTC)


Does this algorithm converge? Under what conditions does it converge? The introduction and main body of this article does not seem to be pointing out these facts. Can someone help? Jay (User talk:Shantham11) 10:01, 4 December 2013 (UTC)