Approximation theory
Daghestan Electronic Mathematical Reports: Issue 14 (2020)
Computational Aspects of the Partition Enumeration Problem
UDK: 519.1
Pages: 1 - 21
DOI: 10.31029/demr.14.1
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.