Examining a mathematical apparatus of Z-approximation of functions for the construction of an adaptive algorithm

Authors

  • Olha Kryazhych Institute of Telecommunications and Global Information Space Chokolovsky blvd., 13, Kуiv, Ukraine, 03186 Institute of Technology and Business in České Budějovice Okružní 517/10, 370 01 České Budějovice, Czech Republic, Ukraine https://orcid.org/0000-0003-1845-5014
  • Oleksandr Kovalenko Institute for Nuclear Research of National Academy of Sciences of Ukraine Nauky ave., 47, Kyiv, Ukraine, 03680, Ukraine https://orcid.org/0000-0002-3406-8770

DOI:

https://doi.org/10.15587/1729-4061.2019.170824

Keywords:

search algorithm, process distribution, recurrence record, residual, approximation

Abstract

The result of this research is the proposed to mathematical apparatus and a procedure for constructing adaptive algorithm based on Z-approximation of functions. A given study is required to improve approaches to constructing algorithms that change their performance in response to changes in input information. This, in turn, significantly improves results in solving the problems that can be implemented using such an algorithm. For example, solving nonlinear problems, description of complex surfaces, search for information.

It has been shown that the solutions derived in the current study are in agreement with the application of the same algorithms for separate groups of functions used for approximation. These functions are used when constructing a direction to search for and provide an opportunity to build a model of error in Z-approximation using the initial or final approximations.

The definition of Zm-approximation has been given as the approximation with a multiple interval reduction that simplifies recurrent formulae and is a feature of the presented approach. The proposed methodology and the basic algorithm make it possible to directly determine a series of common and hyperbolic functions using Zm-approximations and parallel computing. Based on the research results, an adaptive algorithm has been presented to calculate arctg x as a function inverse to tg x.

The above can be used when constructing an adaptive search algorithm in the arrays of unstructured or poorly structured information. Such a search is employed for books and textbooks, uploaded to the Internet in formats jpeg, pdf, or as fragments of the specified formats. In this case, based on the adaptive algorithm, a special model is constructed, which can be implemented according to several variants with a change in direction.

Author Biographies

Olha Kryazhych, Institute of Telecommunications and Global Information Space Chokolovsky blvd., 13, Kуiv, Ukraine, 03186 Institute of Technology and Business in České Budějovice Okružní 517/10, 370 01 České Budějovice, Czech Republic

PhD, Senior Researcher

Researcher

Oleksandr Kovalenko, Institute for Nuclear Research of National Academy of Sciences of Ukraine Nauky ave., 47, Kyiv, Ukraine, 03680

PhD, Head of Laboratory

Laboratory of Physical and Technical Problems of Nuclear Radiation Sources

References

  1. Glushkov, V. M. et. al. (Eds.) (1974). Entsiklopediya kibernetiki. Kyiv: Glavnaya redaktsiya ukrainskoy sovetskoy entsiklopedii, 1228.
  2. Filosofskyi entsyklopedychnyi slovnyk (2002). Kyiv: Abrys, 742.
  3. Shennon, K. (1963). Raboty po teorii informatsii i kibernetike. Moscow: Inostrannaya literatura, 832.
  4. Spink, A., Wolfram, D., Jansen, M. B. J., Saracevic, T. (2001). Searching the web: The public and their queries. Journal of the American Society for Information Science and Technology, 52 (3), 226–234. doi: https://doi.org/10.1002/1097-4571(2000)9999:9999<::aid-asi1591>3.0.co;2-r
  5. Figueroa, A. (2015). Exploring effective features for recognizing the user intent behind web queries. Computers in Industry, 68, 162–169. doi: https://doi.org/10.1016/j.compind.2015.01.005
  6. Ashmanov, I., Ivanov, A. (2011). Optimizatsiya i prodvizhenie saytov v poiskovyh sistemah. Sankt-Peterburg: Piter, 464.
  7. Glushkov, V. M.; Mihalevich, V. S. et. al. (Eds.) (1990). Kibernetika. Vychislitel'naya tekhnika. Informatika. Izbrannye trudy. Vol. 3. Kibernetika i ee primenenie v narodnom hozyaystve. Kyiv: Naukova dumka, 224.
  8. Glushkov, V. M. (1986). Kibernetika. Voprosy teorii i praktiki. Moscow: Nauka, 488.
  9. Glushkov, V. M., Stogniy, A. A., Afanas'ev, V. N. (1973). Avtomatizirovannye informatsionnye sistemy. Moscow: Znanie, 64.
  10. Akademik, V. M. (2003). Glushkov – pioner kibernetiki. Kyiv: Izdatel'stvo Yunior, 384.
  11. Glushkov, V. M. (1987). Osnovy bezbumazhnoy informatiki. Moscow: Nauka, Gl. Red. fiz.-mat. lit., 552.
  12. Pleskach, V. L, Zatonatska, T. H. (2011). Informatsiyni systemy i tekhnolohiyi na pidpryiemstvakh. Kyiv: Znannia, 718.
  13. Hazewinkel, M. (Ed.) (1994). Encyclopaedia of Mathematics (set). Springer.
  14. Kovalenko, O. V. (2016). Kontseptualni osnovy stvorennia bazy danykh naukovoho eksperymentu ta sposterezhennia. Matematychni mashyny i systemy, 2, 91–101.
  15. Diaz, F. (2008). Autocorrelation and Regularization of Query-Based Retrieval Scores. Chap. 3. Amherst.
  16. Beer, S. (1972). Brain of the Firm, Allen Lane. London: Herder and Herder, 416.
  17. Beer, S. (1993). Designing Freedom. House of Anansi Press, 110.
  18. Algorithms and Data Structures. Available at: https://people.inf.ethz.ch/wirth/AD.pdf
  19. Knuth, D. E. (1997). The Art of Computer Programming. Vo. 1. Fundamental Algorithms. Reading, Massachusetts: Addison-Wesley, 664.
  20. Kriazhych, O. O., Kovalenko, O. V., Ivanchenko, V. V. (2016). Sposib opysu zabrudnenoi terytoriyi: prohramna realizatsiya. Matematychne modeliuvannia v ekonomitsi, 2, 22–35.
  21. Zoutendijk, G. (1960). Methods of feasible directions. A study in linear and non-linear programming. Elsevier Pub. Co., 178.
  22. Wang, S., Kang, J., Degano, M., Buticchi, G. (2019). A Resolver-to-Digital Conversion Method Based on Third-Order Rational Fraction Polynomial Approximation for PMSM Control. IEEE Transactions on Industrial Electronics, 66 (8), 6383–6392. doi: https://doi.org/10.1109/tie.2018.2884209
  23. Knuth, D. E. (1998). The Art of Computer Programming. Vol. 3: Sorting and Searching. Reading, Massachusetts: Addison-Wesley, 780.
  24. Eyler, L. (1956). Integral'noe ischislenie. Vol. 1. Moscow: GITTL, 416.
  25. Bahvalov, N. S., Zhidkov, N. P., Kobel'kov, G. M. (2008). Chislennye metody. Moscow: BINOM. Laboratoriya znaniy, 636.
  26. Popov, B. A., Tesler, G. S. (1980). Priblizhenie funktsiy dlya tekhnicheskih prilozheniy. Kyiv: Naukova dumka, 352.
  27. Vyshnevskyi, I. M., Haidar, H. P., Kovalenko, O. V. et. al. (2014). Radiatsiyni ta yaderni tekhnolohiyi v Instytuti yadernykh doslidzhen NAN Ukrainy. Kyiv: In-t yadernykh doslidzhen, 176.

Downloads

Published

2019-06-20

How to Cite

Kryazhych, O., & Kovalenko, O. (2019). Examining a mathematical apparatus of Z-approximation of functions for the construction of an adaptive algorithm. Eastern-European Journal of Enterprise Technologies, 3(4 (99), 6–13. https://doi.org/10.15587/1729-4061.2019.170824

Issue

Vol. 3 No. 4 (99) (2019): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2019 Olha Kryazhych, Oleksandr Kovalenko

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.