|
|||||
|
|
| THE AVERAGE CASE COMPLEXITY OF THE SHIFT-INVARIANT PROBLEM | |
| 作者姓名： | Arthur.G.Werschulz |
| 作者单位： | Columbia University，USA |
| 摘 要： | The present paper deals with the average case, complexity of the shift-invariant problem. The main aim is to give a new proof of the upper bound of average error of finite element method. Our method is based on the techniques proposed by Heinrich(1990). We also point out an essential error regarding the proof of the upper bound in A. G. Werschulz(1991). |
The average case complexity of the shift—Invariant problem |
|
| Arthur.G.Werschulz.THE AVERAGE CASE COMPLEXITY OF THE SHIFT-INVARIANT PROBLEM[J].Analysis in Theory and Applications,1998,14(1):1-7. | |
| Authors: | T Z Jiang Arthur G Werschulz |
| Institution: | 1. School of Mathematics, The university of New South Wales, 2052, Sydney, Australia 2. National Laboratory of Pattern Recognition Institute of Automation, Chinese Academy of Sciences, China 3. Department of Computer Science, Columbia University New York, 10027, New York, USA |
| Abstract: | The present paper deals with the average case complexity of the shift—invariant problem. The main aim is to give a new proof of the upper bound of average error of finite element method. Our method is based on the techniques proposed by Heinrich (1990). We also point out an essential error regarding the proof of the upper bound in A. G. Werschulz (1991). |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ | |