Sciweavers

467 search results - page 4 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 11 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 7 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
ADCM
2000
104views more  ADCM 2000»
13 years 7 months ago
On the detection of singularities of a periodic function
We discuss the problem of detecting the location of discontinuities of derivatives of a periodic function, given either finitely many Fourier coefficients of the function, or the ...
Hrushikesh Narhar Mhaskar, Jürgen Prestin
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
CSR
2006
Springer
13 years 11 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski