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

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

2007
M. G. Blyth

A simple strategy for constructing a sequence of increasingly refined interpolation grids over the triangle or the tetrahedron is discussed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The interpolation nodes are generated based on a one-dimensional master grid comprised of the zeros of the Lobatto, Legendre, Chebyshev, and second-kind Chebyshev polyn...

1995
L. Gemignani LUCA GEMIGNANI Luca Gemignani

The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...

2007
SIMON J. SMITH Simon J. Smith

A conjecture for the projection norm (or Lebesgue constant) of a weighted interpolation method based on the zeros of Chebyshev polynomials of the third and fourth kinds is resolved. This conjecture was made in a paper by J. C. Mason and G. H. Elliott in 1995. The proof of the conjecture is achieved by relating the projection norm to that of a weighted interpolation method based on zeros of Cheb...

1995
J. de Frutos

This paper analyses a Chebyshev pseudospectral collocation semidiscrete (continuous in time) discretization of a variable coefficient parabolic problem. Optimal stability and convergence estimates are given. The analysis is based on an approximation property concerning the GaussLobatto-Chebyshev interpolation operator.

2012
Kazuo Komatsu Hitoshi Takata

This paper discusses a design of nonlinear observer by a formal linearization method using an application of Chebyshev Interpolation in order to facilitate processes for synthesizing a nonlinear observer and to improve the precision of linearization. A dynamic nonlinear system is linearized with respect to a linearization function, and a measurement equation is transformed into an augmented lin...

Journal: :Journal of Approximation Theory 1987

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

2010
Herbert E. Salzer

Formulas are given for n-point osculatory and hyperosculatory (as well as ordinary) polynomial interpolation for f(x), over ( —1, 1), in terms of fixi), f'(xi) and f"(x/) at the irregularly-spaced Chebyshev points x¡ = —cos {(2i — l)ir/2n}, i = 1, • • ■ , n. The advantage over corresponding formulas for Xi equally spaced is in the squaring and cubing, in the respective osculatory and hyperoscul...

Journal: :Linear Algebra and its Applications 2014

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

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