Fast Summation Techniques for Sparse Shape Functions in Tetrahedral hp-FEM

作     者：Beuchler, Sven Pillwein, Veronika Zaglmayr, Sabine 

作者机构：Institute for Numerical Simulation University Bonn Wegelerstraße 6 53115 Bonn Germany RISC University Linz Altenberger Straße 69 4040 Linz Austria CST - Computer Simulation Technology AG Darmstadt Germany 

出 版 物：《Lecture Notes in Computational Science and Engineering》 (Lect. Notes Comput. Sci. Eng.)

年 卷 期：2013年第91卷

页      面：511-518页

核心收录：

基　　金：The work has been supported by the FWF projects P20121  P20162  and P23484 

主　　题：Stiffness matrix 

摘      要：This paper considers the hp-finite element discretization of an elliptic boundary value problem using tetrahedral elements. The discretization uses a polynomial basis in which the number of nonzero entries per row is bounded independently of the polynomial degree. The authors present an algorithm which computes the nonzero entries of the stiffness matrix in optimal complexity. The algorithm is based on sum factorization and makes use of the nonzero pattern of the stiffness matrix. © Springer-Verlag Berlin Heidelberg 2013.