Sciweavers

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

24

JSC
2006

favoriteEmaildiscussreport

132views more JSC 2006»

From an approximate to an exact absolute polynomial factorization

13 years 10 months ago

From an approximate to an exact absolute polynomial factorization

Download www.ens-lyon.fr

We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebraic integers over Z and is certified. It relies on a study of the perturbations in a Vandermonde system. We provide a sufficient condition on the precision of the approximate factors, depending only on the height and the degree of the polynomial. c 2005 Elsevier Ltd. All rights reserved.

Guillaume Chèze, André Galligo

Real-time Traffic

Algorithm | Bivariate Polynomial | Exact Absolute Factorization | JSC 2006 |

claim paper

Related Content

» Absolute polynomial factorization in two variables and the knapsack problem

» Approximate bivariate factorization a geometric viewpoint

» Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples

» Floatingpoint L2approximations to functions

» Phase Local Approximation PhaseLa Technique for Phase Unwrap From Noisy Data

» Exact Covers via Determinants

» Connection Preemption in MultiClass Networks

» A PTAS for a Disc Covering Problem Using WidthBounded Separators

» Comparing Exact and Approximate Spatial Autoregression Model Solutions for Spatial Data An...

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JSC
Authors	Guillaume Chèze, André Galligo

Comments (0)