Operations with scalar polynomials and their computer realization
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part X, Tome 219 (1994), pp. 158-175
Cet article a éte moissonné depuis la source Math-Net.Ru
In this paper algorithms realizing some operations with scalar polynomials in one and two variables and their computer realization are suggested. The following operations are considered: 1) the computation of the GCD for given scalar polynomials and factorization of each polynomial into the product of two factors: the first factor is the GCD, the second is formed of relativily prime polynomials; 2) the division of polynomials by their common divisor; 3) the decomposition of polynomials in two variables polynomial into irreducible factors; 4) the computation of the LCM for given scalar polynomials. Bibliography: 5 titles.
@article{ZNSL_1994_219_a6,
author = {V. N. Kublanovskaya and V. N. Simonova},
title = {Operations with scalar polynomials and their computer realization},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {158--175},
year = {1994},
volume = {219},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1994_219_a6/}
}
V. N. Kublanovskaya; V. N. Simonova. Operations with scalar polynomials and their computer realization. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part X, Tome 219 (1994), pp. 158-175. http://geodesic.mathdoc.fr/item/ZNSL_1994_219_a6/