A companion matrix resultant for Bernstein polynomials

Linear Algebra and Its Applications

Volumn 362, Issue , 2003, Pages 153-175

  Winkler, Joab R ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Bernstein basis; Resultants

Indexed keywords

EID: 84867960648     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00486-X     Document Type: Article

References (22)

1. S. Barnett Polynomials and Linear Control Systems 1983 Marcel Dekker New York, USA
2. S. Barnett A Bezoutian matrix for Chebyshev polynomials IMA Conference on Applications of Matrix Theory 1988 The University of Bradford England
3. J.F. Canny The Complexity of Robot Motion Planning 1988 The MIT Press Cambridge, USA
4. A. Edelman, and H. Murakami Polynomial roots from companion matrix eigenvalues Math. Comput. 64 210 1995 763 776
5. R.T. Farouki, and T.N.T. Goodman On the optimal stability of the Bernstein basis Math. Comput. 65 216 1996 1553 1566
6. R.T. Farouki, and V.T. Rajan On the numerical condition of polynomials in Bernstein form Comput. Aided Geomet. Des. 4 1987 191 216
7. R.N. Goldman, T.W. Sederberg, and D.C. Anderson Vector elimination: a technique for the implicitization, inversion and intersection of planar parametric rational polynomial curves Comput. Aided Geomet. Des. 1 1984 327 356
8. G.H. Golub, and C.F. Van Loan Matrix Computations 1989 John Hopkins University Press Baltimore, USA
9. A. Graham Kronecker Products and Matrix Calculus with Applications 1981 John Wiley and Sons Chichester, England
10. N.J. Higham Accuracy and Stability of Numerical Algorithms 1996 SIAM Philadelphia, USA
11. S. Krishnan, and D. Manocha An efficient surface intersection algorithm based on lower dimensional formulation ACM Trans. Graph. 16 1 1997 74 106
12. D. Manocha Efficient algorithms for multipolynomial resultant Computer J. 36 5 1993 485 496
13. D. Manocha Solving systems of polynomial equations IEEE Comp. Graph. Applicat. March 1994 46 55
14. D. Manocha, and J. Demmel Algorithms for intersecting parametric and algebraic curves 1: Simple intersections ACM Trans. Graph. 13 1 1994 73 100
15. Y. De Montaudouin, and W. Tiller The Cayley method in computer aided geometric design Comput. Aided Geomet. Des. 1 1984 309 326
16. M.T. Noda, and T. Sasaki Approximate GCD and its application to ill-conditioned linear algebraic equations J. Comput. Appl. Math. 38 1991 335 351
17. A. Schönhage Quasi-gcd computations J. Complex. 1 1985 118 137
18. T. Sederberg, and G. Chang Best linear common divisors for approximate degree reduction Comput. Aided Des. 25 1993 163 168
19. J.R. Winkler A resultant matrix for scaled Bernstein polynomials Linear Algebra Its Applicat. 319 2000 179 191
20. J.R. Winkler Computational experiments with resultants for scaled Bernstein polynomials T. Lyche, L.L. Schumaker, Mathematical Methods for Curves and Surfaces: Oslo 2000 2001 Vanderbilt University Press USA 535 544
21. J.R. Winkler, The transformation of the companion matrix resultant between the power and Bernstein polynomial bases, submitted
22. J.R. Winkler, R.N. Goldman, The Sylvester resultant matrix for Bernstein polynomials, submitted