Algorithms for rational Chebyshev approximation

Simple item page
dc.contributor.authorLee, Chee-Mouen_US
dc.date.accessioned2024-08-14T21:03:37Z
dc.date.available2024-08-14T21:03:37Z
dc.date.copyright1971en_US
dc.date.issued1971
dc.degree.departmentDepartment of Mathematics
dc.degree.departmentDepartment of Mathematics and Statistics
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractA common problem in numerical analysis is to obtain a convenient approximation to a prescribed function. Rational approximating functions are frequently selected for this purpose. This thesis is a survey of several methods that have been proposed for obtaining best rational Chebyshev approximations to functions defined on finite point sets. Most of the methods formulate the problem as a mathematical programming problem. Numerical examples are given to compare the efficiency of the methods.en
dc.format.extent87 pages
dc.identifier.urihttps://hdl.handle.net/1828/18653
dc.rightsAvailable to the World Wide Weben_US
dc.titleAlgorithms for rational Chebyshev approximationen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LEE_Chee_Mou_MSc_1971_1247293.pdf
Size:
13.72 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.