Abstract
The computational implementation in a floating point environment of the companion matrix resultant is considered and it is shown that the numerical condition of the resultant matrix is strongly dependent on the basis in which the polynomials are expressed. In particular, a companion matrix of a Bernstein polynomial is derived and this is used to construct a resultant matrix for two Bernstein polynomials. A measure of the numerical condition of a resultant matrix is developed and then used to compare the stability of the resultant matrices of the same polynomials that are expressed in different bases. It is shown that it is desirable to express the polynomials in the Bernstein basis, but since the power basis is the natural choice in many applications, a transformation of the resultant matrix between these bases is required. It is shown that this transformation of the resultant matrix between the bases cannot be achieved by performing a basis transformation of each polynomial. Rather, the equation that defines the transformation of the companion matrix resultant between the bases is derived by considering the eigenvectors of the companion matrix of a polynomial in each basis. The numerical condition of this equation is considered and it is shown that it is ill-conditioned, even for polynomials of low degree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
J. F. Canny. The Complexity of Robot Motion Planning. The MIT Press, Cambridge, USA, 1988.
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. Computer Aided Geometric Design, 1:327–356, 1984.
J. T. Kajiya. Ray tracing parametric patches. Computer Graphics, 16:245–254, 1982.
D. Manocha. Numerical methods for solving polynomial equations. In D. Cox and B. Sturmfels, editors, Proceedings of Symposia in Applied Mathematics, volume 53, Applications of Computational Algebraic Geometry, pages 41–66. AMS, Rhode Island, USA, 1998.
Y. De Montaudouin and W. Tiller. The Cayley method in computer aided geometric design. Computer Aided Geometric Design, 1:309–326, 1984.
S. Petitjean. Algebraic geometry and computer vision: Polynomial systems, real and complex roots. Journal of Mathematical Imaging and Vision, 10:191–220, 1999.
T. Sederberg. Applications to computer aided geometric design. In D. Cox and B. Sturmfels, editors, Proceedings of Symposia in Applied Mathematics, volume 53, Applications of Computational Algebraic Geometry, pages 67–89. AMS, Rhode Island, USA, 1998.
J. R. Winkler. A companion matrix resultant for Bernstein polynomials, 2002. Submitted.
J. R. Winkler. The transformation of the companion matrix resultant between the power and Bernstein polynomial bases, 2002. Submitted.
J. R. Winkler and R. N. Goldman. The Sylvester resultant matrix for Bernstein polynomials, 2002. Submitted.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Winkler, J.R. (2002). Properties of the Companion Matrix Resultant for Bernstein Polynomials. In: Winkler, J., Niranjan, M. (eds) Uncertainty in Geometric Computations. The Springer International Series in Engineering and Computer Science, vol 704. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0813-7_16
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0813-7_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5252-5
Online ISBN: 978-1-4615-0813-7
eBook Packages: Springer Book Archive