Force stencil #41
Merged
Force stencil #41
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This branch compares several implementation of the Laplace operator, to understand what is the optimal way to implement time and memory efficient forces in Julia.
The test uses the Gray-Scott model on grid of different sizes to compare the performances of different class of algorithms:
Old_Laplaceis our current implementation that involves reshaping*_c*algorithm that usecircshiftstenciluses matrix multiplications for the finite differencesconvuses the convolution with a kernel*Lux*use Lux framework to perform the convolution as a NNThis is an overview of my results
Overall
circhiftorLuxseems to perform the best. Before drawing a final conclusion I think it is worth to test the results using GPU