RUS  ENG
Full version
JOURNALS // Program Systems: Theory and Applications // Archive

Program Systems: Theory and Applications, 2019 Volume 10, Issue 4, Pages 141–161 (Mi ps354)

Optimization Methods and Control Theory

Conversions of the convolution operation to the sum and the asymptotic behavior of the stable polynomials coefficients

A. M. Tsirlina, M. A. Zaevab

a Ailamazyan Program Systems Institute of Russian Academy of Sciences
b Moscow Engineering Physics Institute

Abstract: Consider the integral transformations which convert convolution in the domain of originals (functions of scalar real variable) into the sum of images (functions of scalar real variable). All these transformations are given up to a linear operator.
We discuss the properties of one of these transformations, which converts any exponent the exponent: its relationship with the Laplace transform, transform of some particular functions and operations differentiation, integration, shift, time scaling, multiplication by the exponent, etc.
Transformations of this type we call cumulative by analogy with the transition from the density distribution of a random variable to its cumulants. We show that Newton’s formulas that realize the relation of sums of the same powers of the roots of a polynomial with its coefficients are cumulative transformation. Also, any transition of real variable function to its phase (same as the logarithm of the module of its Fourier transform) is.
We discuss the possible applications and obtain the conditions under which the sequence of coefficients of a stable polynomial with increasing its degree is asymptotically normal.

Key words and phrases: convolution of originals, integral transformation, sum of mappings, cumulants, stable polynomials.

UDC: 517.929.4+517.444
BBK: В161.2:В213.17

MSC: Primary 44A35; Secondary 44A10, 93D05

Received: 12.01.2019
Accepted: 06.12.2019

DOI: 10.25209/2079-3316-2019-10-4-141-161



© Steklov Math. Inst. of RAS, 2024