Abstract
The expansion base algorithm, which was devised by Abhyankar, Kuo and McCallum is very efficient for analytic factorization of bivariate polynomials. The author had extended it to more than two variables but it was only for polynomials with non-vanishing leading coefficient at the expansion point. In this paper, we improve it to be able to apply to polynomials including the case of vanishing leading coefficient, that is, singular leading coefficient, which comes to a specific problem only for more than two variables.
A part of this work was supported by JSPS. Grant-in-Aid for Scientific Research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abhyankar, S.S.: What is the difference between a parabola and a hyperbola? Math. Intelligencer 10, 37–43 (1988)
Abhyankar, S.S.: Irreducibility Criterion for Germs of Analytic Functions of Two Complex Variables. Advances in Math. 74, 190–257 (1989)
S. S. Abhyankar: Algebraic Geometry for Scientists and Engineers. In: Mathematical Surveys and Monographs. vol. 35, Amarican Mathematical Society, Providence, RI (1990)
Abhyankar, S.S., Moh, T.T.: Newton-Puiseux expansion and generalized Tschirnhausen transformation II. J. reine und angew. Math. 261, 29–54 (1973)
Iwami, M.: Analytic Factorization of the Multivariate Polynomial. In: Proceedings of the Sixth International Workshop on Computer Algebra in Scientific Computing. pp. 213–225 (2003)
Iwami, M.: Extension of Expansion Base Algorithm to Multivariate Analytic Factorizaion. In: Proceedings of the Seventh International Workshop on Computer Algebra in Scientific Computing, pp. 269–281 (2004)
Iwami, M.: Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient. ACM SIGSAM Bulletin 39(4), 122–126 (2005)
Kuo, T.C.: Generalized Newton-Puiseux Theory and Hensel’s Lemma in C[[x,y]]. Can. J. Math., XLI(6), 1101–1116 (1989)
McCallum, S.: On Testing a Bivariate Polynomial for Analytic Reducibility. J. Symb. Comput. 24, 509–535 (1997)
Sasaki, T., Inaba, D.: Hensel Construction of \(\rm F(x,u_1,\dots,u_l),\ l \geq 2\), at a Singular Point and Its Applications. SIGSAM Bulletin 34, 9–17 (2000)
Sasaki, T., Kako, F.: Solving Multivariate Algebraic Equation by Hensel Construction. Japan J. Indus. Appl. Math. 16, 257–285 (1999)
Sasaki, T.: Properties of Extended Hensel Factors and Application to Approximate Factorization. Preprint, Univ. Tsukuba (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwami, M. (2007). A Unified Algorithm for Multivariate Analytic Factorization. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2007. Lecture Notes in Computer Science, vol 4770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75187-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-75187-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75186-1
Online ISBN: 978-3-540-75187-8
eBook Packages: Computer ScienceComputer Science (R0)