I hope this is the correct forum to post this question because I did not find one that really suits this question.
Basically I was reading this paper: 2D Triangular Elements
I like to implement things myself in Java and I did implement the formulas described in the paper. The result looks good (almost).
The first thing was creating a grid which looks like this (ignore the red dot):
And after solving it using the conjugate gradient method with $\text{res}=10^{-14}$ and after about $5500$ iterations, I get this result:
This looks alright and from an engineering point of view reasonable but if I zoom in, you can see this result:
There seems to be some kind of checkerboard pattern. The overall solution seems reasonable but the local solution seems wrong. Especially because elements with a different orientation seem to have a slightly different result.
You might argue that my implementation is wrong but I verified this many many times. Also at the end of the paper is an example with actual numbers which are also returned from my program when I input the grid from the paper.
My question now is:
Is this checkerboard pattern something that occures in FEA or should the result look "smooth"? The paper uses linear elements. Could this be the cause?
I am very happy for any help and/or advice!
Greetings Finn



Yeah sure. 1 second
– Finn Eggers Jan 14 '20 at 20:01The problem also occurs here
– Finn Eggers Jan 14 '20 at 20:03