Sciweavers

534 search results - page 12 / 107
» Efficient polynomial L-approximations
Sort
View
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
13 years 11 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
JCP
2007
104views more  JCP 2007»
13 years 7 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
TIM
2010
144views Education» more  TIM 2010»
13 years 2 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
COMBINATORICS
2000
90views more  COMBINATORICS 2000»
13 years 7 months ago
Determinantal Expression and Recursion for Jack Polynomials
We describe matrices whose determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of such a matrix is a list of monomial functions, the entries...
Luc Lapointe, Alain Lascoux, Jennifer Morse
CAP
2010
13 years 2 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan