ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Finding polynomial roots using knot insertion

Rok Koleša (2014) Finding polynomial roots using knot insertion. EngD thesis.

Download (3102Kb)


    In this thesis we present a new way of finding polynomial roots. First we find out what is interpolation, what are piecewise polynomials and what are B-splines. We write down the polynomial as a B-spline and then we use the close relation between the spline and it's control polygon by finding a root of the polygon, insert that root as a knot which we use as our first estimate and modify the polygon. The procedure is repeated until the estimates converge. We then proceed to find all the other roots by reseting all variables and start the whole procedure from the found root onwards. At the end we give a MATLAB implementation of the algorithm.

    Item Type: Thesis (EngD thesis)
    Keywords: polynomial, root, interpolation, knot, B-spline, MATLAB, polygon
    Number of Pages: 47
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    prof. dr. Gašper JakličMentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536144067 )
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 2753
    Date Deposited: 22 Sep 2014 16:22
    Last Modified: 08 Jan 2015 12:32
    URI: http://eprints.fri.uni-lj.si/id/eprint/2753

    Actions (login required)

    View Item