Replies: 3 comments 1 reply
|
I will have to look into it. It did not directly click just reading the text will need to look into the paper and look at the equations. |
1 reply
|
Now, you also have my attention ;) I would like to try this and possibly use it for FSI. This also means that cpp implementation would make my life easier, but I see that it'd be much easier to implement this in python |
0 replies
|
@clemens-fricke as of #293, this is available in splinepy. Could you extend FFD with this feature? |
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
While desperately searching the web for good explanations on adjoints I found this gem on the internet:
(page 19) based on a citation found in
I think using this metric as a way to check tangled meshes is very cheap in comparison to classical checks on meshes.
The basic idea consists of determining a spline that describes the determinant of a problem. If the Jacobian determinant is strictly positive, then there cannot be any overlapping domains within the spline (which is a sufficient condition). The determinant spline can be calculated by sampling and solving a linear system - and for multiple iterations this can be done just once as the inverse matrix can be stored as a function of the control points, so this is actually very cheap, just one matrix multiplication. I think that's a pretty solution and should be integrated into our FFD framework.
@clemens-fricke can I pressure you into volunteering?
All reactions