scientific article; zbMATH DE number 6454113

DOI10.3969/J.ISSN.1005-3085.2014.06.012zbMATH Open1324.65080MaRDI QIDQ5260800

Author name not available (Why is that?)

Publication date: 29 June 2015

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

zbMATH Keywords

multiplicitynumerical experimentsparallel computationzeros of a polynomialconvergence ordermultiple zerossimultaneous method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Related Items (3)

Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial ⋮ Title not available (Why is that?) ⋮ Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros

Recommendations

• Some parallel methods for polynomial root-finding 👍 👎
• A general method to generate parallel iterations for finding all zeros of polynomial simultaneously 👍 👎
• Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros 👍 👎
• A globally convergent parallel algorithm for zeros of polynomial systems 👍 👎
• Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q5260800)