Adaptive isogeometric methods with hierarchical splines: Optimality and convergence rates

We consider an adaptive isogeometric method (AIGM) based on (truncated) hierarchical B-splines and continue the study of its numerical properties. We prove that our AIGM is optimal in the sense that delivers optimal convergence rates as soon as the solution of the underlying partial differential equation belongs to a suitable approximation class. The main tool we use is the theory of adaptive methods, together with a local upper bound for the residual error indicators based on suitable properties of a well selected quasi-interpolation operator on hierarchical spline spaces