scientific article; zbMATH DE number 440790

zbMATH Open0784.65042MaRDI QIDQ3140959FDOQ3140959

Authors: Neli Dimitrova, Svetoslav Markov 

Publication date: 29 March 1994

Title of this publication is not available (Why is that?)

Recommendations

• On The Convergence Of Some Interval Methods For Simultaneous Computation Of Polynomial Zeros
• scientific article; zbMATH DE number 3435009
• An algorithm for the simultaneous inclusion of real polynomial zeros
• The fast and parallel Halley algorithm for finding all zeros of a polynomial
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• scientific article; zbMATH DE number 1859224
• Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
• scientific article; zbMATH DE number 2098030
• Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial
• On an efficient simultaneous method for finding polynomial zeros

zbMATH Keywords

polynomialquadratic convergenceresult verificationiterative Newton-like interval-arithmetic algorithmsreal simple zeros

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Interval and finite arithmetic (65G30)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sorting-based localization and stable computation of zeros of a polynomial. II.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140959)