نتایج جستجو برای Interval Legendre Polynomial

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

2008
Bujar Xh. Fejzullahu,

Let be introduced the Sobolev-type inner product (f, g) = 1 2 Z 1 −1 f(x)g(x)dx + M [f ′(1)g′(1) + f ′(−1)g′(−1)], where M ≥ 0. In this paper we will prove that for 1 ≤ p ≤ 4 3 there are functions f ∈ L([−1, 1]) whose Fourier expansion in terms of the orthonormal polynomials with respect to the above Sobolev inner product are divergent almost everywhere on [−1, 1]. We also show that, for some v...

Journal: :CoRR 2017
Zhixiong Chen,

We continue to investigate binary sequence (fu) over {0, 1} defined by (−1)fu = ( (u−u)/p p ) for integers u ≥ 0, where ( · p ) is the Legendre symbol and we restrict ( 0 p ) = 1. In an earlier work, the linear complexity of (fu) was determined for w = p − 1 under the assumption of 2p−1 6≡ 1 (mod p2). In this work, we give possible values on the linear complexity of (fu) for all 1 ≤ w < p− 1 un...

2004
Alexander Russell, Igor E. Shparlinski, Wim van Dam, Sean Hallgren,

We consider the problem of recovering a hidden monic polynomial f(X) of degree d ≥ 1 over a finite field Fp of p elements given a black box which, for any x ∈ Fp, evaluates the quadratic character of f(x). We design a classical algorithm of complexity O(d2pd+ε) and also show that the quantum query complexity of this problem is O(d). Some of our results extend those of Wim van Dam, Sean Hallgren...

A. Salimi Shamloo, B. Parsa Moghaddam, N. khorrami,

In this paper, interval Legendre wavelet method is investigated to approximated the solution of the interval Volterra-Fredholm-Hammerstein integral equation. The shifted interval Legendre polynomials are introduced and based on interval Legendre wavelet method is defined. The existence and uniqueness theorem for the interval Volterra-Fredholm-Hammerstein integral equations is proved. Some examp...

2009
Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm,

We consider a class of arithmetic equations over the complete lattice of integers (extended with−∞ and∞) and provide a polynomial time algorithm for computing least solutions. For systems of equations with addition and least upper bounds, this algorithm is a smooth generalization of the Bellman-Ford algorithm for computing the single source shortest path in presence of positive and negative edg...

Journal: :J. Algorithms 1992
Anath Fischer, Itzhak Gilboa, Moshe Shpitalni,

A three-dimensional object has many possible representations inside a computer. Specifically, constructive solid geometry, boundary representation, and volumetric approximation techniques are commonly used to represent objects in solid geometric modeling (see [4]). Among the volumetric schemes are the octree [3] and the more recently developed switching-function representation [6] in which the ...

Journal: :Soft Comput. 2008
Yu Qiu, Hong Yang, Yanqing Zhang, Yichuan Zhao,

In recent years, the type-2 fuzzy sets theory has been used to model and minimize the effects of uncertainties in rule-base fuzzy logic system (FLS). In order to make the type-2 FLS reasonable and reliable, a new simple and novel statistical method to decide interval-valued fuzzy membership functions and probability type reduce reasoning method for the interval-valued FLS are developed. We have...

1997
Chenyi Hu,

By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinations of interval nodes are used. The high computational complexity makes it necessary to perform the computation parallelly. In this paper, we report a parallel algorithm which effectively perform the combinatorical com...

2006
DAO-QING DAI, WEI LIN, David R. Larson,

We use special functions and orthonormal wavelet bases on the real line to construct wavelet-like bases. With these wavelets we can construct polynomial bases on the interval; moreover, we can use them for the numerical resolution of degenerate elliptic operators.

Journal: :فیزیک زمین و فضا 0
محمدرضا سیف, دانش آموخته کارشناسی ارشد ژئودزی، دان..., استادیار، گروه مهندسی نقشه برداری، پر..., دانشیار، دانشکده مهندسی نقشه برداری، ...,

the low earth orbiting (leo) satellites are widely used for geosciences applications. for most applications, precise orbital information of the satellites is required. a combination of the in suite observations and dynamic orbit yields the optimum solution. in order to obtain the combined optimal solution, one needs to analytically or numerically propagate the state vector epoch by an epoch bas...

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

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