نتایج جستجو برای: order centered compact
تعداد نتایج: 1031991 فیلتر نتایج به سال:
Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and...
for assessment and comparison of measuring density methods of festuca ovina, bromus tomentellus and prangos ferulacea, three plants communities are selected. in all of plant community, reference area was defined and samples 7000 (70*100) square meter was selected. whole the area, sampling was accumplished as systematic-random. in each area, 5 transect 100 meter are established. then in areas 70...
Generalising Nachbin's theory of ``topology and order'', in this paper we continue the study of quantale-enriched categories equipped with a compact Hausdorff topology. We compare these $V$-categorical compact Hausdorff spaces with ultrafilter-quantale-enriched categories, and show that the presence of a compact Hausdorff topology guarantees Cauchy completeness and (suitably defined) ...
In this work, fourth-order compact block-centered finite difference (CBCFD) schemes combined with the Crank-Nicolson discretization are constructed and analyzed for solving parabolic integro-differential type non-Fickian flows in one-dimensional two-dimensional cases. Stability analyses of derived rigorously. We also obtain optimal second-order convergence temporal increment spatial direction b...
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for matching range scans. The fundamental geometric representation is a structural one, polygonal lines are ordered according to the cyclic order of visibility. This approach is an improvement of the underlying geometric ...
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
Large-dimension heterogeneous nanoporous membranes were obtained by the formation of CdS doped mesoporous silica within the porous channels of alumina membranes.
In this work we propose a compact cell-centered Galerkin method with subgrid stabilization for anisotropic heterogeneous di usion problems on general meshes. Both essential theoretical results and numerical validation are provided.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید