LagrangeInterpolationAdaptiveFMM.cpp 1017 Bytes
Newer Older
1 2 3 4
// ==== CMAKE =====
// @FUSE_FFT
// @FUSE_BLAS
//  ==== Git =====
5
//
6 7
// ================

8
/** \brief equispaced point (Uniform or Lagrange) Adaptive FMM example
9 10
 *
 * \file
11
 * \authors  O. Coulaud
12
 *
13
 * This program runs the Adaptive FMM Algorithm with the interpolation kernel based on
14 15 16 17 18 19
 * uniform (grid points) interpolation (1/r kernel). It then compares the
 * results with a direct computation.
 */

#include <string>
#include "Kernels/Uniform/FUnifCell.hpp"
20
#include "Adaptive/FAdaptUnifKernel.hpp"
21
//
22 23
template<typename FReal, int ORDER>
using FInterpolationCell =  FUnifCell<FReal, ORDER>;
24

25 26 27 28 29 30 31 32
template<typename FReal, typename GroupCellClass,
	 typename GroupContainerClass,
	 typename MatrixKernelClass, int ORDER>
using FInterpolationAdaptiveKernel = FAdaptUnifKernel<FReal,
					    GroupCellClass,
					    GroupContainerClass,
					    MatrixKernelClass,
					    ORDER> ;
33

34
const std::string interpolationType("Lagrange equispaced points interpolation");
35

36
#include "sharedMemoryInterpolationAdaptiveFMM.hpp"