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 102664
Algorithms to approximate numerically a root of a nonlinear equation or system: for instance, Newton's method, secant method, bisection, etc.
3
votes
1
answer
411
views
root solving without analytic derivative
I have two related questions about numerical methods for root solving:
1) $f: R \to R$ is continuous and piece-wise smooth, with $f(a)f(b) < 0$.
$f$ has very high number of knot-points and computing …
- 33