The Monotonicity Problem in Finding Roots of Polynomials by Kuhn's Algorithm

The Monotonicity Problem in Finding Roots of Polynomials by Kuhn's Algorithm

Year:    1983

Author:    Sen-Lin Xu, Ze-Ke Wang

Journal of Computational Mathematics, Vol. 1 (1983), Iss. 3 : pp. 203–210

Abstract

In this paper the problem proposed by Kuhn on the presence of a monotonicity property related to the Kuhn's algorithm for finding roots of a polynomials is solved in the affirmative. Furthermore, an estimate of the threshold number D in the above-mentioned monotonicity problem expressed in terms of the complex coefficients of the polynomial is obtained.

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/1983-JCM-9696

Journal of Computational Mathematics, Vol. 1 (1983), Iss. 3 : pp. 203–210

Published online:    1983-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    8

Keywords:   

Author Details

Sen-Lin Xu

Ze-Ke Wang