# Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

## Finding all solutions to a system of polynomial equationsHTML articles powered by AMS MathViewer

by Alden H. Wright
Math. Comp. 44 (1985), 125-133 Request permission

## Abstract:

Given a polynomial equation of degree d over the complex domain, the Fundamental Theorem of Algebra tells us that there are d solutions, assuming that the solutions are counted by multiplicity. These solutions can be approximated by deforming a standard nth degree equation into the given equation, and following the solutions through the deformation. This is called the homotopy method. The Fundamental Theorem of Algebra can be proved by the same technique. In this paper we extend these results and methods to a system of n polynomial equations in n complex variables. We show that the number of solutions to such a system is the product of the degrees of the equations (assuming that infinite solutions are included and solutions are counted by multiplicity)\$^\ast\$. The proof is based on a homotopy, or deformation, from a standard system of equations with the same degrees and known solutions. This homotopy provides a computational method of approximating all solutions. Computational results demonstrating the feasibility of this method are also presented.
References
Similar Articles
• Retrieve articles in Mathematics of Computation with MSC: 12D05, 65H10
• Retrieve articles in all journals with MSC: 12D05, 65H10