Abstract
Fast algorithms for applying finite element mass and stiffness operators to the B-form of polynomials over d-dimensional simplices are derived. These rely on special properties of the Bernstein basis and lead to stiffness matrix algorithms with the same asymptotic complexity as tensor-product techniques in rectangular domains. First, special structure leading to fast application of mass matrices is developed. Then, by factoring stiffness matrices into products of sparse derivative matrices with mass matrices, fast algorithms are also obtained for stiffness matrices.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
