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 na.numerical-analysis
Search options not deleted
user 3206
Numerical algorithms for problems in analysis and algebra, scientific computation
3
votes
Fast evaluation of polynomials
The cheapest way of finding the value of a polynomial, given unlimited preprocessing resources, is to look up the precalculated value in the table. However, if you know you are going to need several …
- 3,209
1
vote
Degree necessary of a polynomial?
The requirement that $f(0)=0$ and that $f(x)$ is a polynomial allows us to rewrite the problem:
What polynomial $g(x)$ is there so that $f(x)=xg(x)$ meets the desired restrictions? We can now ignore …
- 3,209