We give a new numerical method to compute the eigenstructure—i.e. the zero structure, the polar structure, and the left and right null space structure—of a polynomial matrix P(λ). These structural elements are of fundamental importance in several systems and control problems involving polynomial matrices. The approach is more general than previous numerical methods because it can be applied to an arbitrary m × n polynomial matrix P(λ) with normal rank r smaller than m and/or n. The algorithm is then shown to compute the structure of the left and right null spaces of P(λ) as well. The speed and accuracy of this new approach are also discussed.