General algorithm for the numerical integration of functions of several variables

E. A. Bailov, Mirbulat B. Sikhov, Нурлан Т Темиргалиев

2014

Closed access Metadata (CSL-JSON)
DOI 10.1134/s0965542514070045
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

An algorithm is proposed for the numerical integration of an arbitrary function represent-able as a sum of an absolutely converging multiple trigonometric Fourier series. The resulting quadrature formulas have identical weights, and the nodes form a Korobov grid that is completely defined by two positive integers, of which one is the number of nodes. In the case of classes of functions with dominant mixed smoothness, it is shown that the algorithm is almost optimal in the sense that the construction of a grid of N nodes requires far fewer elementary arithmetic operations than N lnln N . Solutions of related problems are also given.