Fast approach for computing roots of polynomials using cubic clipping (Q625270): 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.cagd.2009.02.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2119186760
@@ Property / OpenAlex ID: W2119186760 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing roots of polynomials by quadratic clipping
+Normal rank
@@ Property / cites work @@
+Q4858543
@@ Property / cites work: Q4858543 / rank @@
+Normal rank
@@ Property / cites work @@
+The dual basis functions for the Bernstein polynomials
+Normal rank
@@ Property / cites work @@
+Q4494289
@@ Property / cites work: Q4494289 / rank @@
+Normal rank
@@ Property / cites work @@
+A bibliography on roots of polynomials
@@ Property / cites work: A bibliography on roots of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient isolation of polynomial's real roots.
@@ Property / cites work: Efficient isolation of polynomial's real roots. / rank @@
+Normal rank
@@ Property / cites work @@
+Curve intersection using Bézier clipping
@@ Property / cites work: Curve intersection using Bézier clipping / rank @@
+Normal rank