Fast method to solve transcendental equation for a range of parameters?Limit solution to a transcendental equationNewton Raphson Method Overestimating ParametersNewton-Raphson 2 variable method: Finding complex solutionsNewton Raphson when we can calculate second derivativeNewton-Raphson method with $c_0=3$ to calculate $c_1$.Newton-Raphson method for a vector function with root bracketing / root constraint?Multiple roots for nonlinear algebraic equationsOrder of convergence of the Newton-Raphson methodNewton-Raphson method for complex numbersUsing Newton-Raphson method, find the solution for $e^fracx^24vt = 1+fracx^22vt$
How to test the sharpness of a knife?
Magnifying glass in hyperbolic space
Can you take a "free object interaction" while incapacitated?
Hashing password to increase entropy
categorizing a variable turns it from insignificant to significant
Would this string work as string?
Put the phone down / Put down the phone
Showing mass murder in a kid's book
Checking @@ROWCOUNT failing
Why is indicated airspeed rather than ground speed used during the takeoff roll?
Rendered textures different to 3D View
Has the laser at Magurele, Romania reached a tenth of the Sun's power?
What should be the ideal length of sentences in a blog post for ease of reading?
PTIJ: Which Dr. Seuss books should one obtain?
How to split IPA spelling into syllables
Asserting that Atheism and Theism are both faith based positions
What is the tangent at a sharp point on a curve?
I keep switching characters, how do I stop?
Should I warn a new PhD Student?
Pre-Employment Background Check With Consent For Future Checks
How to get directions in deep space?
Capacitor electron flow
What is the period/term used describe Giuseppe Arcimboldo's style of painting?
Started in 1987 vs. Starting in 1987
Fast method to solve transcendental equation for a range of parameters?
Limit solution to a transcendental equationNewton Raphson Method Overestimating ParametersNewton-Raphson 2 variable method: Finding complex solutionsNewton Raphson when we can calculate second derivativeNewton-Raphson method with $c_0=3$ to calculate $c_1$.Newton-Raphson method for a vector function with root bracketing / root constraint?Multiple roots for nonlinear algebraic equationsOrder of convergence of the Newton-Raphson methodNewton-Raphson method for complex numbersUsing Newton-Raphson method, find the solution for $e^fracx^24vt = 1+fracx^22vt$
$begingroup$
I have an equation of the form
$t + e^Ax + e^Bx = 0$
This is a transcendental equation, and I would use a Newton-Raphson algorithm or uniroot
in R
, to solve for $x$.
I am interested in finding the solution to this equation for a range of values of $t$.
Do I need to repeat the same algorithm for every value of $t$, or is there any way in which I can use the solution for a particular $t$ to calculate the solution for other values of $t$?
Edit: In my specific problem I have $A > 0$ and $B<0$.
numerical-methods newton-raphson transcendental-equations programming
$endgroup$
add a comment |
$begingroup$
I have an equation of the form
$t + e^Ax + e^Bx = 0$
This is a transcendental equation, and I would use a Newton-Raphson algorithm or uniroot
in R
, to solve for $x$.
I am interested in finding the solution to this equation for a range of values of $t$.
Do I need to repeat the same algorithm for every value of $t$, or is there any way in which I can use the solution for a particular $t$ to calculate the solution for other values of $t$?
Edit: In my specific problem I have $A > 0$ and $B<0$.
numerical-methods newton-raphson transcendental-equations programming
$endgroup$
$begingroup$
Can you say something about the range of values that can be taken by parmaeter $A$ and $B$, positive, negative, $[0,1]$, any value ?
$endgroup$
– Jean Marie
Mar 13 at 22:30
$begingroup$
Sure, I added the restrictions on $A$ and $B$ from my specific problem to the question.
$endgroup$
– robust
Mar 14 at 0:33
add a comment |
$begingroup$
I have an equation of the form
$t + e^Ax + e^Bx = 0$
This is a transcendental equation, and I would use a Newton-Raphson algorithm or uniroot
in R
, to solve for $x$.
I am interested in finding the solution to this equation for a range of values of $t$.
Do I need to repeat the same algorithm for every value of $t$, or is there any way in which I can use the solution for a particular $t$ to calculate the solution for other values of $t$?
Edit: In my specific problem I have $A > 0$ and $B<0$.
numerical-methods newton-raphson transcendental-equations programming
$endgroup$
I have an equation of the form
$t + e^Ax + e^Bx = 0$
This is a transcendental equation, and I would use a Newton-Raphson algorithm or uniroot
in R
, to solve for $x$.
I am interested in finding the solution to this equation for a range of values of $t$.
Do I need to repeat the same algorithm for every value of $t$, or is there any way in which I can use the solution for a particular $t$ to calculate the solution for other values of $t$?
Edit: In my specific problem I have $A > 0$ and $B<0$.
numerical-methods newton-raphson transcendental-equations programming
numerical-methods newton-raphson transcendental-equations programming
edited Mar 14 at 0:32
robust
asked Mar 13 at 18:08
robustrobust
163
163
$begingroup$
Can you say something about the range of values that can be taken by parmaeter $A$ and $B$, positive, negative, $[0,1]$, any value ?
$endgroup$
– Jean Marie
Mar 13 at 22:30
$begingroup$
Sure, I added the restrictions on $A$ and $B$ from my specific problem to the question.
$endgroup$
– robust
Mar 14 at 0:33
add a comment |
$begingroup$
Can you say something about the range of values that can be taken by parmaeter $A$ and $B$, positive, negative, $[0,1]$, any value ?
$endgroup$
– Jean Marie
Mar 13 at 22:30
$begingroup$
Sure, I added the restrictions on $A$ and $B$ from my specific problem to the question.
$endgroup$
– robust
Mar 14 at 0:33
$begingroup$
Can you say something about the range of values that can be taken by parmaeter $A$ and $B$, positive, negative, $[0,1]$, any value ?
$endgroup$
– Jean Marie
Mar 13 at 22:30
$begingroup$
Can you say something about the range of values that can be taken by parmaeter $A$ and $B$, positive, negative, $[0,1]$, any value ?
$endgroup$
– Jean Marie
Mar 13 at 22:30
$begingroup$
Sure, I added the restrictions on $A$ and $B$ from my specific problem to the question.
$endgroup$
– robust
Mar 14 at 0:33
$begingroup$
Sure, I added the restrictions on $A$ and $B$ from my specific problem to the question.
$endgroup$
– robust
Mar 14 at 0:33
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Here is a solution that transforms the initial problem with 2 parameters into a 1 parameter issue, easier to tackle.
Set $C=B/A$ (a negative number because $A>0$ and $B<0$).
Let us make a (bijective !) change of variable
$$u=e^Ax iff x=frac1Atextln(u)tag1$$
Important remark : $u>0$.
The initial equation
$$x+e^Ax+e^Bx=0 tag2$$
is thus transformed into
$$underbracet+u+u^C_f(u)=0tag3$$
or, geometrically, into the intersection of
$$begincasesy&=&u^C& text(curve with asymptotes) \y&=&-u-t& textline with slope -1endcasestag4$$
Fig. 1 illustrates (4).
Three cases can occur (due to the fact that the straight line hits the $y$ axis in $-t$) :
either zero solutions when $t<t_0$ for a certain $t_0$.
(exceptionally) one solution when $t=t_0$,
2 solutions when $t=t_0$,
and in this case which one do you desire ?
I have assumed here that we are looking for the root with the highest magnitude.
The choice of the initial value is directed by the diagram : if we take the initial value $u=-t$, for big values of $-t$, we will be already rather close to the final value.
The following Matlab program applying Newton iteration is very efficient :
A=1.;B=-2.5;C=B/A;
t=-3;
u=-t, % initialization
for k=1:4, % 4 iterations are usually enough
u=u-(t+u+u^C)/(1+C*u^(C-1)), % Newton iteration step u = u-f(u)/f'(u)
end;
x=(1/A)*log(u), % solution x=x(t)
t+exp(A*x)+exp(B*x), % checking that this value is (almost !) zero
Fig. 1 : (case $A=1, B=-2.5, C=B/A=-2.5$. Horizontal axis is for $u$ variable). Curve with equation $y=u^C$ and two straight lines with resp. equations $y=-u-t_0$ and $y=-u-t$ for two different values of $t$ ($t=-3$ and $t=t_0 approx 1.818$); Newton recurrence relationship with initial value $u_0=3$ gives final value $u_5=2.9321...$ out of which $x=1.0757...$.
$endgroup$
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
1
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146956%2ffast-method-to-solve-transcendental-equation-for-a-range-of-parameters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Here is a solution that transforms the initial problem with 2 parameters into a 1 parameter issue, easier to tackle.
Set $C=B/A$ (a negative number because $A>0$ and $B<0$).
Let us make a (bijective !) change of variable
$$u=e^Ax iff x=frac1Atextln(u)tag1$$
Important remark : $u>0$.
The initial equation
$$x+e^Ax+e^Bx=0 tag2$$
is thus transformed into
$$underbracet+u+u^C_f(u)=0tag3$$
or, geometrically, into the intersection of
$$begincasesy&=&u^C& text(curve with asymptotes) \y&=&-u-t& textline with slope -1endcasestag4$$
Fig. 1 illustrates (4).
Three cases can occur (due to the fact that the straight line hits the $y$ axis in $-t$) :
either zero solutions when $t<t_0$ for a certain $t_0$.
(exceptionally) one solution when $t=t_0$,
2 solutions when $t=t_0$,
and in this case which one do you desire ?
I have assumed here that we are looking for the root with the highest magnitude.
The choice of the initial value is directed by the diagram : if we take the initial value $u=-t$, for big values of $-t$, we will be already rather close to the final value.
The following Matlab program applying Newton iteration is very efficient :
A=1.;B=-2.5;C=B/A;
t=-3;
u=-t, % initialization
for k=1:4, % 4 iterations are usually enough
u=u-(t+u+u^C)/(1+C*u^(C-1)), % Newton iteration step u = u-f(u)/f'(u)
end;
x=(1/A)*log(u), % solution x=x(t)
t+exp(A*x)+exp(B*x), % checking that this value is (almost !) zero
Fig. 1 : (case $A=1, B=-2.5, C=B/A=-2.5$. Horizontal axis is for $u$ variable). Curve with equation $y=u^C$ and two straight lines with resp. equations $y=-u-t_0$ and $y=-u-t$ for two different values of $t$ ($t=-3$ and $t=t_0 approx 1.818$); Newton recurrence relationship with initial value $u_0=3$ gives final value $u_5=2.9321...$ out of which $x=1.0757...$.
$endgroup$
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
1
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
add a comment |
$begingroup$
Here is a solution that transforms the initial problem with 2 parameters into a 1 parameter issue, easier to tackle.
Set $C=B/A$ (a negative number because $A>0$ and $B<0$).
Let us make a (bijective !) change of variable
$$u=e^Ax iff x=frac1Atextln(u)tag1$$
Important remark : $u>0$.
The initial equation
$$x+e^Ax+e^Bx=0 tag2$$
is thus transformed into
$$underbracet+u+u^C_f(u)=0tag3$$
or, geometrically, into the intersection of
$$begincasesy&=&u^C& text(curve with asymptotes) \y&=&-u-t& textline with slope -1endcasestag4$$
Fig. 1 illustrates (4).
Three cases can occur (due to the fact that the straight line hits the $y$ axis in $-t$) :
either zero solutions when $t<t_0$ for a certain $t_0$.
(exceptionally) one solution when $t=t_0$,
2 solutions when $t=t_0$,
and in this case which one do you desire ?
I have assumed here that we are looking for the root with the highest magnitude.
The choice of the initial value is directed by the diagram : if we take the initial value $u=-t$, for big values of $-t$, we will be already rather close to the final value.
The following Matlab program applying Newton iteration is very efficient :
A=1.;B=-2.5;C=B/A;
t=-3;
u=-t, % initialization
for k=1:4, % 4 iterations are usually enough
u=u-(t+u+u^C)/(1+C*u^(C-1)), % Newton iteration step u = u-f(u)/f'(u)
end;
x=(1/A)*log(u), % solution x=x(t)
t+exp(A*x)+exp(B*x), % checking that this value is (almost !) zero
Fig. 1 : (case $A=1, B=-2.5, C=B/A=-2.5$. Horizontal axis is for $u$ variable). Curve with equation $y=u^C$ and two straight lines with resp. equations $y=-u-t_0$ and $y=-u-t$ for two different values of $t$ ($t=-3$ and $t=t_0 approx 1.818$); Newton recurrence relationship with initial value $u_0=3$ gives final value $u_5=2.9321...$ out of which $x=1.0757...$.
$endgroup$
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
1
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
add a comment |
$begingroup$
Here is a solution that transforms the initial problem with 2 parameters into a 1 parameter issue, easier to tackle.
Set $C=B/A$ (a negative number because $A>0$ and $B<0$).
Let us make a (bijective !) change of variable
$$u=e^Ax iff x=frac1Atextln(u)tag1$$
Important remark : $u>0$.
The initial equation
$$x+e^Ax+e^Bx=0 tag2$$
is thus transformed into
$$underbracet+u+u^C_f(u)=0tag3$$
or, geometrically, into the intersection of
$$begincasesy&=&u^C& text(curve with asymptotes) \y&=&-u-t& textline with slope -1endcasestag4$$
Fig. 1 illustrates (4).
Three cases can occur (due to the fact that the straight line hits the $y$ axis in $-t$) :
either zero solutions when $t<t_0$ for a certain $t_0$.
(exceptionally) one solution when $t=t_0$,
2 solutions when $t=t_0$,
and in this case which one do you desire ?
I have assumed here that we are looking for the root with the highest magnitude.
The choice of the initial value is directed by the diagram : if we take the initial value $u=-t$, for big values of $-t$, we will be already rather close to the final value.
The following Matlab program applying Newton iteration is very efficient :
A=1.;B=-2.5;C=B/A;
t=-3;
u=-t, % initialization
for k=1:4, % 4 iterations are usually enough
u=u-(t+u+u^C)/(1+C*u^(C-1)), % Newton iteration step u = u-f(u)/f'(u)
end;
x=(1/A)*log(u), % solution x=x(t)
t+exp(A*x)+exp(B*x), % checking that this value is (almost !) zero
Fig. 1 : (case $A=1, B=-2.5, C=B/A=-2.5$. Horizontal axis is for $u$ variable). Curve with equation $y=u^C$ and two straight lines with resp. equations $y=-u-t_0$ and $y=-u-t$ for two different values of $t$ ($t=-3$ and $t=t_0 approx 1.818$); Newton recurrence relationship with initial value $u_0=3$ gives final value $u_5=2.9321...$ out of which $x=1.0757...$.
$endgroup$
Here is a solution that transforms the initial problem with 2 parameters into a 1 parameter issue, easier to tackle.
Set $C=B/A$ (a negative number because $A>0$ and $B<0$).
Let us make a (bijective !) change of variable
$$u=e^Ax iff x=frac1Atextln(u)tag1$$
Important remark : $u>0$.
The initial equation
$$x+e^Ax+e^Bx=0 tag2$$
is thus transformed into
$$underbracet+u+u^C_f(u)=0tag3$$
or, geometrically, into the intersection of
$$begincasesy&=&u^C& text(curve with asymptotes) \y&=&-u-t& textline with slope -1endcasestag4$$
Fig. 1 illustrates (4).
Three cases can occur (due to the fact that the straight line hits the $y$ axis in $-t$) :
either zero solutions when $t<t_0$ for a certain $t_0$.
(exceptionally) one solution when $t=t_0$,
2 solutions when $t=t_0$,
and in this case which one do you desire ?
I have assumed here that we are looking for the root with the highest magnitude.
The choice of the initial value is directed by the diagram : if we take the initial value $u=-t$, for big values of $-t$, we will be already rather close to the final value.
The following Matlab program applying Newton iteration is very efficient :
A=1.;B=-2.5;C=B/A;
t=-3;
u=-t, % initialization
for k=1:4, % 4 iterations are usually enough
u=u-(t+u+u^C)/(1+C*u^(C-1)), % Newton iteration step u = u-f(u)/f'(u)
end;
x=(1/A)*log(u), % solution x=x(t)
t+exp(A*x)+exp(B*x), % checking that this value is (almost !) zero
Fig. 1 : (case $A=1, B=-2.5, C=B/A=-2.5$. Horizontal axis is for $u$ variable). Curve with equation $y=u^C$ and two straight lines with resp. equations $y=-u-t_0$ and $y=-u-t$ for two different values of $t$ ($t=-3$ and $t=t_0 approx 1.818$); Newton recurrence relationship with initial value $u_0=3$ gives final value $u_5=2.9321...$ out of which $x=1.0757...$.
edited Mar 15 at 10:29
answered Mar 14 at 1:14
Jean MarieJean Marie
30.8k42154
30.8k42154
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
1
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
add a comment |
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
1
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
$begingroup$
I have completely re-written my text that is now a full-fleshed solution. It can be improved, of course. Can you tell me if it agrees you ?
$endgroup$
– Jean Marie
Mar 15 at 4:40
1
1
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
+1. I appreciate the reduction to a one parameter problem. It occurred to me that usual error formula for Newton's method $e_n+1^2 = - frac12 fracf''(xi_n)f'(x_n)$ allows us to approximate the distribution of the initial guesses needed to quickly solve any for any $t$ in a bounded interval. This suggests to me a whole set of nice practice problems of the non-linear-solve, table-look-up, interpolation type.
$endgroup$
– Carl Christian
Mar 15 at 9:44
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
$begingroup$
@Carl Christian Yes, this issue could be extended as a nice student's project for example for a recap of a certain number of Numerical Analysis methods...
$endgroup$
– Jean Marie
Mar 15 at 10:33
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146956%2ffast-method-to-solve-transcendental-equation-for-a-range-of-parameters%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Can you say something about the range of values that can be taken by parmaeter $A$ and $B$, positive, negative, $[0,1]$, any value ?
$endgroup$
– Jean Marie
Mar 13 at 22:30
$begingroup$
Sure, I added the restrictions on $A$ and $B$ from my specific problem to the question.
$endgroup$
– robust
Mar 14 at 0:33