ISInna V. Shvidchenko

Inna V. Shvidchenko

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Inna V. Shvidchenko has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Elements of the general theory of optimal algorithms

    by V.K. Zadiraka, I.V. Shvidchenko

    A general scheme for estimating the total error of a computational algorithm is presented. Optimal algorithms are constructed under the conditions of the most complete use of available information about the problem. Reserves for optimization of calculations are considered. Keywords: computational algorithm, approximate solution, error of approximate solution, optimization of algorithms, reserves of calculations optimization, computer technologies.

  • Open Access

    S-Word Arithmetic and High Precision Calculations

    by V.M. Hlushkov Institute of Cybernetics of NAS of Ukraine, Valeriy Zadiraka, Andrii Tereshchenko, Inna Shvidchenko

    The intricacies of using S-word arithmetic, the influence of the value of the parameter S on the estimation of the rounding error are analyzed; what are high-precision calculations and where they are used. The problems of two-key cryptography, computer steganography and the problem of transcomputational complexity are considered as areas of application of S-word arithmetic. For the development of S-word arithmetic algorithms, sequential, parallel, quantum computing models are used, and systems of residual classes are used. The architectural features of the computer system for the implementation of an effective algorithm in various models of calculations are considered. For the parallel computing model, the importance of reducing the connected steps is indicated, which can increase the amount of processed data, but allows to involve a larger number of parallel processors. This approach is in conflict with a method that reduces the amount of processed data, and there is a need to maintain a balance between these two methods in a parallel computing model. For the quantum computing model, the connection of qubits is a key factor in determining the quantum volume. The physical scheme determines which pairs of qubits can be entangled in a quantum computer. Peculiarities of transferring algorithms to another computing model are considered. An analysis of the complexity of implementing S-word arithmetic operations in sequential, parallel, and quantum computing models is carried out. For the parallel computing model, the importance of reducing the connected steps is indicated, which can increase the amount of processed data, but allows to involve a larger number of parallel processors. This approach is in conflict with a method that reduces the amount of processed data, and there is a need to maintain a balance between these two methods in a parallel computing model. For the quantum computing model, the connection of qubits is a key factor in determining the quantum volume. The physical scheme determines which pairs of qubits can be entangled in a quantum computer. Information is provided about the ongoing scientific forum «Calculation optimization issues», the subject of which is closely related to the topic (1969-2023)


  • Open Access

    Methods of Combating the Accumulation of Rounding Error When Solving Problems of Trans-Computational Complexity

    by Valerii Zadiraka, 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.


  • Open Access

    Computer Technology for Construction ε-Solution of the Problem

    by Valerii Zadiraka, Inna Shvidchenko

    Introduction. Issues of selection and construction of computing resources and methods of their effective use to calculate an approximate solution of the problem with the given accuracy in a limited processor time are considered. The purpose of the article. Based on the analysis of the total error of the computational algorithm, to develop a computer technology (CT) for the construction and solution of the ε-problem and illustrate it on the problems of integrating rapidly oscillating functions and digital signal processing. The results. The general scheme for solving problems of applied and computational mathematics using computer technology is presented. Computer technology includes the formation of a certain set of computing resources, the method and conditions of their use to build a computing process, the result of which should be the solution of the problem. The main attention is paid to the choice of a computer calculations model (input data about the problem, the class of problems of computational mathematics, the class of computational algorithms for calculating the solution, evaluation of quality characteristics and parameters of the computational process, computer architecture, software, restrictions on the value of quality characteristics), the construction of quality characteristic estimates, the possibility of adjusting the mathematical model, the construction of the computational process and the performance of calculations. The issues of determining the optimal parameters of computational algorithms-programs for finding ε-solution are investigated, which are demonstrated on two classes of problems – integration of rapidly oscillating functions and correlation analysis of random processes. Conclusions. The issues of selection and construction of computing resources and methods of their effective use to calculate an approximate solution of the problem with the given accuracy in a limited processor time are considered. The elements of computer technology for solving specific problems on the examples of problems of integration of rapidly oscillating functions and correlation analysis of random processes are applied.

  • Theory of integrals computing from fast oscillating functions

    by Valeriy Zadiraka, Liliya Luts, 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.


  • Open Access

    Models of Computer Calculations

    by Valerii Zadiraka, Oleksandr Khimich, 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.


  • Open Access

    Using Rounding Errors in Modern Computer Technologies

    by Valerii Zadiraka, 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.