Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 81, 2004 - Issue 12
Submit an article Journal homepage
34
Views
0
CrossRef citations to date
0
Altmetric
Miscellany

A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial

S. Brahma
,
P. H. D. Ramakrishna
&
S. Prasant Pal
Pages 1549-1557 | Accepted 18 Feb 2004, Published online: 25 Jan 2007

  • Smale, S, (1981). The Fundamental Theorem of Algebra and Complexity Theory, Bull. Amer. Math. Soc. 4 ((1981)), pp. 1–36.
  • Pan, VY, (1997). Solving a polynomial equation: Some history and recent progress, SIAM Review 39 (2) ((1997)), p. pp. 187–220.
  • Pan, VY, (2000). Approximating Complex Polynomial Zeros: Modified Weyl's Quad-tree Construction and Improved Newton's Iteration, J. of Complexity 16 ((2000)), pp. 213–264.
  • Madsen, K, (1973). A root-finding algorithm based on Newton's method, BIT 13 ((1973)), pp. 71–75.
  • Smith, BT, (1967). "ZERPOL, a zero finding algorithm for polynomials using Laguerre's method". In: Proc. 1967 Army Numerical Analysis Conference. Durham, N.C.. (1967). p. pp. 153–174, Madison, Wis., Nov 1967),, May.
  • Jenkins, MA, and Traub, JF, (1972). Algorithm 419: Zeros of a complex polynomial, Comm. ACM 15 ((1972)), pp. 97–99.
  • Petkovic, MS, Herceg, D, and Ilic, S, (1998). Point estimation and some application to iterative methods, BIT 38 ((1998)), pp. 111–128.
  • Henrici, P, (1974). Applied and Computational Complex Analysis, John Wiley and Sons. Vol. Vol. 1.. New York. (1974).
  • Gargantini, G, and Henrici, P, (1972). Circular arithmetic and the determination of polynomial zeros, Numer. Math. 18 ((1972)), pp. 305–320.
  • Smith, BT, (1970). Error bounds for zeros of a polynomial based upon Gerschgorin's theorem, Journal of ACM 17 (4) ((1970)), pp. 661–674, October..
  • Carstensen, C, (1991). Inclusion of the roots of a polynomial based on Gerschgorin's theorem, Numer. Math. 59 ((1991)), pp. 349–360.
  • Braess, D, and Hadeler, KP, (1973). Simultaneous inclusion of the zeros of a polynomial, Numer. Math. 21 ((1973)), pp. 161–165.
  • Neumaier, A, (2003). Enclosing clusters of zeros of polynomials, J. of Comput. and Appl. Math. 156 ((2003)), pp. 389–401.
  • Rump, SM, (2003). Ten methods to bound multiple roots of polynomials, J. of Comput. Appl. Math. 156 ((2003)), pp. 403–432.
  • Elsner, L, (1973). A remark on the simultaneous inclusions of the zeros of a polynomial by Gerschgorin's theorem, Numer. Math. 21 ((1973)), pp. 425–427.
  • Ahlfors, LV, (1979). Complex Analysis, McGraw-Hill International Edition. (1979).
  • Rouche, E, (1862). Memoire sur la serie de lagrange, Journal of Ecole Polytec 22 ((1862)), pp. 217–218.
  • Ramakrishna, PHD, (2000). "Bounding errors in the computation of trigonometric functions and roots of polynomials". In: M. Tech. (Master's Thesis), Department of Computer Science and Engineering, Indian Institute of Technology. Kharagpur 721302, India. (2000).
  • Ramakrishna, PHD, Pal, SP, Bhalla, S, Basu, H, and Singh, SK, (2002). "Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials, to appear in the proceedings of the International Conference on Analysis and Discrete Structures (ICADS 2002)". IIT Kharagpur, India. (2002), December..
  • Press, WH, (2002). Numerical Recipes in C: The Art of Scientific Computing. (2002), et al., Second Edition,.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.