The dcmatch analysis can be considered as a short cut for monte carlo mismatch analysis in dc. In monte carlo mismatch analysis, we do multiple runs with random number on circuit or model parameters and then examine the output. In dcmatch analysis, we capture the randomness via the dcmatch model parameters such as
+ mvtwl = 5.740000e-09 mvtwl2 = 1.503000e-12 mvt0 = 0.000000e+00
+ mbewl = 8.022000e-09 mbe0 = 0.000000e+00
and just do a single run, and examine the output. So the accuracy of dcmatch analysis relies on how good these mismatch model parameters representing the randomness, and how good the underline model equations are (which are provided by a foundry).
The second difference is dcmatch assumes that the randomness is varied in a small fashion such that the variations will not change the dc operating point too much. In monte carlo mismatch, the random numbers can swing large. Whenever the random variations cause significant dc operating point shift, the variations are considered large. But for dcmatch, since it is based on "noise-like" analysis algorithm, if you want to model mismatch with large variations, then the algorithm is inherently not so accurate. So, the dcmatch result assumes small random variations. Some people call dcmatch a local mismatch analysis, instead of global mismatch analysis.