ON THE CONVERGENCE Of SOME INTERVAL METHODS FOR SIMULTANEOUS COMPUTATION OF POLYNOMIAL ZEROS

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.79, Iss.10, 2002-01, pp. : 1099-1111

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

On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros

By Petković M. Milošević D.

International Journal of Computer Mathematics, Vol. 83, Iss. 3, 2006-03 ,pp. : 299-317

Taylor & Francis Ltd

Access to resources Recommend Favorite

Higher-order simultaneous methods for the determination of polynomial multiple zeros

By Petkovi

International Journal of Computer Mathematics, Vol. 80, Iss. 11, 2003-11 ,pp. : 1407-1427

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros

By Ikhile M.N.O.

International Journal of Computer Mathematics, Vol. 80, Iss. 12, 2003-12 ,pp. : 1505-1519

Taylor & Francis Ltd

Access to resources Recommend Favorite

Sorting-based localization and stable computation of zeros of a polynomial. I

By Romm Ya.

Cybernetics and Systems Analysis, Vol. 43, Iss. 1, 2007-01 ,pp. : 139-154

Springer Publishing Company

Access to resources Recommend Favorite

Sorting-based localization and stable computation of zeros of a polynomial. II

By Romm Ya.

Cybernetics and Systems Analysis, Vol. 43, Iss. 2, 2007-03 ,pp. : 291-302

Springer Publishing Company

Access to resources Recommend Favorite