Positivity, Monotonicity, And Convexity For Convolution Operators

We consider the convolution inequality a∗u≥v for given functions a and v, and we then investigate conditions on a and v that force the unknown function u to be positive or monotone or convex. We demonstrate that these results for abstract convolution equations can be specialized to yield new insights into the qualitative properties of fractional difference and differential operators. Finally, we apply our results to finite difference methods for fractional differential equations, and we show that our results yield insights into the qualitative behavior of these types of numerical approximations.