MATH-6330 - Numerical Methods oed answer key

Showing 121 to 140 of 256 total answers.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Interpreting the results graphically is one advantages of using software systems in numerical methods.

Answer

True

#MATH-6330
Awesome StudentQuestion • Numerical Methods

This is an informal and human readable description of an algorithm leaving many granular details of it

Answer

Pseudocode

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Which of the following is the best application of approximating an integral of a function numerically?

Answer

a function whose anti derivative cannot be found

#MATH-6330
Awesome StudentQuestion • Numerical Methods

If A−1 (if it exists) the eigenvalues of A−1 is 1/5, 1/4 and 1/2 if matrix A has eigenvalues 5, 4 and 2

Answer

True

#MATH-6330
Awesome StudentQuestion • Numerical Methods

If the determinant of the matrix is zero, it is impossible to check the solutions of the variables using

Answer

Cramer's Rule

#MATH-6330
Awesome StudentQuestion • Numerical Methods

If x2 is the approximated root in Secant method, it follows that; the value of f(x2) must be equal to 0.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

In matrix multiplication, a matrix of n x k by k x m size the resulting matrix would have a dimension of

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Newton’s method is based on a truncated version of the Taylor series keeping only the first order terms.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Numerical integrations such as Trapezoidal and Simpson's 1/3 rule should have intervals that are uniform

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Roots of transcendental functions are easily approximated using Newton’s method provided that f’(x) ≠ 0.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

For a two segment trapezoidal rule, it will use the points similar to the ones used by Simpson's 1/3 rule

#MATH-6330
Awesome StudentQuestion • Numerical Methods

If matrix A is invertible such that A−1 = L−TL−1 then matrix A can be decomposed using Cholesky’s method.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

It is a feature which is essential to a system design especially when dealing with changes in computation

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Which among the given set of values provides the least approximation error in employing trapezoidal rule?

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Power method is an iterative approach that can be employed to determine the largest or dominant eigenvalue

#MATH-6330
Awesome StudentQuestion • Numerical Methods

Secant method is nearly as fast as the Newton-Raphson method and ensures convergence rather than the latter.

#MATH-6330
Awesome StudentQuestion • Numerical Methods

The Lagrange interpolating polynomial is thepolynomial P(x)of degree ________ that passes through thenpoints

#MATH-6330
Awesome StudentQuestion • Numerical Methods

For the function f(x) =its first derivative is f’(x) is The first derivative of the function is f’(x) =

#MATH-6330
Awesome StudentQuestion • Numerical Methods

From the two data points(2,5) and (6, 11), using Lagrange polynomial method, the polynomial is Li(x) = 15x +2

Page 7 of 13

1...56789...13