Numerical Methods
Numerical Methods
Its general solution contains two arbitrary constants. To determine these constants we need to
prescribe two conditions.
The conditions are called initial conditions if 𝑦 and 𝑦′ are specified at a certain value of 𝑥.
The differential equation together with the initial conditions is called the initial value problem.
The differential equation together with the boundary conditions is called a boundary value
problem.
1
The solution of an initial value problem, in general, exists and is unique, but the solution of a
boundary value problem may exist or may not.
(1) 𝒚′′ + 𝒚 = 𝟎, 𝒚 𝟎 = 𝟎, 𝒚 𝝅 = 𝟏
Auxiliary equation, 𝑚2 + 1 = 0 ⇒ 𝑚 = ±𝑖
𝑦 0 = 0 ⇒ A = 0; solution is 𝑦 = 𝐵𝑠𝑖𝑛𝑥
2
𝟐 𝒚′′ + 𝒚 = 𝟎, 𝒚 𝟎 = 𝟎, 𝒚 𝝅 =𝟎
𝑦(𝜋) = 1 ⇒ 0 = 𝐵 0 .
Hence the boundary value problem has an infinite number of solutions, 𝒚 = 𝑩𝒔𝒊𝒏𝒙, Where 𝐵
is an arbitrary constant.
3
𝟑 𝒚′′ + 𝒚 = 𝟎, 𝒚 𝟎 = 𝟎, 𝒚 𝝅/𝟐 = 𝟏
𝜋
𝑦 = 1 ⇒ 𝐵 = 1.
2
Hence the boundary value problem has the unique solutios, 𝒚 = 𝒔𝒊𝒏𝒙
4
To solve the boundary value problem of the form,
𝑥0 = 𝑎 𝑥1 𝑥2 𝑥𝑖 𝑥𝑖+1 𝑥𝑛−1 𝑥𝑛 = b
𝑦 𝑥𝑖 = 𝑦𝑖 , 𝑦 ′ 𝑥𝑖 = 𝑦𝑖′ , 𝑦 ′′ 𝑥𝑖 = 𝑦𝑖′′ .
𝑝 𝑥𝑖 = 𝑝𝑖 , 𝑞 𝑥𝑖 = 𝑞𝑖 , 𝑟 𝑥𝑖 = 𝑟𝑖 , 𝑓 𝑥𝑖 = 𝑓𝑖
5
By Taylor’s series expansion,
ℎ2 ′′ ℎ3 ′′′
𝑦𝑖+1 = 𝑦 𝑥𝑖+1 = 𝑦 𝑥𝑖 + ℎ = 𝑦𝑖 + ℎ𝑦𝑖′ + 𝑦 + 𝑦𝑖 + … ______ (1)
2! 𝑖 3!
ℎ2 ′′ ℎ3 ′′′
𝑦𝑖−1 = 𝑦 𝑥𝑖−1 = 𝑦 𝑥𝑖 − ℎ = 𝑦𝑖 − ℎ𝑦𝑖′ + 𝑦 − 𝑦𝑖 + … ______ (2)
2! 𝑖 3!
1 ℎ
Eqn(1) gives 𝑦 ′ 𝑥𝑖 = 𝑦 𝑥𝑖 + ℎ − 𝑦 𝑥𝑖 − 𝑦 ′′ 𝑥𝑖 − ⋯
ℎ 2
1
i.e., 𝑦 ′ 𝑥𝑖 = 𝑦 𝑥𝑖 + ℎ − 𝑦 𝑥𝑖 +𝑂 ℎ
ℎ
which is the forward difference approximation of 𝑦′(𝑥𝑖 ) with an error of the order ℎ.
′ 1
Similarly eqn(2) gives 𝑦 𝑥𝑖 = 𝑦 𝑥𝑖 − 𝑦 𝑥𝑖 − ℎ +𝑂 ℎ
ℎ
which is the backward difference approximation of 𝑦′(𝑥𝑖 ) with an error of the order ℎ.
6
1
Eqn(1)-Eqn(2) ⟹ 𝑦′ 𝑥𝑖 = 𝑦 𝑥𝑖 + ℎ − 𝑦 𝑥𝑖 − ℎ + 𝑂(ℎ2 )
2ℎ
Clearly this central difference approximation to 𝑦′(𝑥𝑖 ) is better than the forward or
backward difference approximations and hence should be preferred.
Yielding approximation,
′ 𝒚𝒊+𝟏 −𝒚𝒊−𝟏
𝒚𝒊 = with an error of the order ℎ2 .
𝟐𝒉
(3)
7
ℎ4 ′′′′
Eqn(1)+eqn(2) ⟹ 𝑦𝑖+1 + 𝑦𝑖−1 = 2𝑦𝑖 + ℎ2 𝑦𝑖′′ + 𝑦𝑖 + ⋯,
12
We get approximation as
In finite difference method 𝑦′ and 𝑦′′ are replaced by the finite differences using eqns (3) and
(4).
8
Consider the two cases that arise while solving linear boundary value problems.
We set 𝑥 = 𝑥𝑖 in BVP and replace 𝑦𝑖 ′ and 𝑦𝑖 ′′ by the approximations eqn(3) and (4) and we get
the system of equations
𝑝𝑖 𝑦𝑖′′ + 𝑞𝑖 𝑦𝑖′ + 𝑟𝑖 𝑦𝑖 = 𝑓𝑖
Examples:
10
𝑦𝑖+1 − 2𝑦𝑖 + 𝑦𝑖−1
𝑥𝑖 2 + 𝑦𝑖 = 0
1
4
16 1.25 𝑦2 − 2𝑦1 + 1 + 1 = 0
11
At 𝑖 = 2,
16𝑥2 𝑦3 − 2𝑦2 + 𝑦1 + 𝑦1 = 0
16 1.5 𝑦3 − 2𝑦2 + 𝑦1 + 𝑦1 = 0
16 1.75 2 − 2𝑦3 + 𝑦2 + 𝑦2 = 0
Solving equations (1), (2) and (3), We get 𝒚𝟏 = 𝟏. 𝟑𝟓𝟏𝟑, 𝒚𝟐 = 𝟏. 𝟔𝟑𝟒𝟗, 𝒚𝟑 = 𝟏. 𝟖𝟓𝟎𝟖
12
𝟏 𝟏
2) Solve 𝒚′′ − 𝒙𝒚′ + 𝒚 = 𝟏, 𝒚 𝟎 = 𝟎, 𝒚 𝟏 =0 with 𝒉 = by finite difference method.
𝟒 𝟑
1
Answer: With ℎ = , 𝑛 = 3
3
𝑥0 = 0 1 2 𝑥3 = 1
𝑥1 = 𝑥2 =
We find the unknowns 𝑦1 , 𝑦2 from the system, 3 3
1
𝑦 ′′ − 𝑥𝑦 ′ + 𝑦 = 1 ⟹ 𝑦𝑖′′ − 4𝑥𝑖 𝑦𝑖′ + 4𝑦𝑖 = 4
4
13
𝑦𝑖+1 − 2𝑦𝑖 + 𝑦𝑖−1 𝑦𝑖+1 − 𝑦𝑖−1
⟹ − 4𝑥𝑖 + 𝑦𝑖 = 4
1 2
9 3
⟹ 9 𝑦𝑖+1 − 2𝑦𝑖 + 𝑦𝑖−1 − 6𝑥𝑖 𝑦𝑖+1 − 𝑦𝑖−1 + 4𝑦𝑖 = 4, 𝑖 = 1, 2
When 𝑖 = 1,
1
9 𝑦2 − 2𝑦1 + 𝑦0 −6 𝑦2 − 𝑦0 + 4𝑦1 = 4
3
9 𝑦2 − 2𝑦1 + 0 − 2 𝑦2 − 0 + 4𝑦1 = 4
14
When 𝑖 = 2,
2
9 𝑦3 − 2𝑦2 + 𝑦1 −6 𝑦3 − 𝑦1 + 4𝑦2 = 4
3
9 𝑦2 − 2𝑦1 + 0 − 2 𝑦2 − 0 + 4𝑦1 = 4
𝟒 𝟑𝟔
Solving equations (1) and (2), We get 𝒚𝟏 = − , 𝒚𝟐 = −
𝟓 𝟑𝟓
15
Case (2): The boundary conditions involve 𝒚′
Examples:
𝑥0 = 0 𝑥1 = 0.5 𝑥2 = 1
i.e., Divide the interval [0, 1] into 2 equal parts
We find the unknowns 𝑦1 , 𝑦2 from the system,
𝑦𝑖′′ + 𝑥𝑖 𝑦𝑖 = 1, 𝑖 = 1, 2
When 𝑖 = 1
4 𝑦2 − 2𝑦1 + 𝑦0 + 𝑥1 𝑦1 = 1
4 𝑦2 − 2𝑦1 + 0 + (0.5)𝑦1 = 1
When 𝑖 = 2
4 𝑦3 − 2𝑦2 + 𝑦1 + 𝑥2 𝑦2 = 1
17
4 𝑦3 − 2𝑦2 + 𝑦1 + 1 𝑦2 = 1 _______ (2)
Here the problem involves 𝑦3 , the value of 𝑦 outside the given interval.
𝑦3 −𝑦1
⟹ 𝑦2′ = 1
2 2
⟹ 1 = y3 − y1 or 𝑦3 = 1 + 𝑦1
18
Now equation (2)⟹ 4 1 + 𝑦1 − 2𝑦2 + 𝑦1 + 1 𝑦2 = 1
10 29
Solving equations (1) and (3), we get, 𝑦1 = , 𝑦2 =
41 41
19
We find the unknowns 𝑦1 , 𝑦2 from the system,
𝑦𝑖′′ + 1 + 𝑥𝑖 𝑦𝑖′ − 𝑦𝑖 = 0, 𝑖 = 0, 1, 2
Here the problem involves 𝑦−1 , the value of 𝑦 outside the given interval.
Given boundary condition 𝑦 0 = 𝑦 ′ 0
𝑦 𝑥0 = 𝑦 ′ 𝑥0 ∵ 𝑥0 = 0
𝑦0 = 𝑦0′
20
𝑦𝑖+1 −𝑦𝑖−1
We know that, 𝑦𝑖′ =
2ℎ
𝑦1 −𝑦−1
𝑦0 =
2(0.5)
𝑦0 = 𝑦1 − 𝑦−1 ⟹ 𝑦−1 = 𝑦1 − 𝑦0
𝑦 𝑥2 + 𝑦 ′ 𝑥2 = 1 ∵ 𝑥2 = 1
𝑦2 + 𝑦2′ = 1
𝑦𝑖+1 − 𝑦𝑖−1
𝑦3 − 𝑦1 ∵ 𝑦𝑖′ =
𝑦2 + =1 2ℎ
2 0.5
𝑦3 = 1 + 𝑦1 − 𝑦2
22
Now equation (4) ⟹
4(1 + 𝑦1 − 𝑦2 − 2𝑦2 + 𝑦1 ) + (1 + 1) [1 + 𝑦1 − 𝑦2 − 𝑦1 ] − 𝑦2 = 0
𝟏𝟓𝒚𝟐 − 𝟖𝒚𝟏 = 𝟔 −− −(𝟓)
𝟏 𝟏 𝟐
𝒚𝟎 = , 𝒚𝟏 = , 𝒚𝟐 =
𝟑 𝟐 𝟑
23
Exercises:
1. 𝑦 ′′ − 3𝑦 ′ + 2𝑦 = 1 + 2𝑥, 𝑦 1 = 𝑦 2 = 0, ℎ = 0.25
𝜋 𝜋
2. 𝑦 ′′ + 𝑦 = 0, 𝑦 0 = 0, 𝑦 2
= 1, ℎ =
8
1
3. 𝑦 ′′ + 𝑥𝑦 ′ − 2𝑦 = 0, 𝑦 1 = 𝑦 ′ 1 , 𝑦 2 = 5, ℎ = 2
1
4. 𝑦 ′′ = 𝑥𝑦, 𝑦 0 + 𝑦 ′ 0 = 1, 𝑦 1 = 1, ℎ = 2
24
Partial Differential Equations
Boundary value problems governed by linear second order partial differential equations:
Over a two dimensional Cartesian domain, let 𝑢 be the dependent variable. Then a general second
order partial differential equation may be written as,
𝜕2 𝑢 𝜕2 𝑢 𝜕2 𝑢
𝐴 2 + 𝐵 + 𝐶 2 + 𝐹 𝑥, 𝑦, 𝑢, 𝑢𝑥 , 𝑢𝑦 + 𝐺 = 0 ----------------------(1)
𝜕𝑥 𝜕𝑥𝜕𝑦 𝜕𝑦
where 𝐴, 𝐵, 𝐶 are functions of (𝑥, 𝑦) and 𝐹 may be non-linear function, then equation (1) is called a
quasi-linear partial differential equation. If 𝐹 is also a linear function then equation (1) is called a
linear partial differential equation. If 𝐺 = 0 then equation (1) is homogeneous otherwise non-
homogeneous.
Classification of PDE:
𝜕2 𝑢 𝜕2 𝑢
1. 𝜕𝑥 2
+
𝜕𝑦 2
= 𝑓 𝑥, 𝑦 is called Poisson equation is an elliptic equation
𝜕2 𝑢 𝜕 𝑢 2
2. = 𝑐2 2 , is called wave equation is hyperbolic equation
𝜕𝑡 2 𝜕𝑥
𝜕u 𝜕 u 2
3. = c2 2 , is called heat equation is parabolic equation
𝜕t 𝜕x
𝜕2 𝑢 𝜕2 𝑢 𝜕2 𝑢 𝜕𝑢 𝜕𝑢
4. 𝜕𝑥 2
+ 4
𝜕𝑥𝜕𝑦
+ 4 2
𝜕𝑦
−
𝜕𝑥
+2
𝜕𝑦
= 0, is parabolic equation
2 𝜕2 𝑢 𝜕2 𝑢 𝜕2 𝑢
5. 1 + 𝑥 + 5+ 2𝑥 2 + 4+ 𝑥 2 = 0, is Hyperbolic equation.
𝜕𝑥 2 𝜕𝑥𝜕𝑡 𝜕𝑡 2
Finite Difference Methods for Partial Differential Equation:
Consider a rectangular region 𝑅 in the 𝑋𝑌 −plane. Divide the region into rectangular network
partial derivatives can be derived using Taylor series expansion for 2 variables as follows.
ℎ2
We have, 𝑢 𝑥 + ℎ, 𝑦 = 𝑢𝑖+1,𝑗 = 𝑢 𝑥, 𝑦 + ℎ𝑢𝑥 𝑥, 𝑦 + 𝑢 𝑥, 𝑦 + ⋯ -----------(2)
2! 𝑥𝑥
𝜕𝑢 1
= 𝑢𝑖+1,𝑗 − 𝑢𝑖,𝑗 + 𝑂 ℎ -----------(3)
𝜕𝑥 𝑖,𝑗 ℎ
ℎ2
Similarly, 𝑢 𝑥 − ℎ, 𝑦 = 𝑢𝑖−1,𝑗 = 𝑢 𝑥, 𝑦 − ℎ𝑢𝑥 𝑥, 𝑦 + 𝑢 𝑥, 𝑦 + ⋯ -----------(4)
2! 𝑥𝑥
𝜕𝑢 1
= 𝑢𝑖,𝑗 − 𝑢𝑖−1,𝑗 + 𝑂 ℎ -----------(5)
𝜕𝑥 𝑖,𝑗 ℎ
𝜕𝑢 1
= 𝑢𝑖+1,𝑗 − 𝑢𝑖−1,𝑗 + 𝑂 ℎ2 -----------(6)
𝜕𝑥 𝑖,𝑗 2ℎ
The finite difference approximations for the second order partial derivatives can be obtained by adding
Eq.(2) and (4).
𝜕2 𝑢 1
= 𝑢𝑖+1,𝑗 − 2𝑢𝑖,𝑗 + 𝑢𝑖−1,𝑗 + 𝑂 ℎ2 -----------(7)
𝜕𝑥 2 𝑖,𝑗 ℎ2
Similarly,
𝜕𝑢 1
Forward: = 𝑢𝑖,𝑗+1 − 𝑢𝑖,𝑗 + 𝑂(𝑘) -----------(8)
𝜕𝑦 𝑖,𝑗 𝑘
𝜕𝑢 1
Backward: = 𝑢𝑖,𝑗 − 𝑢𝑖,𝑗−1 + 𝑂 𝑘 -----------(9)
𝜕𝑦 𝑖,𝑗 𝑘
𝜕𝑢 1
Central: = 𝑢𝑖,𝑗+1 − 𝑢𝑖,𝑗−1 + 𝑂 𝑘 2 ----------(10)
𝜕𝑦 𝑖,𝑗 2𝑘
𝜕2 𝑢 1
And = 𝑢𝑖,𝑗+1 − 2𝑢𝑖,𝑗 + 𝑢𝑖,𝑗−1 + 𝑂 𝑘 2 ----------(11)
𝜕𝑦 2 𝑖,𝑗 𝑘2
Replacing the derivatives in any partial differential equation by their corresponding difference
approximation, we obtain the finite-difference analogues of the given equation.
Elliptic partial differential equation:
Most relevant examples of elliptic PDE are Laplace equation and Poisson equation.
𝜕2 𝑢 𝜕2 𝑢
+ = 𝑓 𝑥, 𝑦 or 𝛻 2 𝑢 = 𝑓 𝑥, 𝑦 , 𝑎 ≤ 𝑥 ≤ 𝑏, 𝑐 ≤ 𝑦 ≤ 𝑑
𝜕𝑥 2 𝜕𝑦 2
Consider a rectangular region 𝑅 for which 𝑢(𝑥, 𝑦) is known at the boundary. Divide this region into
a network of square mesh of side ℎ (assuming that an exact division of 𝑅 is possible.
Figure-2. Figure-3.
Replacing the derivatives in (12) by their difference approximations, we have
1 1
𝑢 − 2𝑢𝑖,𝑗 + 𝑢𝑖−1,𝑗 + 2 𝑢𝑖,𝑗+1 − 2𝑢𝑖,𝑗 + 𝑢𝑖,𝑗−1 = 0
ℎ2 𝑖+1,𝑗 ℎ
1
Or 𝑢𝑖,𝑗 = 𝑢𝑖+1,𝑗 + 𝑢𝑖−1,𝑗 + 𝑢𝑖,𝑗+1 + 𝑢𝑖,𝑗−1 ----------(13)
4
This shows that the value of 𝑢 at any interior mesh point is the average of its values at four
neighboring points to the left, right, above and below. Equation (13) is called standard 5-point
formula as shown in figure-2.
Sometimes a formula similar to this is used which is given by,
1
𝑢𝑖,𝑗 = (𝑢𝑖−1,𝑗+1 + 𝑢𝑖+1,𝑗−1 + 𝑢𝑖+1,𝑗+1 + 𝑢𝑖−1,𝑗−1 ) ----------(14)
4
Which shows that the value of 𝑢 at any interior mesh point is the average of its values at four
neighboring diagonal mesh points. Equation (14) is also called the diagonal 5-point formula as
shown in figure-3. Although this is less accurate than the standard 5-point formula, it is used in
getting a good approximation for the starting values at the mesh points.
By applying 5-point formula at each interior mesh point, we arrive at linear equations in the nodal
values 𝑢𝑖,𝑗 . These equations can be solved by Jacobi’s iterative method or Gauss-Seidal iterative
method. The iterative methods are repeated till the difference between two consecutive iterates become
negligible.
𝑛
1. Jacobi’s method: Denoting the 𝑛𝑡ℎ iterative value of 𝑢𝑖,𝑗 by 𝑢𝑖,𝑗 , the iterative formula to solve is,
(𝑛+1) 1 (𝑛) (𝑛) (𝑛) (𝑛)
𝑢𝑖,𝑗 = 𝑢𝑖+1,𝑗 + 𝑢𝑖−1,𝑗 + 𝑢𝑖,𝑗+1 + 𝑢𝑖,𝑗−1 ----------(15)
4
1. Gauss-Seidal method or Leibmann’s method: In this method, the iteration formula is,
(𝑛+1) 1 (𝑛) (𝑛+1) (𝑛+1) (𝑛)
𝑢𝑖,𝑗 = 𝑢𝑖+1,𝑗 + 𝑢𝑖−1,𝑗 + 𝑢𝑖,𝑗+1 + 𝑢𝑖,𝑗−1 ----------(16)
4
This utilizes the latest iterative values available and evaluates the mesh points symmetrically from
left to right along successive rows.
Note:
The accuracy of the calculations depends on the mesh-size i.e. smaller the 𝒉, better the
The error in solving Laplace and Poisson’s equations by finite-difference method is of the
order 𝒐 𝒉𝟐 .
Solved examples:
𝝏𝟐 𝒖 𝝏𝟐 𝒖 𝟏
1. Solve + 𝟐 = 𝟎, with 𝒉 = , 𝒖 𝒙, 𝟏 = 𝒖 𝟎, 𝒚 = 𝟎, 𝟎 < 𝒙, 𝒚 < 𝟏 and also 𝒖 𝒙, 𝟎 = 𝟗 𝒙 − 𝒙𝟐 ,
𝝏𝒙𝟐 𝝏𝒚 𝟑
𝒖 𝟏, 𝒚 = 𝟗 𝒚 − 𝒚𝟐 .
4𝑎 = 𝑏 + 𝑑 + 2
4𝑏 = 2𝑎 + 4
4𝑑 = 2𝑎
𝑎 = 𝑐 = 1; 𝑏 = 1.5; 𝑑 = 0.5
𝝏𝟐 𝒖 𝝏𝟐 𝒖 𝟏
2. Solve + 𝟐 = 𝟎, with 𝒉 = , 𝒖 𝒙, 𝟎 = 𝒖 𝒙, 𝟏 = 𝟎, 𝟎 < 𝒙, 𝒚 < 𝟏 and also 𝒖 𝟎, 𝒚 =
𝝏𝒙𝟐 𝝏𝒚 𝟒
𝟏
1. Solve Laplace equation 𝛁𝟐 𝒖 = 𝟎, 𝟎 < 𝒙, 𝒚 < 𝟐, with 𝒉 = , 𝒖 𝒙, 𝟎 = 𝟎, 𝒖 𝒙, 𝟐 = 𝟔,
𝟐
𝒖 𝟎, 𝒚 = 𝟏, 𝒖 𝟐, 𝒚 = 𝟏.
𝟏
2. Solve 𝛁𝟐 𝒖 = 𝟎, 𝒙 < 𝟏, 𝒚 < 𝟏, 𝒉 = . Also, 𝒖 ±𝟏, 𝒚 = 𝒚𝟐 , 𝒖 𝒙, ±𝟏 = 𝒙𝟐 .
𝟐
y 0 1/3 2/3 1
• Exercise problems:
1) Solve 𝛻 2 𝑢 = −1, 𝑥 < 2, 𝑦 < 2, ℎ = 1.
Also, 𝑢 −2, 𝑦 = 𝑢 𝑥, 2 =𝑢 2, 𝑦 = 𝑢 𝑥, −2 = 0.
2) Solve 𝛻 2 𝑢 = −1, 𝑥 < 2, 𝑦 < 2, ℎ = 1.
Also, 𝑢 −2, 𝑦 = 𝑢 𝑥, 2 =𝑢 2, 𝑦 = 𝑢 𝑥, −2 = 0.
1
3) Solve 𝛻2𝑢 = −1, 𝑥 < 1, 𝑦 < 1, ℎ = . Also, 𝑢 ±1, 𝑦 = 𝑢 𝑥, ±1 = 0.
2
Wave Equation
46
Numerical Solution of Wave Equation
Consider the initial value problem
𝜕2 𝑢 2 𝜕2 𝑢
=𝑐 , a < x < b, t > 0 --------- (1)
𝜕𝑡 2 𝜕𝑡 2
𝑢
u(x , 0) = f(x), 𝑥, 0 = 𝑔 𝑥 −−−−−−− −(2)
𝑡
ut(a,t) = (x), u(b, t) = (x) -------- (3)
2 𝑢 𝑢𝑖𝑗+1−2𝑢𝑖𝑗 +𝑢𝑖𝑗−1
= ----------------------(7)
𝑡 2 𝑘2
48
Using (6) and (7) in (1), we get,
49
From the initial conditions (2)
1
𝑢𝑖0 = 𝑓𝑖 , 𝑢𝑖1 = 𝑓𝑖−1 + 𝑓𝑖+1 + 𝑘𝑔𝑖
2
𝑢0𝑗 = 𝜑𝑗 , 𝑢𝑛𝑗 = 𝑗
50
Evaluate the pivotal values of the equation utt=16uxx, taking h =1 upto
t = 1.25. The boundary and initial conditions are
u(0, t)=u(5, t) = 0, u(x, 0)=x2(5-x), ut(x,0)=0.
Here c2= 16, h=1. We choose k = h/c=1/4
Finite difference scheme is
𝑢𝑖𝑗+1 =𝑢𝑖+1𝑗 + 𝑢𝑖−1𝑗 − 𝑢𝑖𝑗−1
51
52