  A parquet approximation (generalized ladder diagrams) in matrix models is
considered. By means of numerical calculations we demonstrate that in the large
$N$ limit the parquet approximation gives an excellent agreement with exact
results.
