Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fast hanging-node algorithm for FE_Q_iso_Q1 #14385

Merged
merged 1 commit into from Nov 3, 2022

Conversation

peterrum
Copy link
Member

@peterrum peterrum commented Nov 1, 2022

... one could even skip loading some DoFs and make the inplace interpolations smaller. But not sure if that is worth the effort.

FYI @vovannikov @mschreter

Copy link
Member

@kronbichler kronbichler left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I am not super happy that we need to integrate so many cases and if statements into the compute functions, but right now we cannot really avoid it. This is something to keep in mind when we work on #9544.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants