Sciweavers

1469 search results - page 25 / 294
» Approximate polynomial decomposition
Sort
View
JAT
2008
57views more  JAT 2008»
14 years 9 months ago
Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in L1(R/Z) the Bernoulli periodic functions. These are the periodic analogue...
Emanuel Carneiro
ADCM
2008
187views more  ADCM 2008»
14 years 9 months ago
Approximation on the sphere using radial basis functions plus polynomials
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...
Ian H. Sloan, Alvise Sommariva
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
14 years 11 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
78
Voted
JAT
2010
62views more  JAT 2010»
14 years 8 months ago
Pointwise estimates for polynomial approximation on the semiaxis
We state some pointwise estimates for the rate of weighted approximation of a continuous function on the semiaxis by polynomials. Similarly to a previous result in C[−1, 1] due ...
Giuseppe Mastroianni, Woula Themistoclakis
76
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang