If matrix is A is positive definite then a11 

> 0. 
= True
Methods that uses a single initial value or two initial values that do not
necessarily brackets the root where Newton’s method is categorized are
called
= Open method
Newton’s Method is ideal to function which is 
1. Differentiable also known as a “smooth” function
2. Transcendental or that which cannot be expressed in finite number of
terms.
3. Containing multiple roots
= Both of "Differentiable also known as a “smooth” function" and
"Transcendental or that which cannot be expressed in finite number of
terms." are correct 

For the given systems of linear equations, with initial

values x1 =0;  x2 =0; x3 = 0. The next iterative value of x2 using Gauss-
Seidel Method is 1.5. 
= False
Roots of transcendental functions are easily approximated using Newton’s
method provided that f’(x) ≠ 0.
= True

The Cholesky factorization for the sample matrix

given above is:

= True
A Hermitian matrix (or self-adjoint matrix) is a complex square matrix that is
equal to its own conjugate transpose and can be decomposed using
Cholesky’s method.
= True
Gauss-Jordan method consists of guessing a value and then using a
systematic method to obtain a refined estimate of the root.
= True
What is the next approximated root for the function f(x) = x + cos(x)
when x0 = 0?
= -1
= 0.7391
=1
Another condition that must be satisfied is that the diagonal elements are
all nonzero for the Gauss-Seidel method to be used:
= True
Newton’s method is powerful in giving multiple roots of any differentiable
function.
= False
Which of the following statements is true for the function f(x) = -e x + sin x,
when 0 is used as an initial value:
= Newton’s method cannot be used
The factorization in Cholesky’s Method can be generated efficiently by
recurrence relations.
= True
Newton’s method also known as the Newton-Raphson iteration is that,
suppose at point xi of the function, there is a tangent at that point. This
point is assumed to be:
= the root of the function
Each component of the new iterates in Gauss-Seidel method depends
upon all previously computed components, the updates cannot be done
simultaneously.
= True
Horner’s method which is a method for finding roots of a polynomial
equation f(x) =0 is almost similar to Newton’s method.
= True
Newton’s method is based on a truncated version of the Taylor series
keeping only the first order terms.
= True
One of the advantages of Newton’s method is that its converges fast even
if the initial guess was poorly chosen
= False
For the function  , its first derivative is f’(x) is
= False
LU decomposition can be viewed as the matrix form of Gaussian
elimination
= True
It is impossible to find the complex roots of a polynomial function, using
Newton’s Method” is:
= False

For the given systems of linear equations, with initial

values x1 =0;  x2 =0; x3 = 0. The next iterative value of x1 using Gauss-
Seidel Method is 1.3333.
= True
If the magnitude of the diagonals is greater than the sum of the non-
diagonals in the same row, then the matrix is not diagonally dominant.
= False
For the function  f(x) =its first derivative is  f’(x) is   The first derivative of
the function  is f’(x) =
= False
What is the next approximated root for the function f(x) = e x + sin(x)
when x0 = 0?
= 0.5
= -0.5
In employing Gauss-Seidel method, the most recent values should be used
to substitute with the formula of finding x1, x2 and x3, respectively. 
= True
The goal in using Newton’s method is the When choosing an initial
value, a good guess is :
1. A value which when substituted to the function will give a near zero
value
2. A value with f ’(x) ≠ 0
3. Always starting with 0
= "A value which when substituted to the function will give a near zero
value" and "A value with f ’(x) ≠ 0" are correct. 

The absolute value of the ratio of  is x0 = 0 is 8

= True
The tangent line is projected to approximate the root of the function where
it crosses the
= x axis
= y axis
= function at its lowest point
In the case of the tridiagonal system strict diagonal dominance means
simply that (with a0 = an = 0) 
= True
Cholesky’s Method is based on the fact that a symmetric matrix can be
decomposed into triangular factors are the transpose of each other.
= True
The iteration may terminate if the difference between approximated values
of x is already zero.
=True

The given matrix above is a symmetric matrix.

= True
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.
= False
Suppose we do not know that the true value of the root of f(x) = x 3 -1 is 1.
How many iterations will be used to get the true value suppose the initial
value of x = 0?
=2
Which of the following  is the best initial guess for the function
f(x) = e x – sin x
= 0.5
=0
=Π

For the given systems of linear equations, with initial

values x1 =0;  x2 =0; x3 = 0. The next iterative value of x3 using Gauss-
Seidel Method is 0.5278. 
= True
If matrix A is invertible such that A−1 = L−TL−1 then matrix A can be
decomposed using Cholesky’s method.
= True
Rearranging rows are prohibited when evaluating the matrix if it is
diagonally dominant.
= False
Positive definite matrix can be efficiently solved using Cholesky
decomposition.
= True
For  is the iteration may terminate if the difference between f (x)
is already zero.
= False
Choosing an initial guess which gives near f(x) = 0 is considered a good
guess
= True
The eigenvalues that corresponds to the characteristic polynomial are λ 2-
4λ+3 are λ = 1 and λ = -3.
= False
If x2 is the approximated root in Secant method, it follows that; the value of
f(x2) must be equal to 0.
= True
If QT is the transpose of Q then QT Q = I or the identity matrix.
= True
In general, an n × n matrix will have a characteristic polynomial of degree of
n+ 1, and its roots are the eigenvalues of A.
= False
Since matrices are used to represent properties of images, it follows that
transformation of images may use eigenvalues and eigenvectors to do that.
= True
The characteristic polynomial formed from the matrix

is given as:  -λ3+3λ2-4λ+4

= True
The approximated root using the secant method lies within the two initial
points which is used to project the secant line.
= False
An additional benefit of the power method is that the corresponding
eigenvector is obtained as a by-product of the method.
= True
For the function f(x) = ex-2 the next approximated value of the root when
x0 = -1 and x1 = 1 is x2 =  0.98626.
= False
Secant method is nearly as fast as the Newton-Raphson method and
ensures convergence rather than the latter.
= False
One of the advantages of secant method over the Newton’s Method is the
use of derivatives.
= True
Newton’s method and secant method has almost the same concept and
are both fast.
= True
In giving initial values of x0 and x1, both of them should preferably be close
to the solution.
= True
Triangular matrices have their eigenvalues on the diagonal of the matrix
therefore the eigenvalues of A are the diagonal elements.
= True
Secant method replaces the tangent in Newton’s method to the slope of the
function using two initial guesses.
= True
A matrix decomposition method that has an upper triangular matrix and an
orthogonal matrix is referred to as the QR 
= True
Secant method is categorized as bracketing method because it uses two
points of the secant as initial values.
= False
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
= True
Power method is an iterative approach that can be employed to determine
the largest or dominant eigenvalue
= True
Secant method is usually the best option if the function doesn’t have an
exact formula but just a pair of x and y values.
= True
If matrix A gives the largest eigenvalue, it suggests that if A -1 exists, the
smallest eigenvalue can be obtained through inverse power method.
= True
The eigenvectors of A = and  are the same.
= False
If a matrix has its entire diagonal elements are positive, then the real parts
of its eigenvalues are negative.
= False
The iteration in Secant method may terminate if the difference between two
successive approximations equal to zero.
= True
When it comes to computer implementation, secant method may have an
advantage over the Newton-Raphson since the latter only evaluates the
function and not its derivative.
= True
Given a matrix A , its QR -decomposition is an upper triangular matrix and
an orthogonal matrix. An orthogonal matrix is a matrix whose transpose is
equivalent to its inverse.
= True
The function f(x) = x3 -5 with initial guesses x0 and x1 would converge.
= True
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.
= True
The slope of the secant line has nothing to do with the convergence of the
Secant method.
= False
The part where the derivative of the Newton-Raphson was replaced by the
slope of the secant line in Secant method.
= True
The characteristic polynomial involves the calculation of zeros. These
values of the roots are the eigenvalues.
= True
Just like the Newton-Raphson method, the initial guesses affect the
convergence of the Secant method.
= True
The eigenvalues of A =  are λ = 0 and λ = -3.
= True
The Secant method is convergent for the function f(x) = 3x 4 – x -3 whose
initial values are present between x0 = 2 and x1 = 4 
= False
The eigenvalues of A =  have no rational values because of the zero
element in the matrix.
= False
Eigenvalues are used in the analysis of linear transformation such as
scaling.
= True
If A−1 (if it exists) the eigenvalues of A−1 is 1/5, ¼ and ½ if matrix A  has
eigenvalues 5, 4 and 2.
= True

Matrix  has repeated eigenvalues

= True
For the function f(x) = ex-2 the value of f(x2) when x0 = -1 and x1 = 1 is f(x)
=  -0.5248
= True
Direct method for finding the eigenvalues is recommended since the
calculation of zeros of a polynomial is numerically challenging if not
unstable.
= False
The Secant method is convergent for the function f(x) = 3x 4 – x -3 whose
initial values are present between x0 = 0 and x1 = -1 
= True
The secant method can fail to find a root of a nonlinear function that has a
small slope near the root assures the presence of the root.
= False
The largest eigenvalue of A−1  is the smallest eigenvalue of A in magnitude.
= True