∑
∫
√
π
e
∞
MFOR MATHODOLOGY
Course · Free · Beginner to Advanced

Numerical
Computing.

When equations refuse to solve themselves on paper. Root-finding, interpolation, and the methods that turn impossible problems into approximate, computable ones — free for everyone.

FEEL MATHS·DON'T MEMORISE·CONCEPT FIRST·FEEL MATHS·DON'T MEMORISE·CONCEPT FIRST·FEEL MATHS·DON'T MEMORISE·CONCEPT FIRST·
← Back to Inside Our Classes
Beginner

Basic Concepts

Start here — building the core intuition, step by step.

LECTURE 01

🎬 Fixed-Point Iteration Method

Root Finding • Fixed-point iteration technique for solving equations

LECTURE 02

🎬 Regula Falsi (False Position) Method

Root Finding • False position method for numerical root finding

LECTURE 03

🎬 Newton-Raphson Method

Root Finding • Newton-Raphson method for fast convergence

LECTURE 04

🎬 Secant and False Position Methods

Root Finding • Secant method and false position combined analysis

LECTURE 05

🎬 Simpson's 1-3 Rule Explained

Numerical Integration • Simpson's 1/3 rule for numerical integration

LECTURE 06

🎬 Trapezoidal Rule Explained - Numerical Integration

Numerical Integration • Trapezoidal rule for approximating integrals

Pro

Advanced & One-Shot Revision

Fast-paced, exam-focused videos — best for revising the full course.

REVISION 01

🎬 Quick Revision of All Topics in Numerical Computing & Numerical Analysis

One-Shot Revision • Complete overview of numerical computing and numerical analysis topics

REVISION 02

🎬 Numerical Computing in One Shot

One-Shot Lecture • Complete numerical computing course condensed