Zobrazeno 1 - 10
of 550
pro vyhledávání: '"rounding error"'
Autor:
Valerii Zadiraka, Inna Shvidchenko
Publikováno v:
Кібернетика та комп'ютерні технології, Iss 2, Pp 47-56 (2024)
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 eq
Externí odkaz:
https://doaj.org/article/4b862630f6d04fdca18fd005031b9171
Autor:
Valerii Zadiraka, Inna Shvidchenko
Publikováno v:
Кібернетика та комп'ютерні технології, Iss 1, Pp 35-47 (2023)
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 ar
Externí odkaz:
https://doaj.org/article/e2b8d92d5fc54884b68963b06695d053
Autor:
Haiyang Zhang, Chenglin Wen
Publikováno v:
Mathematics, Vol 12, Iss 8, p 1168 (2024)
The cubature Kalman filter (CKF) cannot accurately estimate the nonlinear model, and these errors will have an impact on the accuracy. In order to improve the filtering performance of the CKF, this paper proposes a new CKF method to improve the estim
Externí odkaz:
https://doaj.org/article/60087ad63aaa489c998b98a0b730cb6a
Publikováno v:
Кібернетика та комп'ютерні технології, Iss 2, Pp 38-51 (2022)
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 us
Externí odkaz:
https://doaj.org/article/7dafc2d19a324fb38329a5c139a6d4cf
Autor:
Olena Kolomys, Liliya Luts
Publikováno v:
Кібернетика та комп'ютерні технології, Iss 2, Pp 52-57 (2022)
Introduction. Fast algorithms for solving problems of spectral and correlation analysis of random processes began to appear mainly after 1965, when the algorithm of fast Fourier transform (FFT) entered computational practice. With its appearance, a n
Externí odkaz:
https://doaj.org/article/a5bbf01b54934947bbc870a60fd797d9
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ran Etgar, Sarit Freund
Publikováno v:
Heliyon, Vol 9, Iss 3, Pp e13655- (2023)
Measurements can often be imprecise and subjected to rounding-off. Typically, this rounding-off is ignored and assumed to have little to no effect. However, when the measuring scale step is not negligible, it may affect statistical control tools such
Externí odkaz:
https://doaj.org/article/daaead31b4d142a0833fae9286c07b35
Autor:
Nobuhiro Sanko, Naotaka Iriguchi
Publikováno v:
Transportation Research Interdisciplinary Perspectives, Vol 16, Iss , Pp 100698- (2022)
Data reported by respondents often include rounding errors. In travel surveys, people do not report their exact departure or arrival times, and they often round the times to nearest multiples of 5, 10, 15, 30, and 60 min. Previous studies have estima
Externí odkaz:
https://doaj.org/article/2c7f831f3e4940a0a828d4fb41a1ed81
Autor:
Valerii Zadiraka, Inna Shvidchenko
Publikováno v:
Кібернетика та комп'ютерні технології, Iss 3, Pp 43-52 (2021)
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 th
Externí odkaz:
https://doaj.org/article/5500ecb005d9487cbb9d7cce4cc60d1a