| DOI | Resolve DOI: https://doi.org/10.1080/00207728308926468 |
|---|
| Author | Search for: Abdelmalek, Nabih N.1 |
|---|
| Affiliation | - National Research Council of Canada
|
|---|
| Format | Text, Article |
|---|
| Abstract | Two algorithms for solving the piecewise linear Chebyshev approximation problem of planar curves are presented. The first one is for the case when the Chebyshev error norm in any segment does not exceed a preassigned value. The second is for the case when the number of segments is given and a balanced Chebyshev error norm solution is required. The given curve is first digitized and either algorithm is then applied to the discrete points. Both algorithms use parametric linear programming techniques, which result in speed of computation. They also take advantage of the equioscillation property of the Chebyshev approximation and thus avoid unnecessary computation. Hence the algorithms are faster than other known methods. Also no constraints on the approximating functions are required. Numerical results and comments are given. |
|---|
| Publication date | 1983 |
|---|
| In | |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| NRC number | NRCC 22642 |
|---|
| NPARC number | 21273697 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | cd03ad14-cad4-424d-8338-ac0e06918920 |
|---|
| Record created | 2015-01-20 |
|---|
| Record modified | 2020-03-13 |
|---|
