MATH-6330 - Numerical Methods oed answer key

Showing 241 to 256 of 256 total answers.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

The secant method is almost similar to the concept of False-position in the bracketing methods as it uses two initial approximations however secant doesn’t bother with the bracketing.

Answer

True

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Sequential algorithm is an algorithm which can be executed a piece at a time on many different processing devices, and then combined together again at the end to get the correct result

Answer

False

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Newton's Method is ideal to function which isDifferentiable also known as a "smooth" functionTranscendental or that which cannot be expressed in finite number of termsContaining multiple roots

Answer

Both of "Differentiable also known as a =E2=80=9Csmooth=E2=80=9D function" and "Transcendental or that which cannot be expressed in finite number of terms" are correct

#MATH-6330
Awesome StudentQuestion • Numerical Methods

While using two sets of points (x0,y0) and (x1,y1) a straight line is formed and could use the slope equation which follows that the first derivative can be approximated using the given values

Answer

True

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Newton’s Method is ideal to function which is Differentiable also known as a “smooth” function Transcendental or that which cannot be expressed in finite number of terms. Containing multiple roots

Answer

All of the answers correct

#MATH-6330
Awesome StudentQuestion • Numerical Methods

When it comes to computer implementation, secant method may have disadvantage over the Newton-Raphson since Secant method depends on the previous approximation making it slower than the Newton Raphson

#MATH-6330
Awesome StudentQuestion • Numerical Methods

It is an iterative approach that can be employed to determine the largest or dominant eigenvalue It has the additional benefit that the corresponding eigenvector is obtained as a by-product of the method

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Using Newton's interpolation, with data given below to compute for f(15)x0 = 0 f(x0) = 2x1 = 3 f(x1) = 7x2 = 5 f(x2) = 9The first order from x0 = 0 to x1 = 3 has a value of 48 which is similar to Lagrange

#MATH-6330
Awesome StudentQuestion • Numerical Methods

In floating point addition, where the exponent of the smaller number must match that of the larger number making 3.141516 x 101 and 2.125 x 102 expressed in 3 digit precision as 0.314 x 102 and 2.13 x 102

#MATH-6330
Awesome StudentQuestion • Numerical Methods

The goal in using Newton’s method is the When choosing an initial value, a good guess is : A value which when substituted to the function will give a near zero value A value with f ’(x) ≠ 0 Always starting with 0

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Suppose a computing machine can only display up to 4 decimal places. Assuming that the true value of π is 3.14159265359. Using an approximate value of πa = 3.1416 Calculate the absolute error and the relative error.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

The goal in using Newton's method is the When choosing an initial value, a good guess is :A value which when substituted to the function will give a near zero valueA value with f '(x) =E2=89=A0 0Always starting with 0

#MATH-6330
Awesome StudentQuestion • Numerical Methods

The absolute error of the function f(x) = e x when the the true value of f(x) = 2.718281828 compared to the approximated value of using the first five terms of the Maclaurin Series center at when x = 1, c =0 is _____.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

A square matrix is said to be diagonally dominant if for every row of the matrix, the magnitude of the diagonal entry in a row is less than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

There exists a minimization problem such that (i) assuming P = NP, there is no polynomial-time 1-approximation algorithm for the problem; and (ii) for any constant =C7=AB > 0, there is a polynomial-time (1 + =C7=AB)-approximation algorithm for the problem

#MATH-6330
Awesome StudentQuestion • Numerical Methods

If there is a randomized algorithm that solves a decision problem in time t and outputs the correct answer with probability 05, then there is a randomized algorithm for the problem that runs in time =CE=98(t) and outputs the correct answer with probability at least 099

Page 13 of 13