Computing curve intersection by means of simultaneous iterations

DOI10.1007/s11075-006-9048-0zbMath1111.65019OpenAlexW2064384667MaRDI QIDQ861738

Ana Marco, Dario Andrea Bini

Publication date: 30 January 2007

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-006-9048-0

zbMATH Keywords

Newton polygonnumerical experimentsSylvester resultantnumerical algorithmsstructured matricescurve intersectionEhrlich-Aberth iterationSylvester and Bézout matrices

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Computing the Signed Distance Between Overlapping Ellipsoids, The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Computing curve intersection by homotopy methods, Numerical Instability of Resultant Methods for Multidimensional Rootfinding, Computing the common zeros of two bivariate functions via Bézout resultants, The Sylvester and Bézout resultant matrices for blind image deconvolution, na25

Uses Software

• mctoolbox
• na20
• na10

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bernstein-Bézoutian matrices
• Numerical computation of polynomial zeros by means of Aberth's method
• Fast computation of determinants of Bézout matrices and application to curve implicitization
• Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves
• Improperly parametrized rational curves
• Initial approximations in Durand-Kerner's root finding method
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• An application of fast factorization algorithms in computer aided geometric design
• Root Neighborhoods of a Polynomial
• Algorithms for intersecting parametric and algebraic curves I
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Accuracy and Stability of Numerical Algorithms
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• Using polynomial interpolation for implicitizing algebraic curves