NUMERICALLY COMPUTABLE BOUNDS FOR THE RANGE OF VALUES OF INTERVAL POLYNOMIALS

Simple item page
dc.contributor.authorRokne, Joneng
dc.date.accessioned2008-05-08T18:37:24Z
dc.date.available2008-05-08T18:37:24Z
dc.date.computerscience1999-05-27eng
dc.date.issued1976-01-01eng
dc.description.abstractA central problem in interval analysis is the computation of the range of values of an interval polynomial over an interval. This problem has been treated by Dussel and Schmitt [1] and, disregarding the computational cost of their algorithm, solved in a satisfactory manner. In this paper we will discuss two algorithms by Rivlin [4] (see also Cargo and Shiska [2]) where the accuracy of the bounds depend on the amount of work one is willing to do. The first algorithm is based upon the expression of a polynomial in Bernstein polynomials. This algorithm as given by Rivlin [4] is valid for an estimate over the interval [0,1]. We will generalize the algorithm to an arbitrary finite interval and we will show that it is an appropriate algorithm if the width of the interval is not too large. The second algorithm is based upon the mean value theorem. As stated by Rivlin [4] it is valid for the interval [0,1]. We will generalize the algorithm so that it is valid for any finite interval. The algorithms are then generalized to interval arithmetic versions. Finally we compare the algorithms numerically on several polynomials.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1976-2-2eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30975
dc.identifier.urihttp://hdl.handle.net/1880/46392
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleNUMERICALLY COMPUTABLE BOUNDS FOR THE RANGE OF VALUES OF INTERVAL POLYNOMIALSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications