Consider the following equation.
\n\\[\\simplify[std]{e^({m}x)+{b}x-{a}=0}\\]
\nFind the approximate solution in the range $0 \\le x \\le 1$ by using the Newton-Raphson method.
\nThe following diagram demonstrates the method.
\n$x_0$ is the starting value, you can slide it along the x-axis to see the effect of changing it.
\n \n{test(m,b,a,maxy)}
\n \n \n ", "variable_groups": [], "parts": [{"scripts": {}, "showFeedbackIcon": true, "gaps": [{"vsetRangePoints": 5, "customName": "", "answerSimplification": "std", "answer": "(((({m} * x) -1) * Exp(({m} * x))) + {a})", "checkingType": "absdiff", "marks": 1, "checkingAccuracy": 0.0001, "scripts": {}, "customMarkingAlgorithm": "", "type": "jme", "vsetRange": [1, 1.5], "showFeedbackIcon": true, "variableReplacements": [], "unitTests": [], "failureRate": 1, "showCorrectAnswer": true, "useCustomName": false, "checkVariableNames": false, "variableReplacementStrategy": "originalfirst", "valuegenerators": [{"name": "x", "value": ""}], "showPreview": true, "extendBaseMarkingAlgorithm": true}, {"vsetRangePoints": 5, "customName": "", "answerSimplification": "std", "answer": "(({m} * Exp(({m} * x))) + {b})", "checkingType": "absdiff", "marks": 1, "checkingAccuracy": 0.001, "scripts": {}, "customMarkingAlgorithm": "", "type": "jme", "vsetRange": [0, 1], "showFeedbackIcon": true, "variableReplacements": [], "unitTests": [], "failureRate": 1, "showCorrectAnswer": true, "useCustomName": false, "checkVariableNames": false, "variableReplacementStrategy": "originalfirst", "valuegenerators": [{"name": "x", "value": ""}], "showPreview": true, "extendBaseMarkingAlgorithm": true}], "unitTests": [], "variableReplacements": [], "customName": "", "showCorrectAnswer": true, "stepsPenalty": 0, "sortAnswers": false, "prompt": "\nThis equation has a root in the range $0 \\lt x \\lt 1$.
\nUsing the Newton-Raphson formula, if $x_n$ is the $n$th estimate for this root, show that the next estimate can be written in the form \\[x_{n+1}= \\frac{p(x_n)}{g'(x_n)}\\]
Enter $p(x_n)$ and $g'(x_n)$ in the boxes below.
Please note that if you enter a function of the form $xe^{ax}$, then you must input it as $x*e^{ax}$.
\n$p(x_n)=\\;\\;$[[0]] In your answer use $x$ instead of $x_n$.
\n$g'(x_n)=\\;\\;$[[1]] In your answer use $x$ instead of $x_n$.
\nIf you have forgotten the Newton-Raphson formula you can click on Steps to see it. You will not lose any marks in doing so.
\n ", "steps": [{"vsetRangePoints": 5, "customName": "", "valuegenerators": [], "answer": "", "failureRate": 1, "checkVariableNames": false, "marks": 0, "checkingAccuracy": 0.001, "scripts": {}, "customMarkingAlgorithm": "", "type": "jme", "vsetRange": [0, 1], "showFeedbackIcon": true, "variableReplacements": [], "unitTests": [], "showCorrectAnswer": true, "useCustomName": false, "showPreview": true, "checkingType": "absdiff", "variableReplacementStrategy": "originalfirst", "prompt": "Recall that the Newton-Raphson method is defined by:
\\[x_{n+1}=x_n-\\frac{g(x_n)}{g'(x_n)}\\]
where we would like to find the root of the equation $g(x)=0$
If $x_0=2\\;\\;\\;$what is $x_1$ correct to $4$ decimal places?
\n$x_1=\\;\\;$ [[0]]
\nEnter your answer to 4 decimal places.
", "marks": 0, "customMarkingAlgorithm": "", "variableReplacementStrategy": "originalfirst", "useCustomName": false, "type": "gapfill", "extendBaseMarkingAlgorithm": true}], "name": "Keith's copy of Maria's copy of Mario's copy of Interactive Newton-Raphson method", "variablesTest": {"condition": "", "maxRuns": 100}, "ungrouped_variables": ["a", "maxy", "ans1", "m", "results", "b", "tol", "ans", "tans"], "rulesets": {"std": ["all", "!collectNumbers", "!noLeadingMinus"]}, "tags": [], "preamble": {"js": "", "css": ""}, "extensions": ["jsxgraph"], "advice": "a)
\nRecall that the Newton-Raphson method is defined by:
\\[x_{n+1}=x_n-\\frac{g(x_n)}{g'(x_n)}\\]
where we would like to find the root of the equation $g(x)=0$
In this question we have:
\\[\\simplify[std]{g(x) = Exp({m} * x) + {b} * x + { -a}} \\Rightarrow \\simplify[std]{g'(x) = {m}*Exp({m} * x) + {b}}\\]
Substituting these expressions into the formula we have:
\\[x_{n+1} =\\simplify[std]{ x_n -((Exp({m} * x_n) + {b} * x_n + { -a}) / ({m} * Exp({m} * x_n) + {b}))}\\]
which can be rearranged to give:
\\[x_{n + 1} = \\simplify[std]{(({m} * x_n -1) * Exp({m} * x_n) + {a}) / ({m} * Exp({m} * x_n) + {b})}\\]
(In your answers you would input $x$ rather than $x_n$.)
\nIn the following let $\\displaystyle f(x)=\\simplify[std]{ (({m} * x -1) * Exp({m} * x ) + {a}) / ({m} * Exp({m} * x ) + {b})}$
\nb)
\nIf $x_0=2$ then $x_1$ is simply given by:
\\[\\simplify[std]{x_1 = (({2*m} -1) * Exp({2*m}) + {a}) / ({m} * Exp({2*m}) + {b})}\\]
which to 4 decimal places is: $\\;\\;x_1= \\var{ans}$
\nWe find on running the iteration that the first six values are:
\n\\[\\begin{align}x_1&=f(x_0)=f(2)&=\\var{results[1]}\\\\x_2&=f(x_1)=f(\\var{results[1]})&=\\var{results[2]}\\\\x_3&=f(x_2)=f(\\var{results[2]})&=\\var{results[3]}\\\\x_4&=f(x_3)=f(\\var{results[3]})&=\\var{results[4]}\\\\x_5&=f(x_4)=f(\\var{results[4]})&=\\var{results[5]}\\\\x_6&=f(x_5)=f(\\var{results[5]})&=\\var{results[6]}\\end{align}\\]
\nSo the solution to the equation to four decimal places for $0 \\le x \\le 1$ is $x=\\var{precround(ans1,4)}$
\nHere we see the graph of $\\simplify{e^({m}*x)+{b}*x-{a}}$ and the first four successive approximations to the root:
\n{test(m,b,a,maxy)}
\n\nNote that you can slide the first approximation $x_0$ along the x-axis to see the effect of changing the starting value.
", "metadata": {"licence": "Creative Commons Attribution 4.0 International", "description": "Write down the Newton-Raphson formula for finding a numerical solution to the equation $e^{mx}+bx-a=0$. If $x_0=1$ find $x_1$.
\nIncluded in the Advice of this question are:
\n6 iterations of the method.
\nGraph of the NR process using jsxgraph. Also user interaction allowing change of starting value and its effect on the process.
"}, "type": "question", "contributors": [{"name": "Bill Foster", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/6/"}, {"name": "Mario Stevanovski", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2979/"}, {"name": "Maria Aneiros", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3388/"}, {"name": "Keith Tarnowski", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3425/"}]}]}], "contributors": [{"name": "Bill Foster", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/6/"}, {"name": "Mario Stevanovski", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2979/"}, {"name": "Maria Aneiros", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3388/"}, {"name": "Keith Tarnowski", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/3425/"}]}