Search results for numerical-methods

0 votes
0 answers
1
Solve the following system using Gauss seidal iterative method with initial guess (0, 0, 0) and tolerance 0.001.$\left\{\begin{matrix} 2x_{1}-3x_{2}+x_{3} = 5\\ x_{1}+4x_...
0 votes
0 answers
2
0 votes
0 answers
3
0 votes
0 answers
4
0 votes
0 answers
5
Use Bisection method to find the root of the following equation with tolerance 0.001.$x^4 - 2x^3 - 4x^2 + 4x + 4 = 0$$x^3 – e^x + sin(x) = 0$
0 votes
0 answers
6
One root of $x^{3} – x – 4 = 0$ lies in $(1, 2).$ In bisection method, after first iteration the root lies in the interval ___________ .$(1, 1.5)$$(1.5, 2)$$(1.25, 1....
0 votes
1 answer
7
In which of the following methods proper choice of initial value is very important?Bisection methodFalse positionNewton-RaphsonBairsto method
1 votes
1 answer
8
The simplex method is so named because It is simple.It is based on the theory of algebraic complexes.The simple pendulum works on this method.No one thought of a better n...
8 votes
3 answers
9
The following definite integral evaluates to$$\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$$$\frac{1}{2}$$\pi \sqrt{10}$$\sqrt{10}$$\pi$
0 votes
2 answers
10
Using bisection method, one root of $x^4-x-1$ lies between $1$ and $2$. After second iteration the root may lie in interval:$(1.25,1.5)$$(1,1.25)$$(1,1.5)$None of the opt...
1 votes
3 answers
12
The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule...
1 votes
0 answers
13
Choose the most appropriate option.The Newton-Raphson iteration $x_{n+1}=\dfrac{x_{n}}{2}+\dfrac{3}{2x_{n}}$ can be used to solve the equation$x^{2}=3$$x^{3}=3$$x^{2}=2$$...
0 votes
3 answers
14
Match the following items(i) Newton-Raphson(a) Integration(ii) Runge-Kutta(b) Root finding(iii) Gauss-Seidel(c) Ordinary Differential Equations(iv) Simpson's Rule(d) Solu...
5 votes
2 answers
15
2 votes
1 answer
16
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
8 votes
1 answer
18
A root $\alpha$ of equation $f(x)=0$ can be computed to any degree of accuracy if a 'good' initial approximation $x_0$ is chosen for which$f(x_0) 0$$f (x_0) f''(x_0) 0$...