A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis (Q2479468): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis |
scientific article |
Statements
A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis (English)
0 references
26 March 2008
0 references
successive differentiation
0 references
Bernstein basis
0 references
Newton method
0 references
numerical examples
0 references
surface/curve intersection
0 references
high degree polynomial equation
0 references
two-steps algorithm
0 references
global convergence
0 references
complexity
0 references
