Professional Documents
Culture Documents
Numerical Solution of Sets of Equations
Numerical Solution of Sets of Equations
What is the difference between Direct and Iterative Methods for solving systems of equations?
Direct Method: After applying the method, you get a one and the final answer, and there are no further improvement
steps.
Iterative Method: You start from some guessed solution, and then improve it by repeating certain combination of
steps
___________ _________________ ___________________ _________________
No. of steps needed to get solution in Direct methods and in Iterative methods?
Direct Methods: need 2/3 n3 steps
Iterative Methods: need smaller number of steps, namely, n2 steps
___________ _________________ ___________________ _________________
Which out of the following methods for solving systems of equations are direct and which are Iterative?
1. Cramer’s Rule
2. Gauss-Jordan Method (Gauss Elimination Method (Echelon))
3. Jacobi Method
4. Gauss-Seidel Method
5. Relaxation Method
Cramer’s Rule and Gauss-Jordan are direct, while Jacobi, Gauss-Seidel and Relaxation method are Iterative methods.
____________ _________________ ___________________ _________________
Which is more efficient? Jacobi or Guass-Seidel Method?
GSM is more efficient as it needs less steps to get divergent solution
____________ _________________ ___________________ _________________
Comparison of Gauss-Elimination Method and Gauss-Jordan Method (direct/iteration, reduction of coefficient
matrix, back substitution)
Answer: a
Explanation: There are two types of methods to solve simultaneous algebraic equations, namely, direct and iterative
methods.
____________ _________________ ___________________ _________________
Direct methods are preferred over iterative methods as they provide solution faster.
a) True
b) False
View Answer
Answer: b
Explanation: Iterative methods are preferred over direct methods as they provide solution faster. And, amount of
accuracy depends upon accuracy desired which is achieved by iterative methods.
____________ _________________ ___________________ _________________
What are the advantages of direct methods for solving the simultaneous algebraic equations?
a) Rounding of errors get propagated
b) Quite time consuming
c) Requires more recording of data
d) Yield a solution after a finite number of steps for any non-singular set of equations
View Answer
Answer: d
Explanation: The only advantage of direct method is that we can yield a solution after a finite number of steps for any
non-singular set of equations.
____________ _________________ ___________________ _________________
How many types of instabilities occur while solving a linear system of equations?
a) 2
b) 3
c) 4
d) 5
View Answer
Answer: a
Explanation: There are two types of instabilities which occur while solving a linear system of equations, namely,
induced and inherent stability.
____________ _________________ ___________________ _________________
What is induced instability?
a) Instability due to reduction in problem
b) Instability due to number of computations
c) Instability due to errors in programming
d) Instability due to incorrect choice of method for solving equations
View Answer
Answer: d
Explanation: Induced instability is the Instability due to incorrect choice of method for solving equations. As different
methods have different accuracy level.
____________ _________________ ___________________ _________________
What is inherent instability?
a) Instability due to convergence of solution
b) Instability due to ill conditioned set of equations
c) Instability due to propagation of rounding of errors
d) Instability due to incorrect choice of method of solution
View Answer
Answer: b
Explanation: Inherent instability is the Instability due to ill conditioned set of equations. The linear system is called ill
conditioned, if small changes in the coefficients of equations result in XXsmallXX LARGE changes in the values of the
unknowns.
____________ _________________ ___________________ _________________
When the linear system is called ill conditioned?
a) If small changes in the coefficients of equations result in large changes in the values of the unknowns
b) If reduction is done in the problem
c) If the programming of linear system is expensive
d) If small changes in the coefficients of equations result in small changes in the values of the unknowns
View Answer
Answer: a
Explanation: The linear system is called ill conditioned, if small changes in the coefficients of equations result in large
changes in the values of the unknowns.
____________ _________________ ___________________ _________________
How can we avoid instability?
a) Reformulation of problem suitably
b) Making small changes in the coefficients of equations
c) Choosing the method involving higher computations
d) Rounding off the errors
View Answer
Answer: a
Explanation: We can only avoid instability by reformulating the problem suitably. Making small changes in the
coefficients would be a hit and trial process. Rounding off and choosing the method involving higher computations are
completely unpredictable process.
____________ _________________ ___________________ _________________
Do always Jacobi Method and Gauss-Seidel Method converge? If not, then how can they be made convergent?
Usually they converge, but not always.
They will necessarily be convergent if the coefficient matrix is a Strictly diagonally dominant matrix irrespective of the
he initial guess.
____________ _________________ ___________________ _________________
Is it possible that Jacobi method diverges but Gauss-Seidel method converges for a given set of equations?
No, they either both converge, or both diverge at the same time.
____________ _________________ ___________________ _________________
Answer: c
Explanation: The process of constructing a sequence of vectors and obtaining the solution of a system using specified
accuracy is called iteration. Elimination and reduction are not sequential processes. Raphson method is a method
which is employed for finding the roots of an equation through some different procedure.
Answer: a
Explanation: Numerical techniques more commonly involve an iteration method due to the degree of accuracy
involved. This is because, iterations reduce the approximation errors which may occur in numerical problems. They
perform sequential operations which in turn increases the accuracy.
Answer: a
Explanation: The drawback of using direct methods of solution is that these methods yield solution after a certain
amount of fixed computation (we cannot get solution before that amount of computation). There are no calculations
and back substitution in direct methods. Their accuracy is less than that of iterative methods, but that is not the
primary drawback.
____________ _________________ ___________________ _________________
In an iterative method, the amount of computation depends on the _________
a) Number of variables
b) Degree of accuracy
c) Rounding of errors
d) Ease of using the operators
View Answer
Answer: b
Explanation: In an iterative method, the amount of computation depends on the degree of accuracy required. More is
the accuracy required, more will be the number of computations involved.
Answer: b
Explanation: Iteration is also called as self-correcting process as with the sequence of operations, accuracy increases
accompanied by corrections in the process. Any error made at any stage of computation gets automatically corrected
in the subsequent steps.
____________ _________________ ___________________ _________________
Which of the following is an iterative method?
a) Gauss Jordan
b) Gauss Elimination
c) Gauss seidal
d) Factorization
View Answer
Answer: c
Explanation: Gauss seidal method is an iterative method. Gauss elimination is based upon elimination of unknowns.
Gauss Jordan is based on back substitution as well as elimination. Factorization is based upon formation of two
triangular matrices with a matrix.
____________ _________________ ___________________ _________________
Why iterative methods are called as self correcting?
a) Iterations involve repetition
b) Checks occurring during the process ensure that the errors are reduced
c) Any error made at any stage of computation gets automatically corrected in the subsequent steps
d) After each step, validity of the method is checked.
View Answer
Answer: c
Explanation: Any error made at any stage of computation gets automatically corrected in the subsequent steps that’s
why iterative methods are called self-correcting.
Answer: d
Explanation: Jacobi’s method, Gauss Seidal method and Relaxation method are the iterative methods and Gauss
Jordan method is not as it does not involves repetition of a particular set of steps followed by some sequence which is
known as iteration.
Answer: a
Explanation: Number of iteration depends on the initial value taken to start the iteration. The initial value shows the
amount of accuracy that has to be achieved. And we know that, more is the accuracy required, more will be the
number iteration
____________ _________________ ___________________ _________________
The difference between Gaussian elimination and the Gaussian Jordan elimination is that one produces a
matrix in row echelon form while the other produces a matrix in row reduced echelon form. A row echelon
form matrix has an upper triangular composition where any zero rows are at the bottom and leading terms
are all to the right of the leading term from the row above. Reduced echelon form goes beyond by
simplifying much more (sometimes even reaching the shape of an identity matrix).
Logical error
____________ _________________ ___________________ _________________