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 questions only
not deleted
user 163824
Algorithms to approximate numerically a root of a nonlinear equation or system: for instance, Newton's method, secant method, bisection, etc.
2
votes
0
answers
230
views
A question in regards to finding the roots of numbers
A simple algorithm for finding the square root of any integer goes as the following:
example $√25$: $25 - 1 -3 - 5 - 7 - 9 = 0$
We have deducted 5 numbers (-1, -3, -5, -7, -9) without resulting in a n …
- 55