ISLAMIA DEGREE AND PG COLLEGE
DEPARTMENT OF MATHEMATICS
[Link]. I YEAR – SEMESTER I
NUMERICAL ANALYSIS (M104)
INTERNAL ASSIGNMENT (CCE)
Prepared Answers – Long Questions
1. Iteration Method
The Iteration Method, also known as the Fixed Point Iteration Method, is a numerical technique used to
obtain approximate solutions of algebraic and transcendental equations of the form f(x)=0. Many
equations arising in science and engineering cannot be solved analytically; therefore, numerical
methods like iteration play a crucial role.
The basic idea of the iteration method is to rewrite the equation f(x)=0 in the equivalent form x = g(x). A
number α is said to be a fixed point of the function g(x) if α = g(α). The solution of the equation is
obtained by generating a sequence defined by x_{n+1} = g(x_n).
Starting with an initial approximation x0, successive values are computed until the difference between
two successive approximations becomes sufficiently small. The convergence of the method depends
strongly on the choice of the function g(x).
The convergence criterion for the iteration method is |g'(x)| < 1 in the neighborhood of the root. If this
condition is satisfied, the iteration converges to the required solution; otherwise, it diverges.
The iteration method is simple and easy to implement but may converge slowly. It is widely used in
solving nonlinear equations where other direct methods fail.
2. Gauss Elimination Method
Gauss Elimination Method is a direct numerical method used to solve systems of simultaneous linear
equations. It transforms the given system into an equivalent upper triangular system, which can then be
solved by back substitution.
The method consists of two main steps: forward elimination and back substitution. In forward
elimination, variables are eliminated step by step to convert the coefficient matrix into an upper
triangular form.
Once the matrix is in upper triangular form, back substitution is used to compute the unknown variables
starting from the last equation.
Pivoting techniques such as partial pivoting and complete pivoting are used to reduce numerical errors
caused by division by small numbers.
Gauss elimination is systematic and suitable for computer implementation, though rounding errors may
accumulate for large systems.
3. Jacobi Iteration Method
Jacobi Iteration Method is an iterative technique for solving a system of linear equations. Unlike direct
methods, it starts with an initial guess and improves the solution through repeated iterations.
Each equation in the system is solved for its diagonal variable, assuming the remaining variables are
known from the previous iteration.
The method converges if the coefficient matrix is diagonally dominant, meaning the absolute value of
each diagonal element is greater than the sum of the absolute values of the other elements in the same
row.
Jacobi method is simple and suitable for parallel computation, but it generally converges slowly
compared to other iterative methods.
It is widely used in large systems where direct methods are computationally expensive.
4. Least Square Approximation
Least Square Approximation is a statistical and numerical method used to find the best fitting curve for a
given set of data points.
When experimental data contains errors or inconsistencies, it may not be possible to find a curve that
passes through all points exactly. In such cases, the least square method provides the best
approximate solution.
The principle of least squares is to minimize the sum of the squares of the residuals, which are the
differences between observed and calculated values.
For a linear fit y = a + bx, normal equations are derived and solved to determine the constants a and b.
Least square approximation is widely used in data analysis, regression, statistics, and machine
learning.
5. Gauss–Legendre Integration Method
Gauss–Legendre Integration Method is an advanced numerical integration technique that provides
highly accurate results using fewer function evaluations.
It approximates the definite integral of a function over the interval [-1, 1] using weighted sums of
function values at specific points.
The nodes used in Gauss–Legendre integration are the roots of Legendre polynomials, and the
corresponding weights are chosen to maximize accuracy.
Two-point and three-point Gauss–Legendre formulas are commonly used in practical applications.
This method is widely used in physics, engineering, and numerical simulations due to its efficiency and
accuracy.