RIPPLE: Residual initiated polynomial-time piecewise linear estimation

被引:1
|
作者
Iyer, Manjula A. [1 ]
Watson, Layne T. [1 ]
机构
[1] Virginia Polytech Inst & State Univ, Dept Math & Comp Sci, Blacksburg, VA 24061 USA
来源
PROCEEDINGS IEEE SOUTHEASTCON 2007, VOLS 1 AND 2 | 2007年
关键词
D O I
10.1109/SECON.2007.342942
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Many engineering models, while highly nonlinear globally, are approximately piecewise linear The linear Shepard algorithm, which is a moving window weighted least squares method based on linear functions, usually creates reasonable approximations. However when used to produce approximations for data obtained from piecewise linear functions, its performance degrades near the function creases. A better approximation near the function creases can be achieved by using robust estimation algorithms. However, robust estimation algorithms have factorial complexity and require a large number of data points. A robust polynomial-time piecewise linear estimation algorithm has been developed that selects minimal sets of data based on a minimal residual criterion. This algorithm RIPPLE (residual initiated polynomial-time piecewise linear estimation) is shown to produce better approximations than the linear Shepard algorithm.
引用
收藏
页码:444 / +
页数:3
相关论文
共 50 条
  • [41] SUBLATTICES OF THE POLYNOMIAL-TIME DEGREES
    AMBOSSPIES, K
    INFORMATION AND CONTROL, 1985, 65 (01): : 63 - 84
  • [42] Piecewise Linear Time Series Estimation with GRASP
    Marcelo C. Medeiros
    Mauricio G.C. Resende
    Alvaro Veiga
    Computational Optimization and Applications, 2001, 19 : 127 - 144
  • [43] Random Linear Network Coding with Probabilistic Polynomial-time Wiretap Adversary
    Hu, Zhiwen
    Wang, Xianming
    Lv, Taotao
    Zhao, Shanshan
    Jing, Ruijun
    Zhu, Li
    Mao, Huaqing
    MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY, 2014, 556-562 : 6354 - 6357
  • [45] Piecewise linear time series estimation with GRASP
    Medeiros, MC
    Resende, MGC
    Veiga, A
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 19 (02) : 127 - 144
  • [46] A POLYNOMIAL-TIME ALGORITHM, BASED ON NEWTON METHOD, FOR LINEAR-PROGRAMMING
    RENEGAR, J
    MATHEMATICAL PROGRAMMING, 1988, 40 (01) : 59 - 93
  • [47] ON THE POWER OF PARITY POLYNOMIAL-TIME
    CAI, JY
    HEMACHANDRA, LA
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 229 - 239
  • [48] SOLVABILITY BY RADICALS IS IN POLYNOMIAL-TIME
    LANDAU, S
    MILLER, GL
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (02) : 179 - 208
  • [49] Collapsing polynomial-time degrees
    Ambos-Spies, K
    Bentzien, L
    Fejer, PA
    Merkle, W
    Stephan, F
    LOGIC COLLOQUIM '98, 2000, 13 : 1 - 24
  • [50] ON DATALOG VS POLYNOMIAL-TIME
    AFRATI, F
    COSMADAKIS, SS
    YANNAKAKIS, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (02) : 177 - 196