Year: 1985
Journal of Computational Mathematics, Vol. 3 (1985), Iss. 2 : pp. 161–166
Abstract
Under an assumption of distribution on zeros of the polynomials, we have given the estimate of computational cost for the resultant method. The result in that, in probability $1-\mu$, the computational cost of the resultant method for finding $ε$-approximations of all zeros is at most $$cd^2(log d+log\frac{1}{\mu}+loglog\frac{1}ε)$$, where the cost is measured by the number of f-evaluations. The estimate of cost can be decreased to $c(d^2logd+d^2log\frac{1}{\mu}+dloglog\frac{1}ε)$ by combining resultant method with parallel quasi-Newton method.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1985-JCM-9613
Journal of Computational Mathematics, Vol. 3 (1985), Iss. 2 : pp. 161–166
Published online: 1985-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6