Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal-order isogeometric collocation at Galerkin superconvergent points (1609.01971v2)

Published 7 Sep 2016 in math.NA

Abstract: In this paper we investigate numerically the order of convergence of an isogeometric collocation method that builds upon the least-squares collocation method presented in [1] and the variational collocation method presented in [2]. The focus is on smoothest B-splines/NURBS approximations, i.e, having global $C{p-1}$ continuity for polynomial degree $p$. Within the framework of [2], we select as collocation points a subset of those considered in [1], which are related to the Galerkin superconvergence theory. With our choice, that features local symmetry of the collocation stencil, we improve the convergence behaviour with respect to [2], achieving optimal $L2$-convergence for odd degree B-splines/NURBS approximations. The same optimal order of convergence is seen in [1], where, however a least-squares formulation is adopted. Further careful study is needed, since the robustness of the method and its mathematical foundation are still unclear.

Summary

We haven't generated a summary for this paper yet.