A polynomial algorithm on computing LAG spline

スポンサーリンク

概要

• 論文の詳細を見る

• 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 requires 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.

• 九州大学の論文

著者

• Wei Li

  Department Of Hematology Affiliated Hospital Of Academy Of Military Medicine Science

• Asano Chooichiro

  Research Institute Of Fundamental Information Science Kyushu University

• Wei Li

  Department Of Planning & Statistics Jinan University

• Xiamping Li

  Department of Statistics & Operations Research,Fundan University

• Xiamping Li

  Department Of Statistics & Operations Research Fundan University

• Asano Choichiro

  Research Institute of Fundamental Information Science,Kyushu University

関連論文

• Comparison of Wilms' tumor antigen 1-specific T lymphocyte generation soon after nonmyeloablative allergenic stem-cell transplantation in acute and chronic leukemia patients
• RECURSIVE PROCEDURES FOR HIERARCHICAL LOGLINEAR MODELS ON HIGH-DIMENSIONAL CONTINGENCY TABLES
• An HPLC method for determination of oridonin in rabbits using isopsoralen as an internal standard and its application to pharmacokinetic studies for oridonin-loaded nanoparticles
• Computational Procedures of a Latent Scale Linear Model for Ordered Categorical Data
• ESTIMATION OF THE LARGER NORMAL MEAN
• A polynomial algorithm on computing LAG spline

スポンサーリンク