Vis enkel innførsel

dc.contributor.authorBarrowclough, Oliver Joseph David
dc.date.accessioned2017-02-08T12:25:34Z
dc.date.available2017-02-08T12:25:34Z
dc.date.created2015-09-24T21:00:02Z
dc.date.issued2011
dc.identifier.urihttp://hdl.handle.net/11250/2429987
dc.description.abstractWhereas traditional approaches to implicitization of rational parametric curves have focused on exact methods, the past two decades have seen increased interest in the application of approximate methods for implicitization. In this talk we will discuss how the properties of the Chebyshev polynomial basis can be used to improve the speed, stability and approximation quality of existing algorithms for approximate implicitization. We will also look at how the algorithm is well suited to parallelization.
dc.description.abstractApproximate Implicitization using Chebyshev Polynomials
dc.language.isoengnb_NO
dc.titleApproximate Implicitization using Chebyshev Polynomialsnb_NO
dc.typeLecturenb_NO
dc.identifier.cristin1273038
cristin.unitcode7401,90,11,0
cristin.unitnameAnvendt matematikk
cristin.ispublishedtrue
cristin.fulltextpostprint


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel