// Numbas version: exam_results_page_options {"name": "Mario's copy of Interactive Newton-Raphson method", "extensions": ["jsxgraph"], "custom_part_types": [], "resources": [], "navigation": {"allowregen": true, "preventleave": false, "showfrontpage": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"parts": [{"showCorrectAnswer": true, "stepsPenalty": 0, "type": "gapfill", "marks": 0, "prompt": "\n

This equation has a root in the range $0 \\lt x \\lt 1$.

\n

Using 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.

\n

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)=\\;\\;$[] In your answer use $x$ instead of $x_n$.

\n

$g'(x_n)=\\;\\;$[] In your answer use $x$ instead of $x_n$.

\n

If 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 ", "variableReplacementStrategy": "originalfirst", "gaps": [{"answer": "(((({m} * x) -1) * Exp(({m} * x))) + {a})", "variableReplacementStrategy": "originalfirst", "expectedvariablenames": [], "checkingaccuracy": 0.0001, "showFeedbackIcon": true, "checkvariablenames": false, "answersimplification": "std", "type": "jme", "marks": 1, "vsetrangepoints": 5, "scripts": {}, "checkingtype": "absdiff", "showCorrectAnswer": true, "vsetrange": [1, 1.5], "showpreview": true, "variableReplacements": []}, {"answer": "(({m} * Exp(({m} * x))) + {b})", "variableReplacementStrategy": "originalfirst", "expectedvariablenames": [], "checkingaccuracy": 0.001, "showFeedbackIcon": true, "checkvariablenames": false, "answersimplification": "std", "type": "jme", "marks": 1, "vsetrangepoints": 5, "scripts": {}, "checkingtype": "absdiff", "showCorrectAnswer": true, "vsetrange": [0, 1], "showpreview": true, "variableReplacements": []}], "scripts": {}, "showFeedbackIcon": true, "steps": [{"answer": "", "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$

", "variableReplacementStrategy": "originalfirst", "expectedvariablenames": [], "checkingaccuracy": 0.001, "showFeedbackIcon": true, "checkvariablenames": false, "type": "jme", "marks": 0, "vsetrangepoints": 5, "scripts": {}, "checkingtype": "absdiff", "showCorrectAnswer": true, "vsetrange": [0, 1], "showpreview": true, "variableReplacements": []}], "variableReplacements": []}, {"showCorrectAnswer": true, "type": "gapfill", "marks": 0, "prompt": "

If $x_0=2\\;\\;\\;$what is $x_1$ correct to $4$ decimal places?

\n

$x_1=\\;\\;$ []

\n

Enter your answer to 4 decimal places.

", "variableReplacementStrategy": "originalfirst", "gaps": [{"variableReplacementStrategy": "originalfirst", "showFeedbackIcon": true, "minValue": "ans-tol", "showCorrectAnswer": true, "notationStyles": ["plain", "en", "si-en"], "type": "numberentry", "marks": 1, "allowFractions": false, "scripts": {}, "maxValue": "ans+tol", "correctAnswerFraction": false, "correctAnswerStyle": "plain", "variableReplacements": []}], "scripts": {}, "showFeedbackIcon": true, "variableReplacements": []}], "name": "Mario's copy of Interactive Newton-Raphson method", "metadata": {"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$.

\n

Included in the Advice of this question are:

\n

6 iterations of the method.

\n

Graph of the NR process using jsxgraph. Also user interaction allowing change of starting value and its effect on the process.

", "licence": "Creative Commons Attribution 4.0 International"}, "variable_groups": [], "extensions": ["jsxgraph"], "variablesTest": {"condition": "", "maxRuns": 100}, "rulesets": {"std": ["all", "!collectNumbers", "!noLeadingMinus"]}, "statement": "

Consider the following equation.

\n

\$\\simplify[std]{e^({m}x)+{b}x-{a}=0}\$

\n

Find the approximate solution in the range $0 \\le x \\le 1$ by using the Newton-Raphson method.

\n

The 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

", "tags": ["exponential functions", "iterative method", "jsxgraph", "Jsxgraph", "JSXgraph", "Newton-Raphson method", "newton-raphson method", "numerical methods", "numerical solution", "Solving equations", "solving equations", "Steps", "steps"], "contributors": [{"profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/6/", "name": "Bill Foster"}, {"profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2979/", "name": "Mario Stevanovski"}], "functions": {"funfornr": {"language": "javascript", "type": "html", "parameters": [], "definition": "var div = Numbas.extensions.jsxgraph.makeBoard('600px','200px',{boundingBox:[0,10,1,-8],grid:false});\n var board = div.board;\n var m = Numbas.jme.unwrapValue(scope.variables.m);\n var be = Numbas.jme.unwrapValue(scope.variables.b);\n var al = Numbas.jme.unwrapValue(scope.variables.a);\n var ans = Numbas.jme.unwrapValue(scope.variables.ans1)\n var a = board.create('point',[ans,0],'$A$');\n \n var graph = board.create('functiongraph',function(x){return Math.exp(m*x)+be*x-al});\n \n return div;\n "}, "fun": {"language": "jme", "type": "number", "parameters": [["m", "number"], ["b", "number"], ["a", "number"], ["c", "number"]], "definition": "((m*c-1)*e^(m*c)+a)/(m*e^(m*c)+b)"}, "test": {"language": "javascript", "type": "html", "parameters": [["m", "number"], ["b", "number"], ["a", "number"], ["maxy", "number"]], "definition": "var div = Numbas.extensions.jsxgraph.makeBoard('600px','400px', {boundingbox:[0,maxy,3,-30], axis:false});\n var brd=div.board;\n // Initial function term\n var term = function(x) { return Math.exp(m*x)+b*x-a; };\n var graph = function(x) { return term(x); };\n // Recursion depth\n var steps = 4;\n // Start value\n var s = 2;\n \n //for (i = 0; i < steps; i++) {\n //document.write('x' + i + ' = ');\n //}\n \n var i;\n var ax = brd.create('axis', [[0,0], [1,0]], {strokeColor: 'black'});\n var ay = brd.create('axis', [[0,0], [0,1]], {strokeColor: 'black'});\n \n var g = brd.create('functiongraph', [function(x){return graph(x);}],{strokeWidth: 2, dash:0});\n var x = brd.create('glider',[s,0,ax], {name: 'x_{0}', strokeColor: 'magenta', fillColor: 'yellow'});\n \n newton(x, steps, brd);\t\n \n //function xval() {\n //for (i = 0; i < steps; i++)\n //document.getElementById('xv' + i).innerHTML = (brd.select('x_{' + i + '}').X()).toFixed(14);\n //}\n \n //brd.addHook(xval);\n \n function newton(p, i, board) {\t\n board.suspendUpdate();\t\n if(i>0) {\n var f = board.create('glider',[function(){return p.X();}, function(){return graph(p.X())},g], {name: '', style: 3, strokeColor: 'green', fillColor: 'yellow'});\n var l = board.create('line', [p,f],{strokeWidth: 0.5, dash: 1, straightFirst: false, straightLast: false, strokeColor: 'black'});\n var t = board.create('tangent',[f],{strokeWidth: 0.5, strokeColor: '#0080c0', dash: 0});\n var x = board.create('intersection',[ax,t,0],{name: 'x_{'+(steps-i+1) + '}', style: 4, strokeColor: 'magenta', fillColor: 'yellow'});\n newton(x,--i, board);\n }\n board.unsuspendUpdate(); \n \n \n }\t\n return div;"}, "nr": {"language": "jme", "type": "list", "parameters": [["m", "number"], ["b", "number"], ["a", "number"], ["c", "number"], ["n", "number"], ["l", "list"]], "definition": "if(n=5,l+[fun(m,b,a,c)]+[fun(m,b,a,fun(m,b,a,c))],nr(m,b,a,fun(m,b,a,c),n-1,l+[c]))"}}, "preamble": {"css": "", "js": ""}, "advice": "

a)

\n

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$

\n

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}))}\$

\n

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})}\$

\n

(In your answers you would input $x$ rather than $x_n$.)

\n

In the following let $\\displaystyle f(x)=\\simplify[std]{ (({m} * x -1) * Exp({m} * x ) + {a}) / ({m} * Exp({m} * x ) + {b})}$

\n

b)

\n

If $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})}\$

\n

which to 4 decimal places is: $\\;\\;x_1= \\var{ans}$

\n

We find on running the iteration that the first six values are:

\n

\\\begin{align}x_1&=f(x_0)=f(2)&=\\var{results}\\\\x_2&=f(x_1)=f(\\var{results})&=\\var{results}\\\\x_3&=f(x_2)=f(\\var{results})&=\\var{results}\\\\x_4&=f(x_3)=f(\\var{results})&=\\var{results}\\\\x_5&=f(x_4)=f(\\var{results})&=\\var{results}\\\\x_6&=f(x_5)=f(\\var{results})&=\\var{results}\\end{align}\

\n

So the solution to the equation to four decimal places for $0 \\le x \\le 1$ is $x=\\var{precround(ans1,4)}$

\n

Here 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

\n

Note that you can slide the first approximation $x_0$ along the x-axis to see the effect of changing the starting value.

", "type": "question", "ungrouped_variables": ["a", "maxy", "ans1", "m", "results", "b", "tol", "ans", "tans"], "variables": {"ans": {"templateType": "anything", "description": "", "name": "ans", "group": "Ungrouped variables", "definition": "precround(tans,4)"}, "ans1": {"templateType": "anything", "description": "", "name": "ans1", "group": "Ungrouped variables", "definition": "precround(results,4)"}, "tol": {"templateType": "anything", "description": "", "name": "tol", "group": "Ungrouped variables", "definition": "0"}, "results": {"templateType": "anything", "description": "", "name": "results", "group": "Ungrouped variables", "definition": "nr(m,b,a,2,10,[])"}, "m": {"templateType": "anything", "description": "", "name": "m", "group": "Ungrouped variables", "definition": "random(1.5..2#0.1)"}, "maxy": {"templateType": "anything", "description": "", "name": "maxy", "group": "Ungrouped variables", "definition": "ceil(e^(2*m)+2*b-a)+5"}, "tans": {"templateType": "anything", "description": "", "name": "tans", "group": "Ungrouped variables", "definition": "((2*m-1)*exp(2*m)+a)/(m*exp(2*m)+b)"}, "b": {"templateType": "anything", "description": "", "name": "b", "group": "Ungrouped variables", "definition": "random((a+1)..9)"}, "a": {"templateType": "anything", "description": "", "name": "a", "group": "Ungrouped variables", "definition": "random(8..15)"}}}]}], "contributors": [{"profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/6/", "name": "Bill Foster"}, {"profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/2979/", "name": "Mario Stevanovski"}]}