نتایج جستجو برای: sadhana polynomial
تعداد نتایج: 97672 فیلتر نتایج به سال:
in this paper, non-polynomial spline method for solving coupled burgers’ equations are presented. we take a new spline function. the stability analysis using von-neumann technique shows the scheme is unconditionally stable. to test accuracy the error norms2l, ∞l are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equatio...
background: gastric cancer is the fourth common malignancy and the second prevalent cause of cancer death in the world. genetic and environmental factors play an important role in the development of this cancer. nutritional and epidemiological studies have indicated that folate status modulates the risk of developing cancer and apoptosis has been reported to play a decisive role in precancerous...
consider an n × n matrix polynomial p(λ). a spectral norm distance from p(λ) to the set of n × n matrix polynomials that havea given scalar µ ∈ c as a multiple eigenvalue was introducedand obtained by papathanasiou and psarrakos. they computedlower and upper bounds for this distance, constructing an associated perturbation of p(λ). in this paper, we extend this resultto the case of two given di...
let $r$ be an infinite ring. here we prove that if $0_r$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin x}$ for every infinite subset $x$ of $r$, then $r$ satisfies the polynomial identity $x^n=0$. also we prove that if $0_r$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in x}$ for every infinite subset $x$ of $r$, then $x^n=x$ for all $xin r$.
چکیده ندارد.
we present a sixth-order non-polynomial spline method for the solutions of two-point nonlinear boundary value problem u(4)+f(x,u)=0, u(a)=α1, u''(a)= α2, u(b)= β1,u''(b)= β2, in off step points. numerical method of sixth-order with end conditions of the order 6 is derived. the convergence analysis of the method has been discussed. numerical examples are presented to illustra...
for a graph $g$, let $p(g,lambda)$ denote the chromatic polynomial of $g$. two graphs $g$ and $h$ are chromatically equivalent if they share the same chromatic polynomial. a graph $g$ is chromatically unique if any graph chromatically equivalent to $g$ is isomorphic to $g$. a $k_4$-homeomorph is a subdivision of the complete graph $k_4$. in this paper, we determine a family of chromatically uni...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید