An Efficient Solution Algorithm For Space–Time Finite Element Method



Journal Title

Journal ISSN

Volume Title


Springer Verlag


An efficient solution algorithm has been developed for space–time finite element method that is derived from time discontinuous Galerkin (TDG) formulation. The proposed algorithm features an iterative solver accelerated by a novel and efficient preconditioner. This preconditioner is constructed based on the block structure of coupled space–time system matrix, which is expressed as addition of Kronecker products of temporal and spatial submatrices. With this unique decomposition, the most computationally intensive operations in the iterative solver, i.e. matrix operations, are subsequently optimized and accelerated employing the inverse property of Kronecker product. Theoretical analysis and numerical examples both demonstrate that the proposed algorithm provides significantly better performance than the already developed implementations for TDG-based space–time FEM. It reduces the computational cost of solving space–time equations to the same order of solving stiffness equations associated with regular FEM, thereby enabling practical implementation of the space–time FEM for engineering applications.


Full text access from Treasures at UT Dallas is restricted to current UTD affiliates (use the provided Link to Article). All others may find the web address for this item in the full item record as "dc.relation.uri" metadata.


Kronecker products, Finite element method, Galerkin methods, Iterative methods (Mathematics), Matrices, Decomposition (Mathematics)

Scholarship Fund (China) under Grant # 201406290125. National Science Foundation (Grant # CMMI-1727960).


©2018 Springer-Verlag GmbH Germany, part of Springer Nature