Abstract
We derive low-complexity matrix-free finite element algorithms for simplicial Bernstein polynomials on simplices. Our techniques, based on a sparse representation of differentiation and special block structure in the matrices evaluating B-form polynomials at warped Gauss points, apply to variable coefficient problems as well as constant coefficient ones, thus extending our results in Kirby (Numer Math, 2011, in press).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.