Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

AAECC
2008
Springer

favoriteEmaildiscussreport

83views Algorithms» more AAECC 2008»

Fast separable factorization and applications

13 years 4 months ago

Fast separable factorization and applications

Download www.math.uvsq.fr

Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations in the coefficient field. We also adapt the classical multi-modular strategy that speeds up the computations for many coefficient fields, and we analyze consequences of the new results to the squarefree and the irreducible factorizations.

Grégoire Lecerf

Real-time Traffic

AAECC 2008 | Algorithms | Classical Multi-modular Strategy | Coefficient Fields | Separable Decomposition |

claim paper

Related Content

» Factorization of Correspondence and Camera Error for Unconstrained Dense Correspondence Ap...

» Multichannel nonnegative matrix factorization in convolutive mixtures With application to ...

» Separability and Topology Control of Quasi Unit Disk Graphs

» Multichannel nonnegative tensor factorization with structured constraints for userguided a...

» A fast transform for acoustic imaging with separable arrays

» Fast Approximation Algorithms for Cutbased Problems in Undirected Graphs

» A sparse component model of source signals and its application to blind source separation

» A fast asymptotically efficient algorithm for blind separation of a linear mixture of bloc...

» Sparse Representation and Its Applications in Blind Source Separation

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	AAECC
Authors	Grégoire Lecerf

Comments (0)