search
Log In
0 votes
Solve the equation $x=10\cos(x)$ using the Newton-Raphson method. The initial guess is $x=\pi /4$. The value of the predicted root after the first iteration, up to second decimal, is ________
in Numerical Methods 24.6k points
recategorized by

Please log in or register to answer this question.

Answer:

Related questions

0 votes
0 answers
The root of the function $f(x) = x^3+x-1$ obtained after first iteration on application of Newton-Raphson scheme using an initial guess of $x_0=1$ is $0.682$ $0.686$ $0.750$ $1.000$
asked Feb 24, 2017 in Numerical Methods Arjun 24.6k points
0 votes
0 answers
Gauss-Seidel method is used to solve the following equations (as per the given order): $x_1+2x_2+3x_3=5$ $2x_1+3x_2+x_3=1$ $3x_1+2x_2+x_3=3$ Assuming initial guess as $x_1=x_2=x_3=0$ , the value of $x_3$ after the first iteration is __________
asked Feb 24, 2017 in Numerical Methods Arjun 24.6k points
0 votes
0 answers
Find the positive real root of $x^3-x-3=0$ using Newton-Raphson method. lf the starting guess $(x_{0})$ is $2,$ the numerical value of the root after two iterations $(x_{2})$ is ______ ($\textit{round off to two decimal places}$).
asked Mar 1 in Numerical Methods jothee 4.9k points
0 votes
0 answers
Newton-Raphson method is used to find the roots of the equation, $x^3+3x^2+3x-1=0$. If the initial guess is $x_0=1$, then the value of $x$ after $2^{nd}$ iteration is ________
asked Feb 24, 2017 in Numerical Methods Arjun 24.6k points
0 votes
0 answers
Maximize $Z = 15X_1 + 20X_2$ subject to $\begin{array}{l} 12X_1 + 4X_2 \geq 36 \\ 12X_1 − 6X_2 \leq 24 \\ X_1, X_2 \geq 0 \end{array}$ The above linear programming problem has infeasible solution unbounded solution alternative optimum solutions degenerate solution
asked Feb 24, 2017 in Numerical Methods Arjun 24.6k points
...