Sciweavers

2766 search results - page 2 / 554
» Algorithms for trigonometric polynomials
Sort
View
JAT
2008
57views more  JAT 2008»
13 years 8 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
TIT
2008
121views more  TIT 2008»
13 years 8 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
ADCM
1998
93views more  ADCM 1998»
13 years 8 months ago
Tensor-product monotonicity preservation
: This paper studies systems of tensor-product functions for which the functions they span are monotonic in any direction when their control nets are monotonic in that direction. I...
Michael S. Floater, Juan Manuel Peña
FMCAD
2000
Springer
14 years 1 days ago
Formal Verification of Floating Point Trigonometric Functions
Abstract. We have formal verified a number of algorithms for evaluating transcendental functions in double-extended precision floating point arithmetic in the Intel
John Harrison
FPL
2007
Springer
198views Hardware» more  FPL 2007»
14 years 2 months ago
Floating-Point Trigonometric Functions for FPGAs
Field-programmable circuits now have a capacity that allows them to accelerate floating-point computing, but are still missing core libraries for it. In particular, there is a ne...
Jérémie Detrey, Florent de Dinechin