On computer algebra procedures for a linear least squares problem with linear constraints
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 2, pp. 206-212
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_2004_44_2_a1,
author = {Kh. D. Ikramov and M. Matin far},
title = {On computer algebra procedures for a linear least squares problem with linear constraints},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {206--212},
year = {2004},
volume = {44},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_2_a1/}
}
TY - JOUR AU - Kh. D. Ikramov AU - M. Matin far TI - On computer algebra procedures for a linear least squares problem with linear constraints JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2004 SP - 206 EP - 212 VL - 44 IS - 2 UR - http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_2_a1/ LA - ru ID - ZVMMF_2004_44_2_a1 ER -
%0 Journal Article %A Kh. D. Ikramov %A M. Matin far %T On computer algebra procedures for a linear least squares problem with linear constraints %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 2004 %P 206-212 %V 44 %N 2 %U http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_2_a1/ %G ru %F ZVMMF_2004_44_2_a1
Kh. D. Ikramov; M. Matin far. On computer algebra procedures for a linear least squares problem with linear constraints. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 2, pp. 206-212. http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_2_a1/
[1] Ikramov Kh. D., Matin far M., “O kompyuterno-algebraicheskikh protsedurakh dlya psevdoobrascheniya matrits”, Zh. vychisl. matem. i matem. fiz., 43:2 (2003), 163–168 | MR | Zbl
[2] Louson Ch., Khenson R., Chislennoe reshenie zadach metoda naimenshikh kvadratov, Nauka, M., 1986 | MR
[3] Voevodin V. V., Kuznetsov Yu. A., Matritsy i vychisleniya, Nauka, M., 1984 | MR | Zbl
[4] Khoury R. N., “Closest matrices in the space of generalized doubly stochastic matrices”, J. Math. Analys. and Appl., 222:2 (1998), 562–568 | DOI | MR | Zbl