Isogeometric Collocation: Cost Comparison with Galerkin Methods and Extension to Adaptive Hierarchical NURBS Discretizations (Preprint)
TEXAS UNIV AT AUSTIN INST FOR COMPUTATIONAL ENGINEERING AND SCIENCES
Pagination or Media Count:
We compare isogeometric collocation with isogeometric Galerkin and standard C0 finite element methods with respect to the cost of forming the matrix and residual vector, the cost of direct and iterative solvers, the accuracy versus degrees of freedom and the accuracy versus computing time. On this basis, we show that isogeometric collocation has the potential to increase the computational efficiency of isogeometric analysis and to outperform both isogeometric Galerkin and standard C0 finite element methods, when a specified level of accuracy is to be achieved with minimum computational cost. We then explore an adaptive isogeometric collocation method that is based on local hierarchical refinement of NURBS basis functions and collocation points derived from the corresponding multi-level Greville abscissae. We introduce the concept of weighted collocation that can be consistently developed from the weighted residual form and the two-scale relation of B-splines. Using weighted collocation in the transition regions between hierarchical levels, we are able to reliably handle coincident collocation points that naturally occur for multi-level Greville abscissae. The resulting method combines the favorable properties of isogeometric collocation and hierarchical refinement in terms of computational efficiency, local adaptivity, robustness and straightforward implementation, which we illustrate by numerical examples in one, two and three dimensions.
- Numerical Mathematics