Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon-Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas re
Fast computation of determinants of Bézout matrices and application to curve implicitization
✍ Scribed by Steven Delvaux; Ana Marco; José-Javier Martı´nez; Marc Van Barel
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 134 KB
- Volume
- 430
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The umbral calculus is used to generalize Bernstein polynomials and Bézier curves. This adds great geometric flexibility to these fundamental objects of computer aided geometric design while retaining their basic properties.
[146][147][148][149][150][151][152][153][154][155][156][157][158] defined certain period matrices whose entries are Euler-type integrals representing hypergeometric functions of several variables and derived remarkable closed-form expressions for the determinants of those matrices. In this article,