Geodesic
Decomposition and approximation of underdetermined data
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 34-36

Voir la notice de l'article provenant de la source Math-Net.Ru

For any underdetermined source, we consider its decomposition as product of sources generating symbols 0,1, and the indefinite symbol $*$. Also, we learn best approximate (in a prescribed sense) decomposition if correct decomposition is impossible. We prove that the best approximate decomposition always exists (for the decomposable source, it coincides with its decomposition), and it may be constructed by a polynomial algorithm. For some problems relating to simplifications and equivalent transformations of decompositions, polynomial algorithms are offered. In closing, we state that any underdetermined source has a decomposition in some more general form. 
@article{PDMA_2012_5_a17,
     author = {L. A. Sholomov},
     title = {Decomposition and approximation of underdetermined data},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {34--36},
     publisher = {mathdoc},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a17/}
}
TY  - JOUR
AU  - L. A. Sholomov
TI  - Decomposition and approximation of underdetermined data
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2012
SP  - 34
EP  - 36
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a17/
LA  - ru
ID  - PDMA_2012_5_a17
ER  - 
%0 Journal Article
%A L. A. Sholomov
%T Decomposition and approximation of underdetermined data
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2012
%P 34-36
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a17/
%G ru
%F PDMA_2012_5_a17
L. A. Sholomov. Decomposition and approximation of underdetermined data. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 34-36. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a17/