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:
| 主要作者: | |
|---|---|
| 格式: | 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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|