GATE CE 2022 Set 1 — Question 29

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+1 / -0EasyNewton-Raphson MethodNumerical Solution of EquationsEngineering Mathematics

Engineering Mathematics → Numerical Solution of Equations → Newton-Raphson Method

Last updated

Question

Consider the following recursive iteration scheme for different values of variable PP with the initial guess x1=1x_1 = \mathbf{1}:xn+1=12(xn+Pxn),n=1,2,3,4,5x_{n+1} = \frac{1}{2} \left( x_n + \frac{P}{x_n} \right), n = 1, 2, 3, 4, 5For P=2,x5P = \mathbf{2}, x_5 is obtained to be 1.414, rounded-off to three decimal places. For P=3,x5P = \mathbf{3}, x_5 is obtained to be 1.732, rounded-off to three decimal places.
If P=10P = \mathbf{10}, the numerical value of x5x_5 is _________ . (round off to three decimal places)
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CE question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Numerical Solution of Equations