MA 204 Study Notes
MA 204 - Numerical Methods
Course Details
- Instructor: Niraj
- Date: 18 March 2026
- Course Code: MA204N
Recommended Books
- SS Sastry, Introductory Methods for Numerical Analysis, PHI Learning, 2012
- SRK Iyengar & RK Jain, Numerical Methods, New Age International, 2009
Numerical Solution of Ordinary Differential Equations (ODE)
Initial Value Problem (IVP)
- Consider the equation:
- Example: Find the solution for given that .
- The Taylor series for around is given by:
- To compute to four decimal places involves several derivatives calculated at the point of interest.
Taylor Series Method
Derivation of Taylor Series Expansion
- The Taylor series for a function is:
- Higher derivatives can be calculated recursively using the property of derivatives, e.g.,
- Total derivative in multivariable functions:
Example 1: Finding for
- Given:
-
- Substitute into the Taylor series:
- Step-By-Step Calculation:
- Calculate successive derivatives at the given point:
1.
2.
3. - The Taylor series becomes:
- This expands to a quadratic or cubic approximation which allows the calculation of .
Picard’s Method of Successive Approximations
- General formulation:
- Start with an initial guess ; use the integral form of the function defined by the ODE to obtain the next approximation.
- The sequence for approximations can be expressed recursively:
y^{(n)} = Y_0 + rac{1}{h} extstyle egin{pmatrix} ext{integral vertex}_1 ext{d}x… + ext{integral vertex}_2 ext{d}x ext{… trusted values}... ext{and further combinations} ext{…} ext{to the } n-1 ext{th term…} ext{until convergence}\
ext{Repeating this will yield a successive approximation to the IVP.}
Euler’s Method
- Start with initial condition
- For each step from to , calculate:
- Repeat this step for a predefined number of iterations or until a desired accuracy is achieved.
Example: Solve with
- Using Euler's method, we'll apply to obtain successive points and how they converge to an approximation of the solution.
- Important steps include calculations for incremental :
Modified Euler’s Method
- Improved calculation using a midpoint approach:
- At each step calculate a midpoint (or use a trapezoidal rule):
Runge-Kutta Method
- A highly reliable method; generally implemented of second to fourth order conventional improvements to improve error:
Example: Fourth Order Runge-Kutta Method
- Compute:
-
-
-
- - Calculate the next term:
Predictor-Corrector Methods
- Have
Predictorwhich estimates; subsequently refined viaCorrectorwhich refines the estimate for better accuracy.
Final Exercise Examples
- There are many theoretical and practical exercises to consider regenerative function values at multiple points as discussed above.
- Each exercise aims to reinforce and integrate the knowledge acquired in various numerical methods towards solving IVPs successfully.
Conclusion
- The essence of numerical methods is their iterative approximation leading to higher precision in solving ordinary differential equations through well-framed mathematical theories and methods.