Computing curve intersection by means of simultaneous iterations
From MaRDI portal
Publication:861738
DOI10.1007/s11075-006-9048-0zbMath1111.65019MaRDI QIDQ861738
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
Newton polygon; numerical experiments; Sylvester resultant; numerical algorithms; structured matrices; curve intersection; Ehrlich-Aberth iteration; Sylvester and Bézout matrices
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
Uses Software
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
