نتایج جستجو برای: the best uniform polynomial approximation
تعداد نتایج: 16093837 فیلتر نتایج به سال:
so far several methods have been developed for mapping and interpolation of isohyets.one of the recently accepted methods is geographically weighting regression which is suitable for evaluation of spatial heterogeneity of dependent variable by using local regressions. in order to evaluate annually precipitation spatial variation, this study was conducted in gilan province which precipitation is...
Abstract. Let φm be a polynomial satisfying some mild conditions. Given a set R ⊂ C, a continuous function f on R and its best approximation p n−1 from Πn−1 with respect to the maximum norm, we show that p ∗ n−1 ◦φm is a best approximation to f ◦ φm on the inverse polynomial image S of R, i.e. φm(S) = R, where the extremal signature is given explicitly. A similar result is presented for constra...
abstract this study aimed at investigating the translation of interjections from english into persian in dubbing. to carry out this study the expressive secondary interjections found in the film four weddings and a funeral and their equivalent in persian dubbed version were analyzed through the strategies proposed by cuenca. the descriptive analysis of the corpus showed that (strategy b) i.e...
abstract in this study, we synthesized a novel template polymer by using methacrylic acid (mma) as functional monomer, ethylene glycol dimethacrylate(egdma) as cross linker, 2,2-azobisisobutyronitrile (aibn) as initiator and olanzapine as targeted molecule in the presence of chloroform and acetonitrile as solvent. the products have been characterized and confirmed by (chn)elemental analysis,...
In this article, we address the problem of singular value decomposition of polynomial matrices and eigenvalue decomposition of para-Hermitian matrices. Discrete Fourier transform enables us to propose a new algorithm based on uniform sampling of polynomial matrices in frequency domain. This formulation of polynomial matrix decomposition allows for controlling spectral properties of the decompos...
We study a finite-element approximation of the chemotaxis-growth system. We establish dimension estimate of global attractors for the approximate systems. Our results show that the estimates are uniform with respect to the discretization parameter and polynomial order with respect to the chemotactic coefficient in the equation.We especially emphasize that, this is just the same order(polynomial...
Connected Vertex Cover Problem (CVC) is an NP -hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial Time Approximation Scheme for CVC in Unit Disk Graph.
the main purpose of this paper is to find t-best approximations in fuzzy normed spaces. we introduce the notions of t-proximinal sets and f-approximations and prove some interesting theorems. in particular, we investigate the set of all t-best approximations to an element from a set.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید