A new data-parallel algorithm for reconstructing smooth surfaces defined by arbitrary 3D triangular meshes is presented. The obtained surfaces are composed of triangular patches that join with first order geometric continuity. Every patch is generated by a parametric function that approximates the vertices of each control triangle of the mesh. A coarse granularity implementation of those functi...

The goal of this research is to study the performance ofmeshless approximations and their integration. Two diffuse shape functions, namely the moving least-squares and local maximum-entropy function, and a linear triangular interpolation are compared using Gaussian integration and the stabilized conforming nodal integration scheme. The shape functions and integration schemes are tested on two e...

An injective map f : E(G) → {±1,±2, · · · ,±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f∗ : V (G) → Z − {0} defined by f∗(v) = ∑ e∈Ev f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f∗(V (G)) is either of the form { ±k1,±k2, · · · ,±k p 2 } or { ±k1,±k2, · · · ,±k p−1 2 } ∪ { ±k p+1 2 } according as ...

We construct a constrained trivariate extension of the univariate normalized B-basis of the vector space of trigonometric polynomials of arbitrary (finite) order n ∈ N defined on any compact interval [0, α], where α ∈ (0, π). Our triangular extension is a normalized linearly independent constrained trivariate trigonometric function system of dimension δn = 3n (n+ 1) + 1 that spans the same vect...

JAN S. HESTHAVEN ∗, SHUN ZHANG † , AND XUEYU ZHU ‡ Abstract. In this paper, we propose reduced basis multiscale finite element methods (RB-MsFEM) for elliptic problems with highly oscillating coefficients. The method is based on multiscale finite element methods with local test functions that encode the oscillatory behavior ([4, 14]). For uniform rectangular meshes, the local oscillating test f...

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such consists in specific scaling similarity transformation that reduces the departure from normality matrix, thus decreasing its norm and general function condition number. It easily be extended to non-triangular provided it is involving prior...

In this paper, deriving the fuzzy weights of criteria from the fuzzy pair-wise comparison matrix with triangular fuzzy elements is investigated. In the proposed method we first use the ranking function to convert the triangular fuzzy data into crisp one. Then by using the goal programming method we derive the fuzzy weights of criteria. We propose two new methods, and it is shown that these meth...

A new mesh quality measure for triangular and tetrahedral meshes is presented. This mesh quality measure is based both on geometrical and solution information and is derived by considering the error when linear triangular and tetrahedral elements are used to approximate a quadratic function. The new measure is shown to be related to existing measures of mesh quality but with the advantage that ...

A new mesh quality measure for triangular and tetrahedral meshes is presented. This mesh quality measure is based both on geometrical and solution information and is derived by considering the error when linear triangular and tetrahedral elements are used to approximate a quadratic function. The new measure is shown to be related to existing measures of mesh quality but with the advantage that ...