WorksheetsMidterm_Numerical Methods
Total questions: 36
Worksheet time: 21mins
f(x)=x3+2x, [−1,1]
1/√3
±1/√3
-1/√3
The MVT doesn't apply
Find the root for the equation 3x+cosx=3 between x=0 and x=1 correct to four decimal places.
0.5
0.7579
0.758
0.7469
Figure shows the equation 2x3=2−x2 . Find the root of the equation 2x3+x2−2=0 in [−2,2] .
0
1.414
-1.414
0.858
Find how many intersection are there between y=2x and y=lnx ?
1
0
2
Find the interval where the root of the equation x3=−x−1 lies.
[0,0.5]
[−1,−0.5]
[−0.5,0]
[0.5,1]
Given that the equation 2x3−4x2−1=0 has a root in the interval [2, 3]. Using Newton-Raphson method, the root correct to 2 decimal places is
2.13
2.11
2.09
2.15
By using graphical method, there is a real root between [a,b] for ln(x−2)+x2−4=0 Hence, state the values of a and b.
a=1, b=4
a=2, b=3
a=0, b=2
a=0, b=4
By taking 0.2 as the first approximation, evaluate the real root of the equation x2−x1+4=0 correct to 3 s.f.
0.246
0.635
0.153
0.724
Show that the equation 2x3+x2=33 has a root in the interval 2<x<2.5 .
Find this root correct to 3 s.f.
2.17
2.45
2.39
2.28
By taking x=2 as the first approximation, calculate using Newton-Raphson method, the third approximation to 731 (3 s.f.)
1.91
1.92
1.89
1.90
Estimate ∫081+x2dx by using trapezoidal rule with 5 ordinates correct to 3 d.p. What is this value?
33.946; approximated value
33.946; absolute value
32.246; approximated value
32.246; absolute value
By taking 0.2 as the first approximation, evaluate the real root of the equation x2−x1+4=0 correct to 3 s.f.
0.246
0.635
0.153
0.724
Show that the equation 2x3+x2=33 has a root in the interval 2<x<2.5 .
Find this root correct to 3 s.f.
2.17
2.45
2.39
2.28
By taking x=2 as the first approximation, calculate using Newton-Raphson method, the third approximation to 731 (3 s.f.)
1.91
1.92
1.89
1.90
The convergence of which of the following method is sensitive to starting value?
False position
Gauss seidal method
Newton-Raphson method
All of these
Newton-Raphson method is used to find the root of the equation x2 - 2 = 0
If iterations are started from - 1, then iterations will be
converge to -1
converge to √2
converge to -√2
No converge
Which of the following statements applies to the bisection method used for finding roots of functions?
Converges within a few iterations
Guaranteed to work for all continuous functions
Is faster than the Newton-Raphson method
Requires that there be no error in determining the sign of the function
We wish to solve x2 - 2 = 0 by Newton Raphson technique. If initial guess is x0 = 1.0, subsequent estimate of x (i.e. x1) will be
1.414
1.5
2.0
None of these
In the Gauss elimination method for solving a system of linear algebraic equations, triangularzation leads to
Diagonal matrix
Lower triangular matrix
Upper triangular matrix
Singular matrix
Using Bisection method, negative root of x3 - 4x + 9 = 0 correct to three decimal places is
-2.506
-2.706
- 2.406
None of these
The root of x3 - 2x - 5 = 0 correct to three decimal places by using Newton-Raphson method is
2.0946
1.0404
1.7321
0.7011
The equation f(x) is given as x2-4=0. Considering the initial approximation at x=6 then the value of x1 is given as
10/3
4/3
7/3
13/3
How many roots are there in the equation
x=5x4+2 ?1
2
3
4
Find the root for the equation 3x+cosx=3 between x=0 and x=1 correct to four decimal places.
0.5
0.7579
0.758
0.7469
Find the interval where the root of the equation x3=−x−1 lies.
[0,0.5]
[−1,−0.5]
[−0.5,0]
[0.5,1]
This is an example of a
System of Quadratic Equations
Reduced Row Echelon Form
Augmented Matrix
A Canine Doing a Backflip
What is an appropriate first row command to solve this by Gaussian Elimination?
2R2 + R2 -> R2
-2R1 + R2 -> R2
R3 +R2 --> R3
2R1 + R2 --> R2
Regula Falsi method is also known as ------
Interval halving method
Bolzano's method
Method of False Position
Newton method
The iteration formula for Newton-Raphson method is
xn+1=xn+f′(xn)f(xn)
xn+1=xn−f′(xn)f(xn)
xn+1=xn−f(xn)f′(xn)
xn+1=xn+f(xn)f′(xn)
What line is used to find the next iteration in Newton-Raphson method?
Secant
Normal
Chord
Tangent
It is a branch of applied mathematics, which studies the methods and algorithms to find approximate solutions of equations when exact solutions cannot be determined via algebraic methods.
Numerical Methods
Physics
Chemistry
Engineering Economics
These are concerned with the value of a variable or a parameter that satisfies a single non-linear equation and are especially valuable in engineering design contexts where it is open impossible to explicitly solve design equations for parameters.
Systems of Linear Algebraic Equations
Ordinary Differential Equations
Roots of Equations
Integration
It refers to how closely individual computer or measured values agree with each other.
Precision
Accuracy
Truncation
Round-off
It refers to how closely a computed or measured value agrees with the true value of the parameter being measured.
Precision
Accuracy
Truncation
Round-off
These errors happened when number having limited significant figures are used to represent exact numbers.
Concatenation Errors results
Truncation Errors results
Round-off Errors results
Relative True Errors results
These happened when approximations are used to represent exact mathematical procedures.
Truncation Errors results
Round-off Errors results
Relative Errors results
Concatenation Errors results
