Skip to content

Commit 885db24

Browse files
committed
tweak
1 parent 506d70a commit 885db24

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
Fast multidimensional Chebyshev polynomial interpolation on a hypercube (Cartesian-product)
66
domain, using a separable (tensor-product) grid of Chebyshev interpolation points, as well as Chebyshev regression (least-square fits) from an arbitrary set of points. In both cases we support arbitrary dimensionality, complex and vector-valued functions, and fast derivative and Jacobian computation.
77

8-
[Chebyshev polynomials](https://en.wikipedia.org/wiki/Chebyshev_polynomials) are simply a well-behaved basis for polynomial functions in a given finite interval, so you can use FastChebInterp as a **robust and convenient way to perform multidimensional polynomial fitting and interpolation**. Fitting to high-degree polynomials can be problematic unless your number of data points is much greater than the number of polynomial terms, but if you have a [smooth function](https://en.wikipedia.org/wiki/Smoothness) and interpolate from specially chosen points — the Chebyshev points, given by the function `chebpoints` below — then it is very well behaved, and in fact converges exponentially fast for analytic functions. (See, for example, the book [*Approximation Theory and Approximation Practice*](https://www.chebfun.org/ATAP/) by Trefethen.)
8+
[Chebyshev polynomials](https://en.wikipedia.org/wiki/Chebyshev_polynomials) are simply a well-behaved basis for polynomial functions in a given finite interval, so you can use FastChebInterp as a **robust and convenient way to perform multidimensional polynomial fitting and interpolation**. Fitting to high-degree polynomials can be problematic unless your number of data points is much greater than the number of polynomial terms, but if you have a [smooth function](https://en.wikipedia.org/wiki/Smoothness) and interpolate from specially chosen points — the Chebyshev points, given by the function `chebpoints` below — then it is very well behaved, and in fact converges exponentially quickly for analytic functions. (See, for example, the book [*Approximation Theory and Approximation Practice*](https://www.chebfun.org/ATAP/) by Trefethen.)
99

1010
## Usage
1111

0 commit comments

Comments
 (0)