|
Computational aspects of the partition enumeration problem
A. M. Magomedova, S. Lawrencenkob a Department of Mathematics and Computer Science, Daghestan Federal Research Centre of Russian Academy of Sciences, Makhachkala
b Russian State University of Tourism and Service, Cherkizovo, Pushkino district, Moscow region
Abstract:
The problems of performing exact calculations using the classical Kasteleyn formula for calculating the number of perfect matching of a lattice graph are considered. Two tests are formulated that provide the software with automatic correction of the calculation accuracy.
Keywords:
formula, calculations, error, testing, programming.
Received: 08.10.2020 Revised: 15.12.2020 Accepted: 15.12.2020
Citation:
A. M. Magomedov, S. Lawrencenko, “Computational aspects of the partition enumeration problem”, Daghestan Electronic Mathematical Reports, 2020, no. 14, 1–21
Linking options:
https://www.mathnet.ru/eng/demr83 https://www.mathnet.ru/eng/demr/y2020/i14/p1
|
Statistics & downloads: |
Abstract page: | 69 | Full-text PDF : | 33 | References: | 17 |
|