Inna V. Shvidchenko

Inna V. Shvidchenko

Auto-generated profile, based on publicly available information

Inna V. Shvidchenko

V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 May 2019 in Cybernetics and Systems Analysis
Verified
Journal Article
Closed access
PDF file
AKANTON KUDIN
ANTON KUDIN
BKB. A. Kovalenko
B. A. Kovalenko
ISI. V. Shvidchenko
I. V. Shvidchenko

1 January 2023
Verified
Book
Closed access
VZValeriy Zadiraka
Valeriy Zadiraka
LLLiliya Luts
Liliya Luts
ISInna Shvidchenko
Inna Shvidchenko
We present a general theory of computation integrals of highly oscillatory functions (IHOF) in various classes of subintegral functions with the use of a net information operator on subintegral functions. The monograph considers the calculation of integrals involving the following functions as a kernel: exponential (Fourier transform and others), trigonometric, wavelets and Bessel functions. The proposed theory is based on the theory of calculations, theory of computational errors, general theory of optimal accuracy algorithms, algorithms for detecting and refining a priori information about the subintegral function and the theory of testing algorithms—programs. The theory allows us to derive and prove optimal (with respect to accuracy and (or) performance) and nearly optimal quadrature and cubature formulas of calculation of IHOF both in the classical formulation of the problem and for interpolation classes of functions corresponding to the case when the information operator about the integrand is given by a fixed table of its values. Great attention is paid to the quality of the error estimates and the methods to obtain them. The monograph describes some aspects of the theory of algorithms-programs testing and presents the results of their quality testing against well-known and proposed numerical integration algorithms and estimations of their characteristics. The problem of determining the ranges of admissible values of control parameters of programs for calculating integrals with the required accuracy, as well as their best values for integration with the minimal possible error, is considered for programs calculating a priori estimates of characteristics. In the last part the developed computer technology of calculation of IHOF with the set values of quality characteristics on accuracy and speed is presented. For researchers, graduate students, senior students and specialists involved in the development of algorithmic and software solutions to problems related to the use of IHOF.We present a general theory of computation integrals of highly oscillatory functions (IHOF) in various classes of subintegral functions with the use of a net information operator on subintegral functions. The monograph considers the calculation of integrals involving the following functions as a kernel: exponential (Fourier transform and others), trigonometric, wavelets and Bessel functions. The proposed theory is based on the theory of calculations, theory of computational errors, general theory of optimal accuracy algorithms, algorithms for detecting and refining a priori information about the subintegral function and the theory of testing algorithms—programs. The theory allows us to derive and prove optimal (with respect to accuracy and (or) performance) and nearly optimal quadrature and cubature formulas of calculation of IHOF both in the classical formulation of the problem and for interpolation classes of functions corresponding to the case when the information operator about the integrand is given by a fixed table of its values. Great attention is paid to the quality of the error estimates and the methods to obtain them. The monograph describes some aspects of the theory of algorithms-programs testing and presents the results of their quality testing against well-known and proposed numerical integration algorithms and estimations of their characteristics. The problem of determining the ranges of admissible values of control parameters of programs for calculating integrals with the required accuracy, as well as their best values for integration with the minimal possible error, is considered for programs calculating a priori estimates of characteristics. In the last part the developed computer technology of calculation of IHOF with the set values of quality characteristics on accuracy and speed is presented. For researchers, graduate students, senior students and specialists involved in the development of algorithmic and software solutions to problems related to the use of IHOF.

30 September 2022 in Cybernetics and Computer Technologies
Verified
Journal Article
Open access
PDF file
VZValerii Zadiraka
Valerii Zadiraka
OKOleksandr Khimich
Oleksandr Khimich
ISInna Shvidchenko
Inna Shvidchenko
Introduction. The complexity of computational algorithms for solving typical problems of computational, applied, and discrete mathematics is analyzed from the perspective of the theory of computation, depending on the computer architecture and the used computing model: single-processor, multiprocessor, and quantum. The following classes of problems are considered: systems of linear algebraic equations, the Cauchy problem for systems of ordinary differential equations, numerical integration, boundary value problems for ordinary differential equations, factorization of numbers, finding the discrete logarithm of a number in multiplicative integer groups, searching for the necessary record in an unordered database, etc. The purposes of the paper are: 1. To investigate how the computational complexity depends on the computer architecture and the computational model. 2. To show that the construction of the computational process under the given conditions of calculations is related to the solution of the following problems: – the existence ε-solution to the problem; – the existence of T-effective computing algorithms; – the possibility of building a real computing process under the given computing conditions. 3. To investigate the effect of rounding numbers on computational complexity (especially when solving problems of transcomputational complexity). 4. To give the complexity estimates and total error of the computational algorithm for a number of typical problems of computational, applied, and discrete mathematics. The results. The complexity estimates of computational algorithms of the listed classes of problems for single-processor, multiprocessor and quantum computing models are given. The main focus is on high-performance computing: using the principles of parallel data processing and quantum mechanics. Conclusions. The connection of complexity estimates of computational algorithms with the architecture of computers and models of calculations is demonstrated. The characteristics of the first quantum computers (2016 – 2022), which have gone beyond laboratory research, are given. Keywords: computer technologies, rounding error, sequential, parallel and quantum computing models, complexity estimate.

28 September 2015 in Cybernetics and Systems Analysis
Verified
Journal Article
Closed access
PDF file
VZV. K. Zadiraka
V. K. Zadiraka
AKANTON KUDIN
ANTON KUDIN
ISI. V. Shvidchenko
I. V. Shvidchenko
BBB. A. Bredelev
B. A. Bredelev

9 June 2024 in Cybernetics and Computer Technologies
Verified
Journal Article
Open access
PDF file
VZValerii Zadiraka
Valerii Zadiraka
ISInna Shvidchenko
Inna Shvidchenko
Introduction. The main attention is paid to the need to take into account estimates of rounding errors when solving problems of transcomputational complexity. Among such tasks, one can highlight the tasks of calculating systems of linear algebraic equations with the number of unknowns in the tens of millions, digital signal processing, calculating nuclear reactors, modeling physical and chemical processes, aerodynamics, information protection, etc. Ignoring the rounding error when solving them leads to the fact that sometimes we obtain computer solutions that do not correspond to the physical content of the problem. The purpose of the article. It is shown how, using estimates of rounding errors, to build computational algorithms resistant to rounding errors. At the same time, the following are taken into account: the rounding rule, the calculation mode, the quality of rounding error estimates (non-improving estimate, asymptotic estimate, imputed estimate). If computing resources are available, it is advisable to use asymptotic and probabilistic estimates as they are more accurate compared to majorant estimates. The results. It is shown how the estimates of rounding errors are used in modern computer technologies to obtain ε-solution of the following problems of applied mathematics: – calculation of integrals from fast oscillating functions; – solving problems of digital signal processing; – calculating the discrete Fourier transform; – multi-bit arithmetic; – computer steganography. The greatest attention is paid to T-effective algorithms for calculating the discrete Fourier transform and solving the problems of spectral and correlation analysis of random processes. These classes of problems are included as components in solving problems of two-key cryptography and computer steganography. Conclusions. The importance of taking into account estimates of rounding errors in modern computer technologies for solving a number of classes of computational and applied mathematics problems is shown. Keywords: rounding error, computer technology, discrete Fourier transform, integration of fast oscillating functions, information security.

30 September 2021 in Cybernetics and Computer Technologies
Verified
Journal Article
Open access
PDF file
VZValerii Zadiraka
Valerii Zadiraka
ISInna Shvidchenko
Inna Shvidchenko
Introduction. When solving problems of transcomputational complexity, the problem of evaluating the rounding error is relevant, since it can be dominant in evaluating the accuracy of solving the problem. The ways to reduce it are important, as are the reserves for optimizing the algorithms for solving the problem in terms of accuracy. In this case, you need to take into account the rounding-off rules and calculation modes. The article shows how the estimates of the rounding error can be used in modern computer technologies for solving problems of computational, applied mathematics, as well as information security. The purpose of the article is to draw the attention of the specialists in computational and applied mathematics to the need to take into account the rounding error when analyzing the quality of the approximate solution of problems. This is important for mathematical modeling problems, problems using Bigdata, digital signal and image processing, cybersecurity, and many others. The article demonstrates specific estimates of the rounding error for solving a number of problems: estimating the mathematical expectation, calculating the discrete Fourier transform, using multi-digit arithmetic and using the estimates of the rounding error in algorithms for solving computer steganography problems. The results. The estimates of the rounding error of the algorithms for solving the above-mentioned classes of problems are given for different rounding-off rules and for different calculation modes. For the problem of constructing computer steganography, the use of the estimates of the rounding error in computer technologies for solving problems of hidden information transfer is shown. Conclusions. Taking into account the rounding error is an important factor in assessing the accuracy of the approximate solution of problems of the complexity above average.