| Creator |
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
| Related DOI |
|
|
|
|
|
| Related URI |
|
|
|
|
|
| Related URI |
|
| Related HDL |
|
| Relation |
|
|
|
|
|
| Abstract |
In this paper, the authors prove that LAD Spline (Least Absolute Deviations Spline) can be calculated by solving a specific convex quadratic programming problem. A polynomial time algorithm, which req...uires no more than $ 0(n^3 L) $ arithmetic operations, is designed to solve this programming problem. The algorithm is taken into practice successfully on an IBM personal computer with Turbo Pascal. By comparing with LSD Spline (Least Square Deviations Spline), the paper shows that the method of smoothing statistical data with LAD Spline is more robust and effective.show more
|
Export Mendeley
