Scribd
Upload
20 views

Summary of Numerical Methods for Engineers

The document outlines various numerical methods used in engineering, categorized by topics such as root finding, linear algebra, interpolation, numerical differentiation, integration, ordinary differential equations (ODEs), partial differential equations (PDEs), and optimization. Each method is accompanied by its formula or explanation, providing a quick reference for engineers. Key methods include the Bisection Method, Gauss Elimination, Lagrange Interpolation, and Euler's Method among others.

Uploaded by

salah
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Summary of Numerical Methods for Engineers

The document outlines various numerical methods used in engineering, categorized by topics such as root finding, linear algebra, interpolation, numerical differentiation, integration, ordinary differential equations (ODEs), partial differential equations (PDEs), and optimization. Each method is accompanied by its formula or explanation, providing a quick reference for engineers. Key methods include the Bisection Method, Gauss Elimination, Lagrange Interpolation, and Euler's Method among others.

Uploaded by

salah
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Summary of Numerical Methods for Engineers

Table of Numerical Methods


Topic Method/Equation Formula/Explanat
3*Root Finding Bisection Method x = a+b
2
Newton-Raphson Method xn+1 = xn − ff′(x n)
(xn
xn −
Secant Method xn+1 = xn − f (xn ) f (xn )−
3*Linear Algebra Gauss Elimination Converts system to upper triangular form
LU Decomposition A = LU , where L is lower triangular, U
(k+1)
= a1ii bi − j̸=i a
P
Gauss-Seidel Method xi
Pn Q
2*Interpolation Lagrange Interpolation P (x) = i=0 yi j̸=i x
Newton’s Divided Differences Uses divided difference table to compute i
3*Numerical Differentiation Forward Difference f ′ (x) ≈ f (x+h)−f
h
(x

′ f (x+h)−f (x−
Central Difference f (x) ≈ 2h
Backward Difference f ′ (x) ≈ f (x)−fh(x−h
Rb
f (x)dx ≈ h2 [f (a) + 2 f (
P
3*Numerical Integration Trapezoidal Rule a
Rb
Simpson’s 1/3 Rule a
f (x)dx ≈ h3 [f (a) + 4f (x1 ) + 2f
Gaussian Quadrature Uses weighted sum of function value
2*ODEs Euler’s Method yn+1 = yn + hf (xn ,
Runge-Kutta (RK4) yn+1 = yn + h6 (k1 + 2k2 +
1*PDEs Finite Difference Method Discretizes derivatives into algeb
2*Optimization Golden Section Search Finds minima/maxima using bra
Gradient Descent xn+1 = xn − α∇f (xn ), where

You might also like