Abstract
The paper considers the problem of computing zeros of scalar polynomials in several variables. The zeros of a polynomial are subdivided into the regular (eigen-and mixed) zeros and the singular ones. An algorithm for computing regular zeros, based on a decomposition of a given polynomial into a product of primitive polynomials, is suggested. The algorithm is applied to solving systems of nonlinear algebraic equations. Bibliography: 5 titles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. L. Van-der Varden, Algebra, Nauka, Moscow (1976).
V. N. Kublanovskaya and V. B. Khazanov, “Relative factorization of scalar polynomials in several variables,” J. Vychisl. Mat. Mat. Fiz., 36, No. 8, 6–13 (1996).
V. N. Kublanovskaya, “An approach to solving multiparameter problems,” Zap. Nauchn. Semin. POMI, 229, 191–246 (1995).
V. N. Kublanovskaya, “To solving multiparameter problems of algebra. 2. The method of partial relative factorization and its applications,” Zap. Nauchn. Semin. POMI, 296, 89–107 (2003).
V. N. Kublanovskaya, “To solving multiparameter problems of algebra. 5. The ΔV-q factorization algorithm and its applicatons,” Zap. Nauchn. Semin. POMI, 309, 144–153 (2004).
Author information
Authors and Affiliations
Corresponding author
Additional information
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 346, 2007, pp. 119–130.
Rights and permissions
About this article
Cite this article
Kublanovskaya, V.N. To solving multiparameter problems of algebra. 10. Computing zeros of a scalar polynomial. J Math Sci 150, 1982–1988 (2008). https://doi.org/10.1007/s10958-008-0113-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10958-008-0113-1