Skip to content

Commit a716455

Browse files
authored
Apply suggestions from code review
Co-authored-by: Athan <kgryte@gmail.com> Signed-off-by: Athan <kgryte@gmail.com>
1 parent f309a23 commit a716455

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

  • lib/node_modules/@stdlib/math/base/tools/chebyshev-series/lib

lib/node_modules/@stdlib/math/base/tools/chebyshev-series/lib/main.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -53,7 +53,7 @@
5353
*
5454
* A few comments:
5555
*
56-
* - Coefficients are stored in reverse order (i.e., the zero order term is last in the array). Note `N` is the number of coefficients, not the order.
56+
* - Coefficients must be stored in reverse order (i.e., the zero order term is last in the array). Note `N` is the number of coefficients, not the order.
5757
* - If coefficients are for the interval `a` to `b`, `x` must have been transformed to `x` -> `2(2x - b - a)/(b-a)` before entering the routine. This maps `x` from `(a, b)` to `(-1, 1)`, over which the Chebyshev polynomials are defined.
5858
* - If the coefficients are for the inverted interval, in which `(a, b)` is mapped to `(1/b, 1/a)`, the transformation required is `x` -> `2(2ab/x - b - a)/(b-a)`. If `b` is infinity, this becomes `x` -> `4a/x - 1`.
5959
*

0 commit comments

Comments
 (0)