Computing curve intersection by means of simultaneous iterations (Q861738): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Dario Andrea Bini / rank | |||
Property / reviewed by | |||
Property / reviewed by: Vladimir Yu. Rovenskij / rank | |||
Revision as of 01:12, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing curve intersection by means of simultaneous iterations |
scientific article |
Statements
Computing curve intersection by means of simultaneous iterations (English)
0 references
30 January 2007
0 references
A new algorithm is proposed for computing the intersection of two plane curves given in rational parametric form [the general solution steps are described by \textit{J. Hoschek} and \textit{D. Lasser}, Fundamentals of computer aided geometric design (1993; Zbl 0788.68002)]. This approach avoids symbolic manipulations and is completely numerical. It relies on the Ehrlich-Aberth iteration complemented with some computational tools like the properties of Sylvester and Bézout matrices, a stopping criterion based on the concept of pseudo-zero, an inclusion result and the choice of initial approximations based on the Newton polygon. The algorithm is implemented as a Fortran 95 module. From the numerical experiments performed with a wide set of test problems it shows a better robustness and stability with respect to the Manocha-Demmel approach based on eigenvalue computation. In fact, the algorithm provides better approximations in terms of the relative error and performs successfully in many critical cases where the eigenvalue computation fails.
0 references
curve intersection
0 references
structured matrices
0 references
numerical algorithms
0 references
Sylvester resultant
0 references
Ehrlich-Aberth iteration
0 references
Sylvester and Bézout matrices
0 references
Newton polygon
0 references
numerical experiments
0 references