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 rootfinding
Search options not deleted
user 496243
Algorithms to approximate numerically a root of a nonlinear equation or system: for instance, Newton's method, secant method, bisection, etc.
7
votes
3
answers
523
views
Rigorous estimates on roots of function
We consider the function
$$f(x) = 1- \frac{1}{N} \sum_{i=1}^N \frac{\sin\left(\tfrac{\pi i}{N}\right)^2}{1+\sin\left(\tfrac{\pi i}{2N}\right)^2-x}.$$
The arguments of the two sines differ by a factor …
CommunityBot
- 1