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

Author： S. Brahma P. H. D. Ramakrishna S. Prasant Pal

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.81, Iss.12, 2004-12, pp. : 1549-1557

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)

By Chistov A.

Journal of Mathematical Sciences, Vol. 174, Iss. 1, 2011-04 ,pp. : 71-89

Springer Publishing Company

Access to resources Recommend Favorite

Approximate Formulas for Zero-coupon Bonds

By Tourrucôo Fabricio Hagan Patrick S. Schleiniger Gilberto F.

Applied Mathematical Finance, Vol. 14, Iss. 3, 2007-07 ,pp. : 207-226

Routledge Ltd

Access to resources Recommend Favorite

Newton’s Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound

By Li Qingna Li Donghui Qi Houduo

Journal of Optimization Theory and Applications, Vol. 147, Iss. 3, 2010-12 ,pp. : 546-568

Springer Publishing Company

Access to resources Recommend Favorite

Convergence of Newton-Kantorovich Approximations to an Approximate Zero

By Cianciaruso Filomena

Numerical Functional Analysis and Optimization, Vol. 28, Iss. 5-6, 2007-05 ,pp. : 631-645

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Upper Bound on Derivative Errors in Lagrange Polynomial Approximation

STUDIES IN APPLIED MATHEMATICS, Vol. 38, Iss. 1, 1959-04 ,pp. : 327-330

John Wiley & Sons Inc

Access to resources Recommend Favorite