Detecting mistakes and filling gaps in data cubes

We consider the family of ZET algorithms, designed to detect gross errors and gaps in “object-parameter” data tables and “object-parameter-time” data cubes. To work with each element of the table, we use information not from the entire table but only out of its “competent” subtable. We also consider methods of selecting a competent subtable having tools for avoiding falling into local extreme. The example is exhibited of a ZET algorithm for solving some applied problem.