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 525243
Algorithms to approximate numerically a root of a nonlinear equation or system: for instance, Newton's method, secant method, bisection, etc.
0
votes
Finding closed form roots for pseudo-trinomial
After spending some time on it, below is my proposed solution.
We can undergo another change of variables to make it a trinomial:
$t=\frac{1}{\sqrt{y}}$ and we obtain:
\begin{align}
A \cdot t^{k+1} + …
- 11
1
vote
1
answer
94
views
Finding closed form roots for pseudo-trinomial
I have the below function:
$$\pi(x) = \frac{s_0\cdot \left(1-\left(\frac{s_1}{s_1+x \cdot \lambda}\right)^{k}\right) \cdot r_1}{s_0\cdot \left(1-\left(\frac{s_1}{s_1+x \cdot \lambda}\right)^{k}\right) …
- 11