Sciweavers

2766 search results - page 11 / 554
» Algorithms for trigonometric polynomials
Sort
View
MOC
1998
107views more  MOC 1998»
13 years 8 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
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
13 years 8 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 8 months ago
Inapproximability of the Tutte polynomial
Leslie Ann Goldberg, Mark Jerrum
ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
14 years 18 days ago
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
Ziming Li, István Nemes