CAEECentre for Automotive Embedded Engineering · HSR Layout, Bengaluru
Module 17 of 20 · Intermediate

Numerical Methods for Electrical Engineering

Numerical methods approximate solutions when closed-form mathematics is unavailable or impractical. Accuracy, stability, convergence and computational cost must be checked.

Intermediate70 min study timePrerequisite: Algebra and differential calculus
Module learning progress0 of 3 stages

1 · Why this mathematics matters

Solve nonlinear circuit, device and power-flow equations when closed forms fail.

2 · Prerequisites and learning approach

Prerequisites: Algebra and differential calculus. Begin with the physical meaning, identify every symbol and unit, study the fixed-scale graph, then solve and verify the examples.

3 · Symbols and units

xkcurrent iterate
εerror tolerance
hstep size
f′(x)local derivative

4 · Concepts and textbook formulas

1. Root finding

Bisection is robust; Newton-Raphson is fast near a simple root but depends on a good starting point and derivative.

Root finding equation

How to read it: identify the output quantity first, then the variables, parameters, units and assumptions. Test zero, unity and limiting values before using the equation in a design.

2. Linear systems

Gaussian elimination and LU factorisation solve large circuit and field matrices efficiently.

Linear systems equation

How to read it: identify the output quantity first, then the variables, parameters, units and assumptions. Test zero, unity and limiting values before using the equation in a design.

3. Numerical integration

Trapezoidal and Simpson rules approximate accumulated area from samples.

Numerical integration equation

How to read it: identify the output quantity first, then the variables, parameters, units and assumptions. Test zero, unity and limiting values before using the equation in a design.

4. ODE integration

Euler and Runge-Kutta methods step a dynamic model forward in time. Step size controls truncation error and may affect stability.

ODE integration equation

How to read it: identify the output quantity first, then the variables, parameters, units and assumptions. Test zero, unity and limiting values before using the equation in a design.

5 · Step-by-step worked examples

Example 1: Foundation

Newton-Raphson for x^2-2=0 starting at 1.5 gives 1.4167 after one iteration, close to sqrt(2).

Verification: check the unit, sign, order of magnitude and physical trend.

Example 2: Newton iteration

Given: Solve v cubed minus 2 equals zero from v0=1.

Newton iteration solution equation

Engineering meaning: Each iteration uses the local tangent to estimate the next root.

Example 3: Euler stability

Given: For x dot equals -a x, forward Euler gives x next.

Euler stability solution equation

Engineering meaning: Even a stable physical system can become numerically unstable if the step is too large.

6 · EE/ECE applications

  • SPICE algorithms — use the governing equation to predict parameter sensitivity, confirm a simulation and interpret measured behaviour.
  • load-flow computation — use the governing equation to predict parameter sensitivity, confirm a simulation and interpret measured behaviour.
  • embedded control simulation — use the governing equation to predict parameter sensitivity, confirm a simulation and interpret measured behaviour.
  • finite-element analysis — use the governing equation to predict parameter sensitivity, confirm a simulation and interpret measured behaviour.

7 · Common mistakes

  • Reporting an answer without a convergence or error check.
  • Choosing a starting point that drives iteration away from the root.

8 · Practice problems

  1. Perform three Newton–Raphson iterations for a nonlinear equation.
  2. Compare truncation error for two numerical step sizes.
Verification habit: predict the direction of change before calculating, then check units, sign, limiting cases and engineering reasonableness.