– Examples.pdfVIP

Bartoˇn, J¨uttler Computing roots of polynomials by quadratic clipping Computing roots of polynomials by quadratic clipping Michael Bartoˇn, Bert J¨uttler SFB F013, Project 15 Johann Radon Institute for Computational and Applied Mathematics, Linz, Austria e-mail: Michael.Barton@oeaw.ac.at FSP Seminar, Strobl, 19 – 22/6/2006 1 Bartoˇn, J¨uttler Computing roots of polynomials by quadratic clipping Outlook • B´ezier clipping algorithm • Quadratic clipping – The best quadratic approximant – Dual basis – Error bound • Convergence rate – Single roots – Double roots • Comparison – Examples • Conclusion FSP Seminar, Strobl, 19 – 22/6/2006 2 Bartoˇn, J¨uttler Computing roots of polynomials by quadratic clipping B´ezier clipping • Polynomial function p (t) of degree n on interval [α , β ] is given 0 0 • Algorithm: 1. Represent the polynomial as a parametric B´ezier curve of degree n 2. Construct convex hull of the control polygon (CP) 3. Intersect the convex hull with t-axis 4. Obtain a new interval [α , β ] 1 1 – if | α − β | 1 | α − β |