No abstract uploaded!

No abstract uploaded!

Completely invariant components of the Fatou sets of meromorphic maps are discussed. Positive answers are given to Baker’s and Bergweiler’s problems that such components are the only Fatou components for certain classes of meromorphic maps.

In this paper, we present a mixed generalized multiscale finite element method (GMsFEM) for solving flow in heterogeneous media. Our approach constructs multiscale basis functions following a GMsFEM framework and couples these basis functions using a mixed finite element method, which allows us to obtain a mass conservative velocity field. To construct multiscale basis functions for each coarse edge, we design a snapshot space that consists of fine-scale velocity fields supported in a union of two coarse regions that share the common interface. The snapshot vectors have zero Neumann boundary conditions on the outer boundaries, and we prescribe their values on the common interface. We describe several spectral decompositions in the snapshot space motivated by the analysis. In the paper, we also study oversampling approaches that enhance the accuracy of mixed GMsFEM. A main idea of

A natural metric in 2-manifold surfaces is to use geodesic distance. If a 2-manifold surface is represented by a triangle mesh T , the geodesic metric on T can be computed exactly using computational geometry methods. Previous work for establishing the geodesic metric on T only supports using half-edge data structures; i.e., each edge e in T is split into two halves (he1, he2) and each half-edge corresponds to one of two faces incident to e. In this paper, we prove that the exact-geodesic structures on two halfedges of e can be merged into one structure associated with e. Four merits are achieved based on the properties which are studied in this paper: (1) Existing CAD systems that use edge-based data structures can directly add the geodesic distance function without changing the kernel to a half-edge data structure; (2) To find the geodesic path from inquiry points to the source, the MMP algorithm can be run in an onthe- fly fashion such that the inquiry points are covered by correct wedges; (3) The MMP algorithm is sped up by pruning unnecessary wedges during the wedge propagation process; (4) The storage of the MMP algorithm is reduced since fewer wedges need to be stored in an edge-based data structure. Experimental results show that when compared to the classic half-edge data structure, the edge-based implementation of the MMP algorithm reduces running time by 44% and storage by 29% on average.