Sciweavers

22 search results - page 1 / 5
» On Polynomial Multiplication in Chebyshev Basis
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 11 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 11 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
MOC
1998
107views more  MOC 1998»
13 years 11 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 4 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
VC
2008
102views more  VC 2008»
13 years 11 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...