summaryrefslogtreecommitdiff
path: root/lib/math
diff options
context:
space:
mode:
authorS. Gilles <sgilles@math.umd.edu>2018-07-24 06:00:28 +0000
committerS. Gilles <sgilles@math.umd.edu>2018-07-24 06:00:50 +0000
commitc8fc28663680895932ff0b2014e2abefc63abf8f (patch)
tree3266fabb04d5ce1290279d3cd564b523c2912785 /lib/math
parentfc17cedc8457c6493887b60435c3c16d99784560 (diff)
downloadmc-c8fc28663680895932ff0b2014e2abefc63abf8f.tar.gz
Document that generate-minimax-by-Remez.gp has issues.
Diffstat (limited to 'lib/math')
-rw-r--r--lib/math/ancillary/generate-minimax-by-Remez.gp4
1 files changed, 3 insertions, 1 deletions
diff --git a/lib/math/ancillary/generate-minimax-by-Remez.gp b/lib/math/ancillary/generate-minimax-by-Remez.gp
index 56b862f..7ac32ff 100644
--- a/lib/math/ancillary/generate-minimax-by-Remez.gp
+++ b/lib/math/ancillary/generate-minimax-by-Remez.gp
@@ -1,6 +1,8 @@
/*
Attempts to find a minimax polynomial of degree n for f via Remez
- algorithm.
+ algorithm. The Remez algorithm appears to be slightly shot, but
+ the initial step of approximating by Chebyshev nodes works, and
+ is usually good enough.
*/
{ chebyshev_node(a, b, k, n) = my(p, m, c);