ABSTRACT

The implementation of the CPM core algorithm (i.e., the definition of the Hamiltonian and the modified Metropolis iteration) requires a simple code, which has never created problems for most researchers. Originally, CPM users have therefore usually written their own software programs, which were specifically built according to the specific application they were developing. However, as commented in [20], these proprietary versions were usually incompatible, making the exact replication of published results hard and the integration of new CPM extensions considerably difficult.