cards":[{"id":"472914a1-9749-49af-a5a8-bbea57fad2e5","cardType":"basic","front":"What condition must a root of $f(x)=0$ satisfy?","back":"Substitution gives $f(x)=0$.","points":1,"mcqOptions":null},{"id":"e3e82e59-b77b-4b81-874a-6c9e49c652b4","cardType":"basic","front":"How is the next fixed-point iterate calculated from $x_n$?","back":"Apply $g$: $x_{n+1}=g(x_n)$.","points":1,"mcqOptions":null},{"id":"c6f7d817-0c9c-4d97-94d8-52145b2abff2","cardType":"basic","front":"Why must the limit of a convergent fixed-point iteration satisfy $\u001falpha=g(\\alpha)$?","back":"At the limit, consecutive iterates become equal.","points":2,"mcqOptions":null},{"id":"1b1dad42-7cd5-4653-acd7-9f209e1411d9","cardType":"basic","front":"Which two graphs are required for a fixed-point iteration diagram?","back":"

$y=g(x)$
$y=x$

","points":1,"mcqOptions":null},{"id":"d98b6be7-70c0-453f-b174-59a5b5f2540a","cardType":"basic","front":"Why is an intersection of $y=g(x)$ and $y=x$ a fixed point?","back":"At an intersection, $g(x)=x$.","points":2,"mcqOptions":null},{"id":"01948df6-7cb3-4692-b01f-2afb920366a1","cardType":"basic","front":"What does the line $y=x$ do in an iteration diagram?","back":"It transfers $g(x_n)$ into the next input $x_{n+1}$.","points":2,"mcqOptions":null},{"id":"3d5fea52-bf5c-45fd-b018-ba1dc2223e95","cardType":"basic","front":"What path indicates convergence on a cobweb or staircase diagram?","back":"The steps move towards an intersection of the graphs.","points":1,"mcqOptions":null},{"id":"f6ae36d5-4969-417e-bb73-4aeb18ea8420","cardType":"basic","front":"How do staircase and cobweb convergence differ?","back":"

Staircase: approaches from one side
Cobweb: alternates across the fixed point

","points":3,"mcqOptions":null},{"id":"1557c98d-c117-408c-98dc-5107cb9f1f6a","cardType":"basic","front":"What convergence pattern is suggested by $0Staircase-like convergence.","points":1,"mcqOptions":null},{"id":"6af43aa3-c570-4c96-955d-9ed93c0b497b","cardType":"basic","front":"What convergence pattern is suggested by $-1Alternating cobweb convergence.","points":1,"mcqOptions":null},{"id":"cede9f4f-3b29-4119-bfca-e9274a3c740a","cardType":"basic","front":"Why can the derivative test fail to predict behaviour from a distant starting value?","back":"It is a local test near the fixed point.","points":2,"mcqOptions":null},{"id":"4b3dc664-a888-426f-995e-d8ce430a204d","cardType":"basic","front":"Which derivative is used to test convergence of $x_{n+1}=g(x_n)$?","back":"Evaluate $g'(\\alpha)$, not $f'(\\alpha)$.","points":1,"mcqOptions":null},{"id":"0a5789a5-1eff-4b08-a565-d783d82ec441","cardType":"basic","front":"What geometric construction produces $x_{n+1}$ in Newton-Raphson?","back":"The $x$-intercept of the tangent at $(x_n,f(x_n))$.","points":2,"mcqOptions":null},{"id":"ecf255ae-e9ba-4cc1-98d6-1a2dcff01e92","cardType":"basic","front":"Why does Newton-Raphson fail when $f'(x_n)=0$?","back":"The formula requires division by zero.","points":2,"mcqOptions":null},{"id":"c1a4f84c-9bbc-4fc1-83f3-89c902327bf1","cardType":"basic","front":"What happens when $f'(x_n)$ is very close to zero?","back":"Newton-Raphson may make a very large jump.","points":2,"mcqOptions":null},{"id":"779ea472-107e-4c18-b436-9dd1fbe9838b","cardType":"basic","front":"How can an iterate cause an invalid calculation?","back":"It can leave the domain of $g$.","points":2,"mcqOptions":null},{"id":"6b1533bb-232e-4044-a44a-f1e4aaf44de1","cardType":"basic","front":"Why can different starting values converge to different roots?","back":"Each starting value may lie in a different region of attraction.","points":2,"mcqOptions":null},{"id":"fe21456e-3512-49a2-bcd7-f076245b2

1.12.2 Iterative methods and Newton-Raphson (A-level only) Flashcards

1.12.2 Iterative methods and Newton-Raphson (A-level only) Flashcards