Skip to Main Content
This paper introduces a new matrix assembly algorithm for nonlinear problems that decomposes the problem into parts that are well suited for parallel computation on GPGPUs. It has the strength that recomputations in nonlinear entries of the stiffness matrices are embarrassingly parallel. The algorithm is used to solve electro-quasistatic problems. The proposed discretization includes the handling of Dirichlet and homogeneous Neumann boundary conditions.
Date of Publication: May 2013