| 最小绝对偏差样条的求解问题 |
| |
| 引用本文： | 李玮.最小绝对偏差样条的求解问题[J].暨南大学学报,1991,12(3):16-20. |
| |
| 作者姓名： | 李玮 |
| |
| 作者单位： | 暨南大学计划统计系 |
| |
| 摘 要： |
|
| 关 键 词： | 自然样条 LAD样条 凸二次规划 |
THE WAY OF COMPUTING LAD SPLINES |
| |
| Li Wei.THE WAY OF COMPUTING LAD SPLINES[J].Journal of Jinan University(Natural Science & Medicine Edition),1991,12(3):16-20. |
| |
| Authors: | Li Wei |
| |
| Institution: | Deot. of Planning & Statistics |
| |
| Abstract: | It is proved in the present paper that, LAD splines can be sloved by solving respective specific convex quadratic programming problems. The computing results from the designed programs show that the method for smoothing statistical data with LAD spline is more robustic and effective than that with LSD spline. |
| |
| Keywords: | Natural spline LAD spline LSD spline Polynomial algorithm Convex quadratic programming |
| 本文献已被 CNKI 维普 等数据库收录！ |
