نتایج جستجو برای: chebyshev centers

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

2001
Benyu Guo Jie Shen Zhong-qing Wang Z. WANG

A weighted orthogonal system on the half line based on the Chebyshev rational functions is introduced. Basic results on Chebyshev rational approximations of several orthogonal projections and interpolations are established. To illustrate the potential of the Chebyshev rational spectral method, a model problem is considered both theoretically and numerically: error estimates for the Chebyshev ra...

2015
Daniel Potts Toni Volkmer

We describe a fast method for the evaluation of an arbitrary high-dimensional multivariate algebraic polynomial in Chebyshev form at the nodes of an arbitrary rank-1 Chebyshev lattice. Our main focus is on conditions on rank-1 Chebyshev lattices allowing for the exact reconstruction of such polynomials from samples along such lattices and we present an algorithm for constructing suitable rank-1...

2007
Mohammed A. Abutheraa David Lester

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...

2011
Jie Shen

We introduce a new and efficient Chebyshev-Legendre Galerkin method for elliptic problems. The new method is based on a Legendre-Galerkin formulation, but only the Chebyshev-Gauss-Lobatto points are used in the computation. Hence, it enjoys advantages of both the LegendreGalerkin and Chebyshev-Galerkin methods.

Journal: :Fundam. Inform. 2012
Nikita Gogin Mika Hirvensalo

We give two recursive expressions for both MacWilliams and Chebyshev matrices. The expressions give rise to simple recursive algorithms for constructing the matrices. In order to derive the second recursion for the Chebyshev matrices we find out the Krawtchouk coefficients of the Discrete Chebyshev polynomials, a task interesting on its own.

2010
Nabih N. Abdelmalek

A method for calculating the strict Chebyshev solution of overdetermined systems of linear equations using linear programming techniques is described. This method provides: (1) a way to determine, for the majority of cases, all the equations belonging to the characteristic set, (2) an efficient method to obtain the inverse of the matrix needed to calculate the strict Chebyshev solution, and (3)...

2011
ARMENGOL GASULL

We analyze whether a given set of analytic functions is an Extended Chebyshev system. This family of functions appears studying the number of limit cycles bifurcating from some nonlinear vector field in the plane. Our approach is mainly based on the so called Derivation-Division algorithm. We prove that under some natural hypotheses our family is an Extended Chebyshev system and when some of th...

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

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...

Journal: :iranian journal of science and technology (sciences) 2012
g. b. loghmani

in this paper, an effective direct method to determine the numerical solution of linear and nonlinear fredholm and volterra integral and integro-differential equations is proposed. the method is based on expanding the required approximate solution as the elements of chebyshev cardinal functions. the operational matrices for the integration and product of the chebyshev cardinal functions are des...

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

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