Back to search

University of Sheffield

Structured matrix methods for computations on Bernstein basis polynomials

Abstract

dc:description.abstract

This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it is shown that structure preserving matrix methods yield excellent results. With respect to greatest common divisor computations, the most difficult part is the computation of its degree, and several methods for its determination are presented. These are based on the Sylvester resultant matrix, and it is shown that a new form of the Sylvester resultant matrix in the modified Bernstein basis yields the best results. The B´ezout resultant matrix in the modified Bernstein basis is also considered, and it is shown that the results from it are inferior to those from the Sylvester resultant matrix in the modified Bernstein basis.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of Sheffield
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Yang, Ning
Advisor dc:contributor.advisor
  • Winkler, Joab

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.566363

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Yang, Ning. Structured matrix methods for computations on Bernstein basis polynomials. doctoral thesis, University of Sheffield, 2013.