On Numerical Methods in Localization Problems

Abstract

When solving localization problem numerically, the main problem is to construct a universal cross section corresponding to a given localizing function. The paper proposes two methods for solving this problem, which use estimates of the first and second order derivatives. A comparative analysis of these methods with a method based on the use of all nodes of a regular grid was carried out. A comparative analysis shows that the proposed methods are superior both in terms of computational complexity and in the quality of the resulting approximation of the universal section.