Numerical Analysis and Integration Techniques
Interpolation and Difference Operators
Interpolation Defined:
- Given a set of values (x0,y0),(x1,y1),(x2,y2)…(xn,yn), where x is known and the explicit formula for the relation is not provided.
- The process of estimating the value of y for a given value of x within the range of the provided set is known as interpolation.
Criteria for Choosing Interpolation Methods:
- Newton Forward Interpolation Formula: Used when values of x are equidistant and the target x is near the beginning of the table.
- Newton Backward Interpolation Formula: Used when values of x are equidistant and the target x is near the end of the table.
- Lagrange’s Interpolation Formula: Use this when the values of x are not equidistant; the Newton formulas are not applicable in this case.
Forward Difference Operator (Δ) [Delta]:
- Defined for sets where x values are equidistant.
- First-order differences: Δy0=y1−y0, Δy1=y2−y1, Δy2=y3−y2.
- Second-order differences: Δ2y0=Δy1−Δy0, Δ2y1=Δy2−Δy1.
- This logic extends to third, fourth, and higher orders.
Backward Difference Operator (∇) [Del]:
- Defined for equidistant sets of x.
- First-order differences: ∇y1=y1−y0, ∇y2=y2−y1, ∇y3=y3−y2.
- Second-order differences: ∇2y2=∇y2−∇y1, ∇2y3=∇y3−∇y2.
Newton’s Forward Interpolation Formula (NFIF):
- Formula: y(x)=y0+uΔy0+2!u(u−1)Δ2y0+3!u(u−1)(u−2)Δ3y0+…
- Where u=hx−x0.
- h is the common difference between equidistant x values.
NFIF Example 1: Estimate y at x=1.27.
- Data: (x=1,y=3.0042), (x=1.3,y=3.6693), (x=1.5,y=4.4817), (x=1.7,y=5.4739).
- Step 1: Calculate differences: Δy0=0.6651, Δ2y0=0.1473, Δ3y0=0.0325.
- Step 2: h=0.3; calculation uses u=0.85.
- Step 3: y(1.27)=3.0042+0.85×0.6651+20.85(0.85−1)×0.1473+60.85(0.85−1)(0.85−2)×0.0325.
- Result: y(1.27)=3.5609.
Newton’s Backward Interpolation Formula (NBIF):
- Formula: y(x)=yn+u∇yn+2!u(u+1)∇2yn+3!u(u+1)(u+2)∇3yn+…
- Where u=hx−xn.
NBIF Example 1: Estimate y at x=15.2.
- Data: (10,54), (12,60), (14,72), (16,75).
- Step 1: xn=16, h=2, u=215.2−16=−0.4.
- Step 2: Calculate backward differences: ∇yn=3, ∇2yn=9, ∇3yn=15.
- Step 3: y(15.2)=75+(−0.4×3)+2−0.4(−0.4+1)×15… (simplified).
- Result: y(15.2)=73.84.
NBIF Example 2: Estimate y at x=126.
- Data: (100,4.6052), (110,4.7005), (120,4.7875), (130,4.8675).
- Step 1: h=10,u=10126−130=−0.4.
- Step 2: ∇yn=0.08,∇2yn=−0.0070,∇3yn=0.0013.
- Result: y(126)=4.8363.
Solutions of Non-Linear Equations
Definitions and Classification:
- An equation of the form f(x)=0 is non-linear if the highest power of the variable is greater than 1 or if it contains trigonometric/logarithmic functions.
- Algebraic Equations: Example: x4−x−10=0, x2−4x+4=0.
- Transcendental Equations: Example: xsin(x)−12=0, xlog(x)−12=0.
Descartes’ Rule of Sign (Interval Location):
- If f(a) and f(b) are of opposite signs, there exists at least one real root between a and b.
Bisection Method:
- Step 1: Find interval [a,b] such that f(a)⋅f(b)<0.
- Step 2: Find the first approximation: x1=2a+b.
- Step 3: Evaluate f(x1). If f(x1)<0, the root lies in the interval between x1 and the endpoint that yields a positive sign.
- Example: x4−x−10=0. f(1)=−10 (neg), f(2)=4 (pos). Root in [1,2]. Approximations: x1=1.5,x2=1.75,x3=1.875,x4=1.8125.
Newton-Raphson Method:
- Formula: xn+1=xn−f′(xn)f(xn).
- Example: x3−x−5=0. f′(x)=3x2−1. Let x0=1.6. Result: Real root =2.0921.
- Example: x4−x3−10=0. f′(x)=4x3−3x2. Let x0=2.5. Result: x1=2.1929.
Regula-Falsi Method (False Position Method):
- Formula to solve f(x)=0: x=f(b)−f(a)af(b)−bf(a).
- Example: x3−x−10=0 in interval [2,3]. Root: 2.3099.
- Example: xsin(x)+cos(x)=0 in interval [2,3]. Root: 2.7984.
- Example: xlog10(x)−1.5=0. Root: 2.0665.
Secant Method:
- Similar to Regula-Falsi, but it does not require endpoints to have opposite signs at every iteration.
- Iterative formula: xn+1=f(xn)−f(xn−1)xn−1f(xn)−xnf(xn−1).
Numerical Integration