Nonlinear finite elements/Axial bar approximate solution

From testwiki
Revision as of 01:07, 26 July 2017 by imported>Dave Braunschweig (Subpage navbar)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)
Jump to navigation Jump to search

Approximate Solution: The Galerkin Approach

To find the finite element solution, we can either start with the strong form and derive the weak form, or we can start with a weak form derived from a variational principle.

Let us assume that the approximate solution is ๐ฎh(๐ฑ) and plug it into the ODE. We get

AEd2๐ฎhdx2+a๐ฑ=Rh(๐ฑ)

where Rh is the residual. We now try to minimize the residual in a weighted average sense

0LRh(๐ฑ)๐ฐ(๐ฑ)dx=0

where ๐ฐ(๐ฑ) is a weighting function. Notice that this equation is similar to equation (5) (see 'Weak form: integral equation') with ๐ฐ in place of the variation δ๐ฎ. For the two equations to be equivalent, the weighting function must also be such that ๐ฐ(0)=0.

Therefore the approximate weak form can be written as

0LAEd๐ฎhdxd๐ฐdxdx=0L๐ช๐ฐdx+๐‘น๐ฐ|x=L.

In Galerkin's method we assume that the approximate solution can be expressed as

๐ฎh(๐ฑ)=a1φ1(๐ฑ)+a2φ2(๐ฑ)++anφn(๐ฑ)=i=1naiφi(๐ฑ).

In the Bubnov-Galerkin method, the weighting function is chosen to be of the same form as the approximate solution (but with arbitrary coefficients),

๐ฐ(๐ฑ)=b1φ1(๐ฑ)+b2φ2(๐ฑ)++bnφn(๐ฑ)=j=1nbjφj(๐ฑ).

If we plug the approximate solution and the weighting functions into the approximate weak form, we get

0LAE(i=1naidφidx)(j=1nbjdφjdx)dx=0L๐ช(j=1nbjφj)dx+๐‘น(j=1nbjφj)|x=L.

This equation can be rewritten as

j=1nbj[0LAE(i=1naidφidxdφjdx)dx]=j=1nbj[0L๐ชφjdx+(๐‘นφj)|x=L].

From the above, since bj is arbitrary, we have

0LAE(i=1naidφidxdφjdx)dx=0L๐ชφjdx+๐‘นφj|x=L,j=1n.

After reorganizing, we get

i=1n[0LdφjdxAEdφidxdx]ai=0Lφj๐ชdx+φj๐‘น|x=L,j=1n

which is a system of n equations that can be solved for the unknown coefficients ai. Once we know the ais, we can use them to compute approximate solution. The above equation can be written in matrix form as

๐Š๐š=๐ŸKjiai=fj

where

๐Š=0L๐T๐ƒ๐dxKji=0LdφjdxAEdφidxdx

and

fj=0Lφj๐ชdx+φj๐‘น|x=L.

The problem with the general form of the Galerkin method is that the functions φi are difficult to determine for complex domains.

Template:Subpage navbar