Isogeometric Collocation: Cost Comparison with Galerkin Methods and Extension to Adaptive Hierarchical NURBS Discretizations |
| |
| Authors: | Dominik Schillinger John A. Evans Alessandro Reali Michael A. Scott Thomas J.R. Hughes |
| |
| Affiliation: | 1. Institute for Computational Engineering and Sciences (ICES), The University of Texas at Austin, USA;2. Department of Civil Engineering and Architecture, University of Pavia, Italy;3. Department of Civil and Environmental Engineering, Brigham Young University, Provo, USA |
| |
| Abstract: | Collocation is based on the discretization of the strong form of the underlying partial differential equations, which requires basis functions of sufficient order and smoothness. Consequently, the use of isogeometric analysis (IGA) for collocation suggests itself, since splines can be readily adjusted to any order in polynomial degree and continuity required by the differential operators. In addition, they can be generated for domains of arbitrary geometric and topological complexity, directly linked to and fully supported by CAD technology. The major advantage of isogeometric collocation over Galerkin type IGA is the minimization of the computational effort for numerical quadrature. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) |
| |
| Keywords: | |
|
|
