Assignment-II Report

Numerical Computing
Group 19

Assignment II Report 2011

Introduction
Term Linear algebraic system represents a collection of linear equations which involving the same set of variables. These kinds of systems play major roles in applied physics, applied mathematics and also in computing. Matrices create a mathematical model for these linear algebraic systems. So through manipulating these models it can be solved and get various derivations for these systems. So one of the main objectives of the system is to model a set of equation to matrices and manipulate them to get various derivations and solutions to linear algebraic systems. So in this system it is being implemented Gauss-Seidel iteration method, Gaussian methods and Banded systems which is a special linear system solver. Other than that factorization methods of matrices also implemented in order to simplify the linear system and get the derivatives easily and solve them fast. The other main objective of our system is to find the Interpolative polynomials for given set of points and compare the derived polynomial and actual polynomial using graphs. An interpolative polynomial which is derived using set of given points, models an approximated function which will give a closer approximation to the values within the range of points. This has its applications in lot of fields. Approximation of the polynomial gives an overview of the behavior of points and values and will predict the unknowns to certain extend. This modeling is done by using Lagranges method and Newtons divided difference, forward difference and backward difference methods. This objective addresses a wide area in computer science which includes image processing and 3D Graphics and animations.

Objectives
Objective of this report is address few important questions by analyzing the results obtained from the system and to give a proper justification on the subject. The questions which is being addressed in this report given below 1. What are the real equations which could give problems when comparing with the interpolating polynomial? 2. List problems of polynomial interpolation with relevant examples drawn from the software created.

** This report also includes all the references and resources which the developer team of the software suite referred and used.

Assignment II Report 2011

Real equations Vs Interpolated polynomials
Under this section it is being considered the problematic situation which could arise when comparing a Real equation with the Interpolated polynomial which is approximated for a given set of points.

Higher order equations/polynomials

Numerical Interpolation methods give the simplest approximated polynomial for a given set of points where the degree of the given polynomial is 1 lesser than the number of points given. So there is a high chance of give an insufficient number of points to approximate a real polynomial which has a higher degree. So in these kind of cases interpolation is more likely to be failed.

Infinite equations/polynomials

Another point where interpolation is likely to be failed is approximating the infinite equations or series. Because as per the theory to approximate an infinite series or an equation we need to have infinite-1 points which is impossible. So these kind of real equations are also likely to be failed with Numerical method for Interpolation. Below are some examples for infinite series and equations. Trigonometry equations Exponential equations

Problems of polynomial interpolation

There are some problems regarding giving input points for the system to find Interpolative polynomial

Distinct values for x

In a given points set if there are non distinct points where the same x value is repeated then Numerical methods are likely to be failed or give false approximations. With the system both Lagrange and Newtons divided difference gave ZeroDivisionalError error while Newtons Forward difference gave a false approximation for the polynomial where the interpolated polynomial does not go through the repeated points. So this is a restriction regarding giving the input points to the system to calculate Interpolative polynomial using Numerical methods. No x values must be repeated in order to algorithm be success.

Assignment II Report 2011

Same x values are repeated (Forward Difference) Divided difference become smooth in Higher order differences

In Newtons divided difference method to approximate the polynomial, if the higher order differences do not become smooth polynomial interpolation will be much and more likely to be deviated from the original polynomial

Assignment II Report 2011

Bibliography

http://math.fullerton.edu/mathews/n2003/NumericalUndergradMod.html http://home.iitk.ac.in/~arlal/book/nptel/mth102/node109.html http://en.wikipedia.org/wiki/Polynomial_interpolation Numerical Methods for Scientists and Engineers by S.K Rao Numerical Methods for Scientists and Engineers by Richard W. Hamming, Richard Wesley Hamming