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 polynomi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English English |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/8584/1/24p%20FAUZIAHANIM%20CHE%20SEMAN.pdf http://eprints.uthm.edu.my/8584/2/FAUZIAHANIM%20CHE%20SEMAN%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/8584/3/FAUZIAHANIM%20CHE%20SEMAN%20WATERMARK.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|