Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with interpolation
Search options not deleted
user 141502
Interpolation is the theory of constructing smooth functions, usually polynomials or trigonometric polynomials, whose graph passes through a number of given points in the plane. Splines and Bézier curves, piecewise linear or cubic interpolation, Lagrange and Hermite interpolation are example topics.
3
votes
0
answers
40
views
Bound of a regular function that cancels at some points
\qquad\qquad(2)$$
The proof can be deduced from Lagrange interpolation at point $x_1,\ldots,x_k$. … Since $f$ cancels on these points, Lagrange interpolation polynomial is zero and $(1)$ is the usual remainder formula for Lagrange interpolation. …
- 121