A concept of approximate factorization of multivariate polynomial is introduced and an algorithm for approximate factorization is presented. The algorithm handles polynomials with complex coefficients represented approximately, hence it can be used to test the absolute irreducibility of multivariate polynomials. The algorithm works as follows: given a monic square-free polynomialF(x,y,…,z), it calculates the roots ofF(x,yo, ...,z0) numerically, whereyo, … z0 are suitably chosen numbers, then it constructs power series F1, …, Fn such thatF(x,y, …, z) ∈F1 (x,y., ...,z)...Fn(x,y, ...z) (mod Se+2), where n=degx (F),S=(y-y0, ...,z-z0), ande=max{degy(F), …, degx (F)}; finally it finds the approximate divisors ofF as products of elements of {F1, …,Fn}.