2 - Weighted Residual Methods - Annotated Notes 2021
2 - Weighted Residual Methods - Annotated Notes 2021
Before introducing the weighted residual method, let us consider a 2nd order differential equation
(DE) such as the governing equation for an axial bar problem.
𝑑𝑑𝑑𝑑
𝑑𝑑𝑑𝑑
𝑥𝑥
Define u as the displacement at any point x along the bar. To arrive at a DE in terms of u, we do
the following.
𝑑𝑑𝑑𝑑
𝜎𝜎 = 𝐸𝐸𝐸𝐸, and 𝜀𝜀 =
𝑑𝑑𝑑𝑑
𝑑𝑑𝑑𝑑
∴ 𝜎𝜎 = 𝐸𝐸
𝑑𝑑𝑑𝑑
𝑑𝑑𝑑𝑑
−𝑑𝑑 �𝐸𝐸𝐸𝐸 �
∴ 𝑑𝑑𝑑𝑑 = 𝑓𝑓(𝑥𝑥) 0≤
��
���
𝑥𝑥 ≤
��𝐿𝐿
𝑑𝑑𝑑𝑑 Domain of the bar
Boundary conditions:
@ x = 0, u = 0
→ Essential, or Kinematic or Forced or Dirichlet BC (since it relates to the basic variable u)
𝑑𝑑𝑑𝑑
@ x = L, σ = 0 (stress free), 𝐸𝐸 𝑑𝑑𝑑𝑑 = 0
→ Natural or Force or Neumann BC (since it relates to the derivative of the basic variable u)
Note: This 2nd order DE is applicable only to continuous systems (both geometry and force being
continuous)
[9]
The following tables present different examples of physical phenomena described by differential
equations.
[10]
Generalized for higher dimensions, the same format of DE is recognized as the Poisson’s
equation
[11]
2.2 WEIGHTED RESIDUAL METHODS
The Weighted Residual Methods (WRM) are meant to find an approximate solution to a
differential equation (DE). To present the methods, let us consider a Second Order DE and its
Boundary Conditions (BC)
𝑑𝑑 𝑑𝑑𝑑𝑑
DE ⇒ �𝑥𝑥 2 � = 6𝑥𝑥; 1 ≤ 𝑥𝑥 ≤ 2
𝑑𝑑𝑑𝑑 𝑑𝑑𝑑𝑑
BC ⇒ 𝑦𝑦(1) = 0, 𝑦𝑦(2) = 0
To solve this problem approximately, we can use any one of the WRM:
1. Collocation Method
2. Sub-domain Method
3. Least Squares Method
4. Galerkin Method (mostly used in FEM)
since it is not the exact solution. Therefore, we will end up with a residual function,
𝑑𝑑
𝑅𝑅 = 𝑥𝑥 2 𝑦𝑦𝑛𝑛″ + 2𝑥𝑥𝑦𝑦𝑛𝑛′ − 6𝑥𝑥 ≠ 0 where ( )′ = ( )
𝑑𝑑𝑑𝑑
[12]
2.2.1 COLLOCATION METHOD
In collocation method, we make R = 0 at some pre-selected points in order to find the value of
the unknown coefficients ci.
One term solution:
𝑦𝑦1 = 𝑐𝑐1 𝜑𝜑1
= 𝑐𝑐1 (𝑥𝑥 − 1)(𝑥𝑥 − 2)
′
𝑦𝑦1 = 𝑐𝑐1 (𝑥𝑥 − 2) + 𝑐𝑐1 (𝑥𝑥 − 1),
𝑦𝑦1″ = 𝑐𝑐1 + 𝑐𝑐1
= 2𝑐𝑐1
∴ 𝑅𝑅1 = 𝑥𝑥 2 𝑦𝑦1″ + 2𝑥𝑥𝑦𝑦1′ − 6𝑥𝑥
= 2𝑐𝑐1 𝑥𝑥 2 + 2𝑥𝑥𝑐𝑐1 (2𝑥𝑥 − 3) − 6𝑥𝑥
= 6𝑐𝑐1 𝑥𝑥 2 − 6𝑥𝑥(𝑐𝑐1 + 1)
Let’s make R1 = 0 @ x = 1.5 (mid-point)
𝑐𝑐1 (1.5)2 − 1.5(𝑐𝑐1 + 1) = 0
0.75𝑐𝑐1 = 1.5
𝑐𝑐1 = 2
∴ 𝑦𝑦1 = 2(𝑥𝑥 − 1)(𝑥𝑥 − 2)
Note: The fact that the approximate and exact solution coincide at the mid-point (x = 1.5) is
purely a coincidence. If our residual was defined as the difference between the exact and
approximate solution (i.e. if=R yexact − y1 ) then we would have expected to get the answers to
coincide by forcing R to vanish at the mid-point. However, our residual is not defined this way
rather it stems from the lack of satisfaction of the differential equation. They are not the same
things!
Two terms solution:
𝑦𝑦2 = 𝑐𝑐1 𝜑𝜑1 + 𝑐𝑐2 𝜑𝜑2
= 𝑐𝑐1 (𝑥𝑥 − 1)(𝑥𝑥 − 2) + 𝑐𝑐2 𝑥𝑥(𝑥𝑥 − 1)(𝑥𝑥 − 2)
= (𝑥𝑥 − 1)(𝑥𝑥 − 2)(𝑐𝑐1 + 𝑐𝑐2 𝑥𝑥)
𝑦𝑦2′ = (𝑥𝑥 − 2)(𝑐𝑐1 + 𝑐𝑐2 𝑥𝑥) + (𝑥𝑥 − 1)(𝑐𝑐1 + 𝑐𝑐2 𝑥𝑥) + 𝑐𝑐2 (𝑥𝑥 − 1)(𝑥𝑥 − 2)
𝑦𝑦2″ = (𝑐𝑐1 + 𝑐𝑐2 𝑥𝑥) + 𝑐𝑐2 (𝑥𝑥 − 2) + �𝑐𝑐1 + 𝑐𝑐2 𝑥𝑥 + 𝑐𝑐2 (𝑥𝑥 − 1) + 𝑐𝑐2 (𝑥𝑥 − 1) + 𝑐𝑐2 (𝑥𝑥 − 2)�
= 2(𝑐𝑐2 (𝑥𝑥 − 1) + 𝑐𝑐2 (𝑥𝑥 − 2) + 𝑐𝑐1 + 𝑐𝑐2 𝑥𝑥)
= 2𝑐𝑐1 + 6𝑐𝑐2 𝑥𝑥 − 6𝑐𝑐2
∴ 𝑅𝑅2 = 𝑥𝑥 2 𝑦𝑦2″ + 2𝑥𝑥𝑦𝑦2′ − 6𝑥𝑥
[13]
= −2𝑥𝑥(3𝑐𝑐1 − 2𝑐𝑐2 − 3𝑐𝑐1 𝑥𝑥 + 9𝑐𝑐2 𝑥𝑥 − 6𝑐𝑐2 𝑥𝑥 2 + 3)
set R2 =0 @ 2 points to find out the two unknowns c1 and c2.
For example, let R2 = 0 @ x = 1.333 and 1.666 (i.e. 1/3rd points).
𝑥𝑥2
� 𝑅𝑅𝑅𝑅𝑅𝑅 = 0
𝑥𝑥1
1.5 2
∴ � 𝑅𝑅2 𝑑𝑑𝑑𝑑 = 0 → , � 𝑅𝑅2 𝑑𝑑𝑑𝑑 = 0 →
1 1.5
[14]
2.2.3 LEAST SQUARES METHOD
In this method form the integral of the square of the residual over the entire domain and then
minimize it w.r.t. the coefficients (i.e. ci)
𝑅𝑅𝑛𝑛 = 𝑥𝑥 2 𝑦𝑦𝑛𝑛″ + 2𝑥𝑥𝑦𝑦𝑛𝑛′ − 6𝑥𝑥
2
∂𝑅𝑅𝑛𝑛
� 𝑅𝑅𝑛𝑛2 𝑑𝑑𝑑𝑑 = 𝑓𝑓(𝑐𝑐1 , 𝑐𝑐2 , 𝑐𝑐3… ) �⎯� � 𝑅𝑅𝑛𝑛 𝑑𝑑𝑑𝑑 = 0
1 ∂𝑐𝑐𝑖𝑖
∂𝑓𝑓
= 0 for 𝑖𝑖 = 1, … , 𝑛𝑛
∂𝑐𝑐𝑖𝑖
2
∂� 2
∂𝑐𝑐2 �� 𝑅𝑅2 𝑑𝑑𝑑𝑑� = 0
1
2
∂𝑅𝑅2
� 𝑅𝑅2 =0→
1 ∂𝑐𝑐2
Note: the matrix is symmetric ⇒ the advantage is that this reduces the capacity needed to store
the data.
[15]
2.2.4 GALERKIN METHOD
In this method,
� 𝑅𝑅𝜑𝜑𝑖𝑖 𝑑𝑑Ω = 0; 𝑖𝑖 = 1, … , 𝑛𝑛
Ω
Ω = domain
[16]