SUMMARYA new indirect way of producing all-quad meshes is presented. The method takes advantage of a well known algorithm of the graph theory, namely the Blossom algorithm that computes the minimum cost perfect matching in a graph in polynomial time. The new Blossom-Quad algorithm is compared with standard indirect procedures. Meshes produced by the new approach are better both in terms of element shape and in terms of size field efficiency.
This paper presents a multirate technique to improve and optimize the time step of a second order 2−stages Explicit Runge-Kutta scheme (ERK). In this technique, the mesh elements are stored in different groups according to their stable time steps. These groups are sorted into two classes. The bulk groups where the 2−stages ERK method is applied once or repeatedly. The buffer groups that used to accommodate transition between two bulks groups. This technique is proposed for accelerating explicit discontinuous Galerkin computations of time domain Maxwell equations. An application example on human skull is proposed to show the efficiency of this technique to simulate wave propagation on complex geometries.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.