A refinement on the local cactus rank algorithm

We present an algorithm to recover a minimal local apolar scheme to a homogeneous polynomial $F$. The socle degree of the scheme determines whether it is evinced by a Generalized Additive Decomposition (GAD) of $F$ or of an extension. We give constructive procedures for both cases and compute the Hilbert function efficiently via Hankel operators.