The computation of multiple roots of a Bernstein basis polynomial
Decanato - Facoltà di scienze informatiche
Data d'inizio: 23 Settembre 2015
Data di fine: 24 Settembre 2015
|
|||||||||||
|
|||||||||||
Abstract: | |||||||||||
The Bernstein basis is used extensively in geometric modelling because of its enhanced numerical properties and elegant geometric properties in the unit interval. The computation of the points of intersection of curves and surfaces is an important problem in geometric modelling, and it gives rise to a polynomial equation. Although there is an extensive literature on numerical methods for the solution of polynomial equations, they fail to address satisfactorily an important consideration of the polynomial equations that arise in geometric modelling. In particular, multiple roots are of particular interest because they define conditions of tangency, which are important for smooth intersections of curves and surfaces. |
|||||||||||
|
|||||||||||
Biography: | |||||||||||
Joab Winkler obtained his undergraduate degree from Imperial College of Science and Technology, and his PhD from University College London. He then worked in industry for a few years, before returning to academia, and he is now Reader in The Department of Computer Science at The University of Sheffield. His main research interest is numerical and algebraic problems in geometric modelling, which led to an interest in the development of robust methods for computations on resultant matrices. He has applied these robust methods to approximate greatest common divisor computations using resultant matrices, and the development of a polynomial root solver that preserves multiple roots of a Bernstein basis polynomial. More recently, he has applied resultant matrices to the problem of image deblurring when the cause of the blur is not known, that is, the problem of blind image deconvolution. |
|||||||||||
|
|||||||||||
|