نتایج جستجو برای: jacobi polynomial

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

Journal: :Journal of Mathematical Analysis and Applications 1994

2008
Young Joon Ahn YOUNG JOON AHN

In this paper, we present the constrained Jacobi polynomial which is equal to the constrained Chebyshev polynomial up to constant multiplication. For degree n = 4, 5, we find the constrained Jacobi polynomial, and for n ≥ 6, we present the normalized constrained Jacobi polynomial which is similar to the constrained Chebyshev polynomial.

Journal: :Ars Comb. 2005
Koichi Betsumiya YoungJu Choie

A Jacobi polynomial was introduced by Ozeki. It corresponds to the codes over F2. Later, Bannai and Ozeki showed how to construct Jacobi forms with various index using a Jacobi polynomial corresponding to the binary codes. It generalizes Broué-Enguehard map. In this paper, we study Jacobi polynomial which corresponds to the codes over F2f . We show how to construct Jacobi forms with various ind...

Journal: :Tohoku Mathematical Journal 1972

Journal: :Proceedings of the American Mathematical Society 1983

Journal: :Communications of the Korean Mathematical Society 2008

2005
F. PEHERSTORFER A. VOLBERG P. YUDITSKII

For all hyperbolic polynomials we proved in [11] a Lipschitz estimate of Jacobi matrices built by orthogonalizing polynomials with respect to measures in the orbit of classical Perron-Frobenius-Ruelle operators associated to hyperbolic polynomial dynamics (with real Julia set). Here we prove that for all sufficiently hyperbolic polynomials this estimate becomes exponentially better when the dim...

2012
Zhaofei Tian Wen Zhang Sanzheng Qiao

Among all lattice reduction algorithms, the LLL algorithm is the first and perhaps the most famous polynomial time algorithm, and it is widely used in many applications. In 2012, S. Qiao [24] introduced another algorithm, the Jacobi method, for lattice basis reduction. S. Qiao and Z. Tian [25] improved the Jacobi method further to be polynomial time but only produces a Quasi-Reduced basis. In t...

In this paper, we exhibit two methods to numerically solve the fractional integro differential equations and then proceed to compare the results of their applications on different problems. For this purpose, at first shifted Jacobi polynomials are introduced and then operational matrices of the shifted Jacobi polynomials are stated. Then these equations are solved by two methods: Caputo fractio...

Journal: :bulletin of the iranian mathematical society 0
m. behroozifar department of mathematics‎, ‎faculty of basic sciences‎, ‎babol noshirvani university of technology‎, ‎babol‎, ‎mazandaran‎, ‎iran. f. ahmadpour department of mathematics‎, ‎faculty of basic sciences‎, ‎babol noshirvani university of technology‎, ‎babol‎, ‎mazandaran‎, ‎iran.

in this paper, operational matrices of riemann-liouville fractional integration and caputo fractional differentiation for shifted jacobi polynomials are considered. using the given initial conditions, we transform the fractional differential equation (fde) into a modified fractional differential equation with zero initial conditions. next, all the existing functions in modified differential equ...

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

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