On Adaptive Haar Approximations of Random Flows
| Autor: | Yu. K. Dem’yanovich |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
0209 industrial biotechnology
020901 industrial engineering & automation Computer science Approximations of π 020209 energy Signal Processing 0202 electrical engineering electronic engineering information engineering Haar Applied mathematics 02 engineering and technology Electrical and Electronic Engineering |
| Zdroj: | International Journal of Circuits, Systems and Signal Processing. 15:72-79 |
| ISSN: | 1998-4464 |
| DOI: | 10.46300/9106.2021.15.9 |
| Popis: | The adaptive approximations for some characteristic of random functions defined on arbitrary irregular grids are discussed in this paper. The mentioned functions can be examined as flows of random real values associated with an irregular grid. This paper considers the question of choosing an adaptive enlargement of the initial grid. The mentioned enlargement essentially depends on the formulation of the criterion in relation to which adaptability is considered. Several criteria are considered here, among which there are several criteria applicable to the processing of random flows. In particular, the criteria corresponding to the mathematical expectation, dispersion, as well as autocorrelation and cross-correlation of two random flows are considered. It is possible to consider criteria corresponding to various combinations of the mentioned characteristics. The number of knots of the initial (generally speaking, irregular) grid can be arbitrary, and the main grid can be any subset of the initial one. Decomposition algorithms are proposed, taking into account the nature of the changes in the initial flow. The number of arithmetic operations in the proposed algorithms is proportional to the length of the initial flow. Sequential processing of the initial flow is possible in real time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|