Fast Stencil Computations using Fast Fourier Transforms
2021
Stencil computations are widely used to simulate the change of state of physical systems across a multidimensional grid over multiple timesteps. The state-of-the-art techniques in this area fall into three groups: cache-aware tiled looping algorithms, cache-oblivious divide-and-conquer trapezoidal algorithms, and Krylov subspace methods.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
94
References
0
Citations
NaN
KQI