We propose a monotone multigrid method based on a B–spline basis of arbitrary smoothness for the efficient numerical solution of elliptic variational inequalities on closed convex sets. In order to maintain monotonicity (upper bound) and quasi–optimality (lower bound) of the coarse grid corrections, we propose coarse grid approximations of the obstacle function which are based on B–spline expan...

We propose a monotone multigrid method based on a B–spline basis of arbitrary smoothness for the efficient numerical solution of elliptic variational inequalities on closed convex sets. In order to maintain monotonicity (upper bound) and quasi–optimality (lower bound) of the coarse grid corrections, we propose coarse grid approximations of the obstacle function which are based on B–spline expan...

We discuss the construction of C 2 cubic spline quasi-interpolation schemes defined on a refined partition. These are reduced in terms degrees freedom compared to those existing literature. Namely, we provide rule for reducing them by imposing super-smoothing conditions while preserving full smoothness and precision. In addition, subdivision rules means blossoming. The derived designed express ...