A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis (Q2479468): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.matcom.2007.08.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2044271352
@@ Property / OpenAlex ID: W2044271352 / rank @@
+Normal rank
@@ Property / cites work @@
+Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
+Normal rank
@@ Property / cites work @@
+Algorithms for polynomials in Bernstein form
@@ Property / cites work: Algorithms for polynomials in Bernstein form / rank @@
+Normal rank
@@ Property / cites work @@
+A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
+Normal rank
@@ Property / cites work @@
+Recursive de Casteljau bisection and rounding errors
+Normal rank
@@ Property / cites work @@
+A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
+Normal rank
@@ Property / cites work @@
+On the complexity of isolating real roots and computing with certainty the topological degree
+Normal rank
@@ Property / cites work @@
+Solving a Polynomial Equation: Some History and Recent Progress
+Normal rank
@@ Property / cites work @@
+The evaluation of the zeros of ill-conditioned polynomials. I, II
+Normal rank