نتایج جستجو برای: hukuhara difference

تعداد نتایج: 419723  

Journal: :Episteme: A Journal of Social Epistemology 2006

2009
Carlos Spa Toni Mateos Adan Garriga

The space and time discretization inherent to all FDTD schemes introduce non-physical dispersion errors, i.e. deviations of the speed of sound from the theoretical value predicted by the governing Euler differential equations. A general methodology for computing this dispersion error via straightforward numerical simulations of the FDTD schemes is presented. The method is shown to provide remar...

1999
Dongxiao Zhang

In this study, a first-order, nonstationary stochastic model of transient flow is developed which is applicable to the entire domain of a bounded vadose zone in the presence of sink/source. We derive general equations governing the statistical moments of the flow quantities by perturbation expansions. Owing to the mathematical complexity of the equations, in general we need to solve them numeri...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بیرجند - دانشکده علوم پایه 1393

در این کار در اولین بخش از چهار عنصر سنگین شامل: سرب ،جیوه، تانتالیم و تنگستن بعنوان ماده هدف در فرآیند تلاشی در یک راکتور adsاستفاده شد و با کمک مدل آبشار درون هسته ای bertini (inc- bertini)، محاسبات مربوط به فرآیند تلاشی ماده هدف برای پروتون هایی در بازه انرژی بین 115mev تا5gev انجام شد. طبق نتایج بدست آمده از این مدل برای این چهار عنصر سنگین، تنگستن بیشترین تعداد نوترون را تولید می کند و بعن...

Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

Journal: :International Journal of Fuzzy Systems 2021

This article proposes a general gH-gradient efficient-direction method and $${\mathcal{W}}$$ -gH-gradient efficient for the optimization problems with interval-valued functions. The convergence analysis step-wise algorithms of both methods are presented. It is observed that converges linearly strongly convex objective function. To develop proposed to study their convergence, ideas strong convex...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید