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 answers only
not deleted
user 20302
Algorithms to approximate numerically a root of a nonlinear equation or system: for instance, Newton's method, secant method, bisection, etc.
6
votes
how to solve $\sum_{i=0}^n (x-\mu_i)e^{-(x-\mu_i)^2} = 0$
Here is why solutions do exist. $\newcommand{\bR}{\mathbb{R}}$ Consider the function $f:\bR\to\bR$
$$
f(x)=\sum_{i=1}^n e^{-(x-\mu_i)^2}.
$$
Note that
$$
0\leq f(x)\leq n, \;\;\forall x\in\bR
$$
and
…
- 34.7k