This talk presents a Maple/Matlab toolbox for basic polynomial computations with exact or approximate data. The toolbox includes software for computing the approximate GCD, approximate factorization, dual basis and multiplicity identification, as well as numerical elimination in solving polynomial systems. We shall present the underlying theory of approximate polynomial algebra, the main approach of the algorithms, and computational results.