Application solves the 3D Poisson Equation for n input sets of N x N x N size, where N has to be power of 2 and at least 32. For solving the equation we use FFT method. N is configured at build time, but n can be given in runtime as a command line argument. Input can be read from file or randomly generated. If user chooses so, all output and output convenient for plotting can be generated. The App runs both the DFE and the CPU implementation and compares respective times taken.
markostojanovic087/poisson-fft-maxjava
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published