Compact radial basis functions and generic polynomial basis / Utility for moving least squares

[mrlag31]

Follow-up of #946 and #950. This PR adds the set of radial basis functions that were present on DTK, a generic way of building a polynomial basis and tests for both of them.

• Adds ArborX::Interpolation::CRBF, a namespace containing the compact radial basis functions Wendland, Wu and Buhmann.

[masterleinad]

What is this used for?

Suggested change

	template <std::size_t Deg>
	struct PolynomialDegree : std::integral_constant<std::size_t, Deg>
	{};
	} // namespace Details
	template <std::size_t Deg>
	static constexpr Details::PolynomialDegree<Deg> PolynomialDegree{};

[mrlag31]

It is used as a tag so that it can be used as a function argument and help with templates. For example: MovingLeastSquares<MemorySpace, double>(source, target, CRBF::Wendland<2>, PolynomialDegree<2>)

[masterleinad]

Looks OK to me.

[mrlag31]

SYCL and HIP did not run due to the 3h timeout. Others are fine.

[aprokop]

This introduces a new dependency on boost::math, I think. According to this, it only has optional compiled binary, but can be used header only. So I think we don't need to update CMake's boost REQUIRED_COMPONENTS.