The problem of robust Schur stability of a polynomial matrix family is considered as that of discovering the structure of the stability domain in parameter space. The algorithms are proposed for establishing whether or not any given box in the parameter space belongs to this domain, and for finding the distance to instability from any internal point of the domain to its boundary. The treatment is performed in the ideology of analytical algorithm for elimination of variables and localization of zeros of algebraic systems. Some examples are given.