Numerical Methods Lec 02: Newton-Raphson, Secant & Fixed Point | GATE/ESE

Added:

Secant Method Derivation
Fixed-Point Iteration
Convergence Order
Bisection Iterations
Newton-Raphson Applications
Convergence & Reciprocal
Numerical Computation
Bisection & Transcendental Roots
Solution Counting & Limits
LU Decomposition Algorithm

Secant Method Derivation

0:00
Playing Section
  • 1

    Derives secant method formula from Newton-Raphson using backward difference.

  • 2

    Explains forward, backward, and central difference approximations for derivatives.

  • 3

    Highlights the secant method's iterative formula using two previous points.

Basic differential calculus, specifically the geometric interpretation of derivatives and tangent lines.
The concept of algebraic and transcendental equations and what it means to find their roots mathematically.
The Intermediate Value Theorem (IVT) for locating intervals where roots are guaranteed to exist.
Fundamentals of sequences, limits, and the basic concept of iterative mathematical processes.
Multidimensional root-finding methods, such as the Newton-Raphson method for systems of non-linear equations.
Numerical interpolation and approximation techniques, including Lagrange and Newton's forward/backward difference polynomials.
Numerical integration techniques such as the Trapezoidal Rule, Simpson's Rules, and Gaussian Quadrature.
Numerical solutions of Ordinary Differential Equations (ODEs) using Euler's and Runge-Kutta (RK) methods.
10.2K views189likes2:10:26@engineershub8954Original Release: 2020-06-28

The rate of convergence (order of convergence) measures how quickly an iterative method approaches the true solution, defined as the largest real number P such that the error at iteration k+1 is proportional to the error at iteration k raised to the power P (ek+1 ≈ C × ek^P). Newton-Raphson method has quadratic convergence (P=2), secant method has superlinear convergence with P≈1.618 (golden ratio), while bisection and regula falsi methods have linear convergence (P=1). Higher P values indicate faster convergence, meaning fewer iterations are needed to achieve a desired accuracy.