A Simple Algorithm for Obtaining Nearly Optimal Quadrature Rules for NURBS-based Isogeometric Analysis
Journal article preprint
TEXAS UNIV AT AUSTIN INST FOR COMPUTATIONAL ENGINEERING AND SCIENCES
Pagination or Media Count:
We develop new quadrature rules for Isogeometric Analysis based on the solution of a local nonlinear problem. A simple and robust algorithm is developed to determine the rules which are exact for important B-Spline spaces of uniform and geometrically stretched knot spacings. We consider both periodic and open knot vector configurations and illustrate the efficiency of the rules on selected boundary value problems. We find that the rules are almost optimally efficient, but much easier to obtain than optimal rules, which require the solution of global nonlinear problems that are often ill-posed.
- Numerical Mathematics
- Theoretical Mathematics