Nonlinear finite elements/Solution of Poisson equation

From testwiki
Jump to navigation Jump to search

Construction of Approximate Solutions

If we know that the problem is well-posed but does not have a closed form solution, we can go ahead and try to get an approximate solution. The finite element method is one way of getting at approximate solutions (among many other numerical methods).

The finite element method starts off with the variational form (or the weak form) of the BVP. The method is a special case of a class of methods called Galerkin methods.

Finite element solution for the Poisson equation

Recall the variational boundary value problem for the Poisson equation:

π–΅π–Ίπ—‹π—‚π–Ίπ—π—‚π—ˆπ—‡π–Ίπ—…π–‘π–΅π–―π–Ώπ—ˆπ—‹π–―π—ˆπ—‚π—Œπ—Œπ—ˆπ—‡π—Œπ–€π—Šπ—Žπ–Ίπ—π—‚π—ˆπ—‡Find a functionTin𝒳that satisfiesΩTvdV=ΩfvdVfor allv𝒳𝒳={Continuously differentiable functions onΩΒ―that vanish onΓT}

The space 𝒳 is continuous and an infinite number of functions could be chosen from this space of functions. In the finite element method, we choose a trial function from the space of approximate solutions 𝒳h where 𝒳h𝒳. A defining feature of these approximate trial solutions is that they are associated with a mesh or discretization of the domain Ω. These functions also have the feature that they are finite dimensional with each dimension being associated with a node on the mesh.

Assume that we are given 𝒳h. Let us choose a weighting function vh𝒳h that satisfies vh=0 on ΓT. We can choose another function Th𝒳h as our trial solution. Since the boundary condition on ΓT is T=0, both vh and Th can have the same form. In the next section, we will look at the general form of the heat equation where T0 on the boundary.

In finite element methods we choose trial solutions Th of the form

Th(𝐱)=T1N1(𝐱)+T2N2(𝐱)++TnNn(𝐱)=i=1nTiNi(𝐱).

where T1, T2, , Tn are nodal temperatures which are constant on ΩΒ―. The functions N1,N2,,Nn form a basis that spans the subspace 𝒳h and are known as basis functions or shape functions. Note that n is the total number of nodes minus the number of nodes on ΓT where T is specified.

Since the functions vh come from the same space of functions, we can represent them as

vh(𝐱)=b1N1(𝐱)+b2N2(𝐱)++bnNn(𝐱)=i=1nbiNi(𝐱).

where b1, b2, , bn are arbitrary constant on ΩΒ― with the restriction that vh=0 on ΓT.

If we plug in these finite dimensional forms of v and T into the variational BVP, we get an approximate form of the variational BVP which can be stated as:

π–₯π—‚π—‡π—‚π—π–Ύπ–€π—…π–Ύπ—†π–Ύπ—‡π—π–΅π–Ίπ—‹π—‚π–Ίπ—π—‚π—ˆπ—‡π–Ίπ—…π–‘π–΅π–―π–Ώπ—ˆπ—‹π–―π—ˆπ—‚π—Œπ—Œπ—ˆπ—‡π—Œπ–€π—Šπ—Žπ–Ίπ—π—‚π—ˆπ—‡Find a functionThin𝒳hthat satisfiesΩThvhdV=ΩfvhdVfor allvh𝒳h.

After substituting the expressions for vh and Th in the variational BVP we get

0=ΩThvhdVΩfvhdV=Ω(T1N1++TnNn)(b1N1++bnNn)dVΩf(b1N1++bnNn)dV=Ω(T1N1++TnNn)(b1N1++bnNn)dVΩf(b1N1++bnNn)dV=i,j=1nKijTibjj=1nfjbj=j=1nbj[i=1nKijTifj]

where,

Kij=ΩNiNjdVandfj=ΩfNjdV.

In matrix form, we have

(38)𝐛T[πŠπ“πŸ]=𝟎

where 𝐛T=[b1,b2,,bn], 𝐊 is a n×n symmetric matrix, 𝐓=[T1,T2,,Tn] is a n×1 vector, and 𝐟 is a n×1 vector.

Since 𝐛 can be arbitrary, equation (38) can be further simplified to the form

(39)πŠπ“=𝐟

This system of equations has a solution since 𝐊 is positive-definite and therefore has an inverse. Once the Tis are known, the approximate solution can be found using

Th(𝐱)=T1N1(𝐱)+T1N2(𝐱)++TnNn(𝐱).

The functions N1,,Nn have special forms in the finite element method that have the property that the quality of the approximation improves with an increase in the dimension n of the basis.

Template:Subpage navbar