|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2005, Volume 45, Number 6, Pages 1134–1145
(Mi zvmmf648)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Algebra over estimation algorithms: the minimal degree of correct algorithms
A. G. D'yakonov Faculty of Computational Mathematics and Cybernetics, Moscow State University, Leninskie gory, Moscow, 119992, Russia
Abstract:
Basic constructs of the algebraic theory of corrections of estimation algorithms are described. Algorithms belonging to algebraic closures are represented using linear combinations of simple operators. The case of the general proximity function is considered, and an unimprovable bound on the degree of a correct algorithm is obtained.
Key words:
estimation algorithms, correct algorithms, minimal degree, algebraic theory.
Received: 11.11.2004
Citation:
A. G. D'yakonov, “Algebra over estimation algorithms: the minimal degree of correct algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 45:6 (2005), 1134–1145; Comput. Math. Math. Phys., 45:6 (2005), 1095–1106
Linking options:
https://www.mathnet.ru/eng/zvmmf648 https://www.mathnet.ru/eng/zvmmf/v45/i6/p1134
|
Statistics & downloads: |
Abstract page: | 386 | Full-text PDF : | 201 | References: | 48 | First page: | 1 |
|