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 polynomials
Search options not deleted
user 44539
Questions in which polynomials (single or several variables) play a key role. It is typically important that this tag is combined with other tags; polynomials appear in very different contexts. Please, use at least one of the top-level tags, such as nt.number-theory, co.combinatorics, ac.commutative-algebra, in addition to it. Also, note the more specific tags for some special types of polynomials, e.g., orthogonal-polynomials, symmetric-polynomials.
0
votes
1
answer
633
views
About the maximum degree of multivariate polynomial interpolation
It is well known that in the univariate case, to interpolate $k$ points in $\mathbb{R}$, we need to use a polynomial of degree $k-1$.
My question is about multivariate polynomial interpolation in hi …
- 401
8
votes
1
answer
361
views
is there any such result about Bernstein polynomials?
Since $\{{n\choose i} x^i (1-x)^{n-i}\}_{i=0,...,n}$ is a basis of all polynomials of degree at most $n$, so it is possible to approximate $f$ with error $O(1/n)$ using $\sum_{i=1}^n c_i {n\choose i} x …
- 401