| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連URI |
|
| 関連HDL |
|
| 関連情報 |
|
|
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
