May 2, 2007 · Here we discuss the efficient performance of the convolution in locally refined grids. More precisely, the convolution result is projected into ...

May 2, 2007 · 2. The standard tool for convolutions is the Fast Fourier Transform (FFT), however, this applies only for data in a uniform grid.

The efficient performance of the convolution in locally refined grids is discussed, where the result is projected into some given locally refined grid ...

Here we discuss the efficient performance of the convolution in locally refined grids. More precisely, f and g are assumed to be piecewise linear and the ...

Feb 25, 2019 · Hackbusch, Wolfgang (2007) Fast and exact projected convolution for non-equidistant grids. Computing, 80 . pp. 137-168.

Here we discuss the efficient performance of the convolution in locally refined grids. More precisely, the convolution result is projected into some given ...

More precisely, the convolution result is projected into some given locally refined grid. Under certain conditions, the overall costs are still O ( N log ⁡ N ) ...

Fast and Exact Projected Convolution for Non-equidistant Grids - Extended Version · Mathematics, Computer Science · 2006.

In this paper, we propose an approach to the computation of more accurate divided differences for the interpolation in the Newton form of the matrix exponential ...

Here we discuss the efficient performance of the convolution in locally refined grids. More precisely, f and g are assumed to be piecewise linear and the ...