Information Technology(4th Sem.)
Computational Mathematics__________________________________ |
Computational Mathematics SyllabusUNIT– 1NUMERICAL SOLUTIONS OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Bisection Method, Regula-Falsi Method, Newton-Raphson Method, Secant Method, Birge-Vieta Method, Bairstow’s Method. UNIT– 2 NUMERICAL SOLUTIONS OF SIMULTANEOUS LINEAR EQUATIONS Direct Methods - Gauss Elimination, Gauss-Jordan & Crout’s Triangularisation Method. Iterative Methods - Jacobi’s, Gauss- Siedal & Successive Over Relaxation Method. UNIT – 3 INTERPOLATION WITH EQUAL AND UNEQUAL INTERVALS Finite differences, Newton’s Forward & Backward Difference Formulae, Central Difference Formula, Stirling’s Formula, Bessel’s Formula, Lagrange’s Formula and Newton’s Divided Difference Formula, UNIT – 4 NUMERICAL DIFFERENTIATION AND INTEGRATION Derivatives using Forward, Backward and Central Difference Formulae. Newton-Cote’s Quadrature Formula, Trapezoidal rule, Simpson’s rules, Weddle’s rule. UNIT – 5 NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS Picard’s Method, Taylor’s Series Method, Euler’s Method, Euler’s Modified Method, RungeKutta Methods, Predictor-corrector Methods- Milne’s Method, Adams-Bashforth Method. |
Home|Engineering|First Year|Practicals|Campus|Forum|Colleges|MYblog|About us
Designed by:Ashirwad Kumar