Chebyshev approximation of discrete polynomials and splines
This work is concerned with the approximation of discrete data using polynomials and splines based on the Chebyshev approximation criterion. Five algorithms are proposed in this work to implement the Chebyshev approximation criterion. These algorithms use either cubic splines or Lagrange polyn...
Saved in:
主要作者: | Che Seman, Fauziahanim |
---|---|
格式: | Thesis |
语言: | English English English |
出版: |
2004
|
主题: | |
在线阅读: | http://eprints.uthm.edu.my/8155/1/24p%20FAUZIAHANIM%20CHE%20SEMAN.pdf http://eprints.uthm.edu.my/8155/2/FAUZIAHANIM%20CHE%20SEMAN%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/8155/3/FAUZIAHANIM%20CHE%20SEMAN%20WATERMARK.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Chebyshev approximation of discrete polynomials and splines
由: Che Seman, Fauziahanim
出版: (2004) -
On Steiner System S(5, 8, 24) And The Miracle Octad Generator (Mog) [QA164. S623 2004 f rb].
由: Sitt, Chee Keen
出版: (2004) -
Moufang Loops Of Odd Order p1 p2 ...p n q3
[QA174.2. C548 2007 f rb].
由: Chong, Kam Yoon
出版: (2007) -
Some Optimal Codes And Their Decoding Algorithms
[QA268. T258 2008 f rb].
由: Tee, Chee Ching
出版: (2008) -
A Proposed Method For Selecting The Clustering Algorithm In Radial Basis Function [QA223. A581 2008 f rb].
由: Ang, Sau Loong
出版: (2008)