Solving the Finite Element Method Matrix with Rao - Engineering

Chacabucogod
Messages
56
Reaction score
0
I was reading the finite element method in engineering by Rao and in the first example he ends up with a matrix that is singular.

The matrix is the following:

<br /> \begin{pmatrix}<br /> 2 &amp;-2 &amp; 0\\<br /> -2 &amp; 3&amp;-1\\<br /> 0&amp;-1&amp; 1<br /> \end{pmatrix}<br />

Which is a symmetric matrix as far as I can remember. Now you have 3 Nodes that will be the vector that will multiply this matrix the first node you already know is zero
so:

<br /> \begin{pmatrix}<br /> 0\\<br /> f1\\<br /> f2<br /> \end{pmatrix}<br />

The solution vector is

<br /> \begin{pmatrix}<br /> P1\\<br /> 0\\<br /> 1<br /> \end{pmatrix}<br />

Now he says that you can eliminate row 1 and column 1, but if you multiply the matrix by the first element of the vector only column one disappears. I tried solving this with the transpose method, but it seems there's no way to solve this matrix. Since there are only 2 unknowns can I completely forget ably the 3*3 matrix and do a 2*2 or do I have to take into account the third equation (the one that comes out of row 1)

Thank you
 
Physics news on Phys.org
Chacabucogod said:
The solution vector is

<br /> \begin{pmatrix}<br /> P1\\<br /> 0\\<br /> 1<br /> \end{pmatrix}<br />

You haven't stated a mathematical problem, so it isn't clear what you mean by "the solution".

I suggest you describe the problem completely or at least give a link to the passage in the book if Google books has the text.
 
I not familiar with this particular book and I'm not sure where the book ends and where your interpretation begins.
But something is wrong.

That being said, in FE methods we often have an algebraic system of the form:

A\vec x = \vec b

For a simple system with 3 degrees of freedom we can write
<br /> A=\begin{pmatrix}<br /> a_{11} &amp; a_{12} &amp; a_{13}\\<br /> a_{21} &amp; a_{22} &amp; a_{23}\\<br /> a_{31}&amp;a_{32}&amp; a_{33}<br /> \end{pmatrix}<br />,

<br /> \vec x=\begin{pmatrix}<br /> x_1\\<br /> x_2\\<br /> x_3<br /> \end{pmatrix}<br />

and
<br /> \vec b=\begin{pmatrix}<br /> b_1\\<br /> b_2\\<br /> b_3<br /> \end{pmatrix}<br />

Now if we want to insert a Dirichlet boundary condition we have to modify the matrix A and the vector b, but the vector x is unchanged. (This is our unknown that we are solving for.) For instance if we want the displacement at x_1=2 then the matrix becomes


<br /> A=\begin{pmatrix}<br /> 1 &amp; 0 &amp; 0\\<br /> a_{21} &amp; a_{22} &amp; a_{23}\\<br /> a_{31}&amp;a_{32}&amp; a_{33}<br /> \end{pmatrix}<br />

and the RHS vector becomes
<br /> \vec b=\begin{pmatrix}<br /> 2\\<br /> b_2\\<br /> b_3<br /> \end{pmatrix}<br />.

Note that if you multiple the first row of A with x you get the equation x_1=2.

Since we know x_1 we can use this information to simplify the equation. In this case we'd get a simplier 2x2 system with


<br /> A=\begin{pmatrix}<br /> a_{22} &amp; a_{23}\\<br /> a_{32}&amp; a_{33}<br /> \end{pmatrix}<br />,

<br /> \vec x=\begin{pmatrix}<br /> x_2\\<br /> x_3<br /> \end{pmatrix}<br />

and
<br /> \vec b=\begin{pmatrix}<br /> b_2-2a_{21}\\<br /> b_3-2a_{31}<br /> \end{pmatrix}<br />.
 
  • Like
Likes 1 person
Thank you. I guess That is what I was looking for
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
7
Views
3K
Replies
2
Views
3K
Replies
5
Views
2K
Replies
15
Views
2K
Replies
9
Views
3K
Replies
34
Views
2K
Back
Top