chore: clean-up

Signed-off-by: Athan <kgryte@gmail.com>

Author: kgryte

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

@@ -39,6 +39,8 @@
 *
 * ## Notes
 *
+* The function evaluates
+*
 * ```text
 *        N-1
 *         - '
@@ -47,17 +49,17 @@
 *        i=0
 * ```
 *
-* of Chebyshev polynomials Ti at argument x/2.
-*
-* 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.
+* of Chebyshev polynomials `Ti` at argument `x/2`.
 *
-* 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.
+* A few comments:
 *
-* 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.
+* -   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.
+* -   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.
+* -   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`.
 *
-* ## Speed
+* ### Performance
 *
-* Taking advantage of the recurrence properties of the Chebyshev polynomials, the routine requires one more addition per loop than evaluating a nested polynomial of the same degree.
+* -   Taking advantage of the recurrence properties of the Chebyshev polynomials, the routine requires one more addition per loop than evaluating a nested polynomial of the same degree.
 *
 * @param {number} x - evaluation point
 * @param {NumericArray} c - series coefficients in descending degree order