首页 | 本学科首页   官方微博 | 高级检索  
     检索      

DETERMINATION OF PERMANENT OPTIMAL DATA POINTS AND AN EFFICIENT ALGORITHM FOR LAD PROBLEM
作者姓名:李文军  王嘉松
作者单位:Department of Mathematics and Physics,The University of Petroleum,Dongying 257062,PRC.,Department of Mathematics,Nanjing University,Nanjing 210093,PRC.
基金项目:The Project was supported by Natural Science Foundation of Jiangsu Province.
摘    要:This paper gives a definition of permanent optimal data point of Least Absolute Deviation(LAD)problem.Some theoretical results on non-degenerate LAD problem are obtained.For computing LAD problem,an efficient,algorithm is given according to the idea of permanent optimal data point.Numerical experience shows that our algorithm is better than many of others,including the famous B R algorithm.


DETERMINATION OF PERMANENT OPTIMAL DATA POINTS AND AN EFFICIENT ALGORITHM FOR LAD PROBLEM
Li WeG-jun.DETERMINATION OF PERMANENT OPTIMAL DATA POINTS AND AN EFFICIENT ALGORITHM FOR LAD PROBLEM[J].Numerical Mathematics A Journal of Chinese Universities English Series,1996(2).
Authors:Li WeG-jun
Institution:Li WeG-jun Department of Mathematics and Physics,The University of Petroleum,Dongying 257062,PRC.Wang Jia-song Department of Mathematics,Nanjing University,Nanjing 210093,PRC.
Abstract:This paper gives a definition of permanent optimal data point of Least Absolute Deviation(LAD)problem.Some theoretical results on non-degenerate LAD problem are obtained.For computing LAD problem,an efficient,algorithm is given according to the idea of permanent optimal data point.Numerical experience shows that our algorithm is better than many of others,including the famous B R algorithm.
Keywords:LAD prolem  data  point  basic data point  permanent optimal data point  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号