Exact and approximate formulas for computing the Chebyshev expansion coefficients of a rational function are analysed. A simple expression is then given for evaluating the approximation errors of a classic numerical quadrature formula
Most areas of numerical analysis, as well as many other areas of Mathemat-ics as a whole, make use o...
In this paper, two methods are described for obtaining estimates of the error of rational functions ...
summary:In this note quadrature formula with error estimate for functions with simple pole is discus...
summary:In this note quadrature formula with error estimate for functions with simple pole is discus...
[[abstract]]The first part of this paper calculates the error between a function and its m-term Cheb...
Chebyshev polynomials crop up in virtually every area of numerical analysis, and they hold particula...
The Approximation Problem and specifically, "direct" rational Chebyshev approximation is discussed. ...
This paper improves error bounds forGauss, Clenshaw-Curtis and Fejér's first quadrature by using new...
AbstractIn [1], a formula for the error bound for the truncation error of the two-variable Chebyshev...
Abstract. A wide range of numerical methods exists for computing polyno-mial approximations of solut...
AbstractWe explicitly determine the best uniform polynomial approximation pn−1∗ to a class of ration...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...
In this paper, two methods are described for obtaining estimates of the error of rational functions ...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
Most areas of numerical analysis, as well as many other areas of Mathemat-ics as a whole, make use o...
In this paper, two methods are described for obtaining estimates of the error of rational functions ...
summary:In this note quadrature formula with error estimate for functions with simple pole is discus...
summary:In this note quadrature formula with error estimate for functions with simple pole is discus...
[[abstract]]The first part of this paper calculates the error between a function and its m-term Cheb...
Chebyshev polynomials crop up in virtually every area of numerical analysis, and they hold particula...
The Approximation Problem and specifically, "direct" rational Chebyshev approximation is discussed. ...
This paper improves error bounds forGauss, Clenshaw-Curtis and Fejér's first quadrature by using new...
AbstractIn [1], a formula for the error bound for the truncation error of the two-variable Chebyshev...
Abstract. A wide range of numerical methods exists for computing polyno-mial approximations of solut...
AbstractWe explicitly determine the best uniform polynomial approximation pn−1∗ to a class of ration...
AbstractMicchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of pre...
In this paper, two methods are described for obtaining estimates of the error of rational functions ...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
Most areas of numerical analysis, as well as many other areas of Mathemat-ics as a whole, make use o...
In this paper, two methods are described for obtaining estimates of the error of rational functions ...
summary:In this note quadrature formula with error estimate for functions with simple pole is discus...
DOI
Add to ORKG