Abstract

We present weighted quadrature for hierarchical B-splines to address the fast formation of system matrices arising from adaptive isogeometric Galerkin methods with suitably graded hierarchical meshes. By exploiting a local tensor product structure, we extend the construction of weighted rules from the tensor product to the hierarchical spline setting. The proposed algorithm has a computational cost proportional to the number of degrees of freedom and advantageous properties with increasing spline degree. To illustrate the performance of the method and confirm the theoretical estimates, a selection of 2D and 3D numerical tests is provided.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.