Results 1  10
of
83
Some Architectures for Chebyshev Interpolation
"... Abstract—Digital architectures for Chebyshev interpolation are explored and a variation which is wordserial in nature is proposed. These architectures are contrasted with equispaced system structures. Further, Chebyshev interpolation scheme is compared to the conventional equispaced interpolation v ..."
Abstract
 Add to MetaCart
Abstract—Digital architectures for Chebyshev interpolation are explored and a variation which is wordserial in nature is proposed. These architectures are contrasted with equispaced system structures. Further, Chebyshev interpolation scheme is compared to the conventional equispaced interpolation
Rational Interpolation at Chebyshev points
, 1995
"... this paper we present a suitable fast modification of a general lookahed 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 zeros o ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this paper we present a suitable fast modification of a general lookahed 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 zeros
Interpolation and Almost Interpolation by Weak Chebyshev Spaces
, 1998
"... . Some new results on univariate interpolation by weak Chebyshev spaces, using conditions of SchoenbergWhitney type and the concept of almost interpolation sets, are given. x1. Introduction Let U denote a finitedimensional subspace of realvalued functions defined on some set K. We are interested ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Some new results on univariate interpolation by weak Chebyshev spaces, using conditions of SchoenbergWhitney type and the concept of almost interpolation sets, are given. x1. Introduction Let U denote a finitedimensional subspace of realvalued functions defined on some set K. We
SOME CUBATURES WITH CHEBYSHEV NODES
"... Abstract. In this article we construct boolean cubature formulas using univariate Lagrange interpolation projectors with Chebyshev nodes of second type. We compute the coefficients of these cubature formulas using coefficients of corresponding FejerClenshawCurtis quadratures. The remainder terms ..."
Abstract
 Add to MetaCart
Abstract. In this article we construct boolean cubature formulas using univariate Lagrange interpolation projectors with Chebyshev nodes of second type. We compute the coefficients of these cubature formulas using coefficients of corresponding FejerClenshawCurtis quadratures. The re
On Almost Interpolation
, 1997
"... We obtain some characterizations of almost interpolation configurations of points with respect to finitedimensional functional spaces. Particularly, a SchoenbergWhitney type characterization which is valid for any multivariate spline space relative to an arbitrary partition of a domain A ae lR m ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We obtain some characterizations of almost interpolation configurations of points with respect to finitedimensional functional spaces. Particularly, a SchoenbergWhitney type characterization which is valid for any multivariate spline space relative to an arbitrary partition of a domain A ae lR m
ChebyshevLaurent Polynomials and Weighted Approximation
, 1998
"... This paper is an attempt to exibit some interesting properties of the orthogonal Chebyshev Sn polynomials and to demonstrate their importance to the problem of approximation by Sn polynomials. A simple proof of a Jacksontype theorem is given and the Lagrange interpolation problem by functions fro ..."
Abstract
 Add to MetaCart
This paper is an attempt to exibit some interesting properties of the orthogonal Chebyshev Sn polynomials and to demonstrate their importance to the problem of approximation by Sn polynomials. A simple proof of a Jacksontype theorem is given and the Lagrange interpolation problem by functions
The Lebesgue constants for polynomial interpolation
 Annales Mathematicae et Informaticae
"... Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
. These ideas are then discussed in the context of Hermite–Fejér interpolation and a weighted interpolation method where the nodes are zeros of Chebyshev polynomials of the second kind.
Early Termination in Sparse Interpolation Algorithms
"... A probabilistic strategy, early termination, enables di#erent interpolation algorithms to adapt to the degree or the number of terms in the target polynomial when neither is supplied in the input. In addition to dense algorithms, we implement this strategy in sparse interpolation algorithms. Based o ..."
Abstract

Cited by 32 (16 self)
 Add to MetaCart
on early termination, racing algorithms execute simultaneously a dense and a sparse algorithm. The racing algorithms can be embedded as the univariate interpolation substep within Zippel's multivariate method. In addition, we experimentally verify some heuristics of early termination, which make use
Recursiveness in matrix rational interpolation problems
 In appeared in DomainSpecific Processors: Systems, Architectures, Modeling, and Simulation
, 1996
"... Controlling the function of embedded network processor systems has so far been confined to simple configuration languages and component models, with the full programming capabilities available only to trusted systemlevel programmers. In this paper, we consider a software architecture enabling the s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Controlling the function of embedded network processor systems has so far been confined to simple configuration languages and component models, with the full programming capabilities available only to trusted systemlevel programmers. In this paper, we consider a software architecture enabling
A Lagrange Polynomial Chebyshev Pseudo Spectral Time Domain Method in One Dimensional Large Scale Applications
"... Abstract Pseudo Spectral Time Domain method based on Discrete Fourier series has been widely used in computational electromagnetics. However, this method has some disadvantages such as, the Gibbs phenomena, source conditioning and errors due to interpolation and staircase modeling of complex object ..."
Abstract
 Add to MetaCart
Abstract Pseudo Spectral Time Domain method based on Discrete Fourier series has been widely used in computational electromagnetics. However, this method has some disadvantages such as, the Gibbs phenomena, source conditioning and errors due to interpolation and staircase modeling of complex
Results 1  10
of
83