Horner's scheme for multidimensional-matrix polynomials
Numerical methods and programming, Tome 6 (2005) no. 1, pp. 61-65
Voir la notice de l'article provenant de la source Math-Net.Ru
Horner's scheme for evaluation of multidimensional-matrix polynomials of multidimensional-matrix arguments is considered. The numerical complexity of this scheme is analyzed.
Keywords:
Horner's scheme, numerical complexity.
Mots-clés : multidimensional-matrix polynomials
Mots-clés : multidimensional-matrix polynomials
@article{VMP_2005_6_1_a6,
author = {V. S. Mukha and K. S. Korchits},
title = {Horner's scheme for multidimensional-matrix polynomials},
journal = {Numerical methods and programming},
pages = {61--65},
publisher = {mathdoc},
volume = {6},
number = {1},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2005_6_1_a6/}
}
V. S. Mukha; K. S. Korchits. Horner's scheme for multidimensional-matrix polynomials. Numerical methods and programming, Tome 6 (2005) no. 1, pp. 61-65. http://geodesic.mathdoc.fr/item/VMP_2005_6_1_a6/