Solving multivariate algebraic equation by Hensel construction
Tóm tắt
Từ khóa
Tài liệu tham khảo
O. Aberth, Iterative method for finding all zeros of a polynomial simultaneously. Math. Comp.,27 (1973), 339–344.
E. Durand, Solutions numeriques des equations algébriques Tom 1: equation du tupe F(x) = 0. Racines d’um Polnome Masson, Paris, 1960.
D. Duval, Rational Puiseux expansions. Compos. Math.,70 (1989), 119–154.
K.O. Geddes, S.R. Czapor and G. Labahn, Algorithms for Computer Algebra. Kluwer Academic Pub., Boston-Dordrecht-London, 1992.
K. Hensel, Theorie der algebraischen Zahlen. Teubner, Berlin, 1908.
M. Iri, Numerical computation (in Japanese). Asakura Shoten, Tokyo, 1981.
I.O. Kerner, Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polnomen. Numer. Math.,8 (1966), 290–294.
M. Lauer, Computing by homomorphic images. Computer Algebra, Symbolic and Algebraic Computation (eds. B. Buchberger, G.E. Collins and R. Loos), Springer-Verlag, Wien-New York, 1982.
V.A. Puiseux, Recherches sur les functions algébriques. J. Math.,15 (1850), 365–480.
T. Sasaki, T. Kitamoto and F. Kako, Error analysis of power series roots of multivariate algebraic equation. Preprint of Univ. Tsukuba, March 1994, 30 pages.
T. Sasaki and M. Sasaki, A unified method for multivariate polynomial factorization. Japan J. Indust. Appl. Math.,10 (1993), 21–39.
K. Shiihara and T. Sasaki, Analytic continuation and Riemann surface determination of algebraic functions by computer. Japan J. Indust. Appl. Math.,13 (1996), 107–116.
T. Sasaki, M. Suzuki, M. Kolář and M. Sasaki, Approximate factorization of multivariate polynomials and absolute irreducibility testing. Japan J. Indus. Appl. Math.,8 (1991), 357–375.
B. Wall, Puiseux expansion and annotated bibliography. Technical Report, RISC-Linz Series No. 91-46.0, Oct. 1991.
P.S. Wang, Parallel p-adic constructions in the univariate polynomial factoring algorithm. Proc. 1979 MACSYMA Users’ Conference, MIT Lab. Comp. Sci., MIT Boston, 1979, 310–318.