The worst case complexity of the fredholm equation with periodic free term and noisy informationFootnote^∗

The first author was supported by the Natural Science Foundation of China

References

• Frank , K. 1997 . “ Optimal Numerical Solution of Multivariate Integral Equations ” . In Ph.D. Thesis , Shaker Verlag : Universitöt Kaiserslautern .
   Google Scholar
• Frank , K. 1995 . Complexity of Local Solution of Multivariate Integral Equations . J. Complexity , 11 ( 4 ) : 416 – 434 .
   Web of Science ®Google Scholar
• Frank , K. and Heinrich , S. 1994 . “ Complexity of Local Solution of Integral Equations ” . In Beitrge zur angewandten Analysis und Infonnatik , 55 – 68 . Aachen : Shaker .
   Google Scholar
• Frank , K. , Heinrich , S. and Pereverzev , S.V. 1996 . Information Complexity of Multivariate Fredholm Integral Equations in Sobolev Classes . J. Complexity , 12 ( 1 ) : 17 – 34 .
   Web of Science ®Google Scholar
• Heinrich , S. 1990 . Probabilistic Complexity Analysis for Linear Problem in Bounded Domains . J. Complexity , 6 ( 1 ) : 231 – 255 .
   Google Scholar
• Heinrich , S. 1991 . Probabilistic Analysis of Numerical Methods for Integral Equations . J. Integral Equat. Appl , 3 ( 2 ) : 289 – 319 .
   Google Scholar
• Jiang , T. 1996 . The Complexity of the Fredholm Equation of the Second Kind with Free Term in . Chinese J Math , 24 ( 4 ) : 315 – 326 .
   Google Scholar
• Jiang , T. 1996 . The Average Case Complexity of the Fredholm Equation of Second Kind with Free Term in H⌞( ↿) . Acta Math. Hungar , 71 ( 1-2 ) : 29 – 40 .
   Web of Science ®Google Scholar
• Jiang , T. 1998 . The Worst Case Complexity of the Fredhohn Equation of the Second Kind with Non-Periodic Free Term and Noise Information . Numerical Functional Analysis and Optimization , 19 ( 3-4 ) : 329 – 343 .
   Web of Science ®Google Scholar
• Kress , R. 1989 . Linear Integral Equations , Berlin : Springer-Verlag .
   Google Scholar
• Pereverzev , S.V. 1996 . “ Optimization of Methods for Approximate Solution of Operator Equations ” . In Computational Mathematics and Analysis Series , Commack, NY : Nova Science Publishers .
   Google Scholar
• Pereverzev , S.V. and Solodky , S.G. 1996 . On the optimization of projection-iterative methods for the approximate solution of ill-posed problems . Ukran. Mat. Zh , 48 ( 11 ) : 1530 – 1536 . Russian
   Google Scholar
• Pereverzev , S.V. and Solodky , S.G. 1996 . The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind . J. Complexity , 12 ( 4 ) : 401 – 415 .
   Web of Science ®Google Scholar
• Pinkus , A. 1985 . n-Width in Approximation Theory , New York : Springer-Verlag .
   Google Scholar
• Plaskota , L. 1996 . Noise Information and Computational Complexity , Cambridge : Cambridge University Press .
   Google Scholar
• Plaskota , L. 1996 . Worst case complexity of problems with random information noise . J, Complexity , 12 ( 4 ) : 416 – 439 .
   Web of Science ®Google Scholar
• Plaskota , L. 1996 . How to benefit from noise . J. Complexity , 12 ( 2 ) : 175 – 184 .
   Web of Science ®Google Scholar
• Tikhomirov , V.M. 1976 . Some Problems of Approximation Theory , MGU . in Russian, M.:izd-vo
   Google Scholar
• Tikhomirov , V.M. 1987 . Problem of Mathematics , M.:vinit~, Vol. 14, ~(in Russian), M,:izd-vo, MGU
   Google Scholar
• Traub , J.F. , Wasilkowski , G.W and Wozniakowski , H. 1988 . Information-Based Complexity , New York : Acad. Press .
   Google Scholar
• Traub , J.F. and Wozniakowski , H. 1991 . Information-Based Complexity. New Questions for Mathematicians . Mathematical Intelligencer , 13 : 34 – 43 .
   Google Scholar
• Werschulz , A.G. 1985a . What is the Complexity of the Fredholm Problem of the Second Kind . J. Integral Equat , 9 : 213 – 241 .
   Google Scholar
• Werschulz , A.G. 1985b . Complexity of Differential and Integral Equations . J. Complexity , 1 : 232 – 255 .
   Google Scholar
• Werschulz , A.G. 1991 . The Complexity of Differential and Integral Equations:an Information-Based Approach , New York : Oxford University Press .
   Google Scholar
• Werschulz , A.G. 1996 . The complexity of definite elliptic problems with noisy data . J. Complexity , 12 ( 4 ) : 440 – 473 .
   Web of Science ®Google Scholar
• Werschulz , A.G. 1997 . The complexity of indefinite elliptic problems with noisy data . J. Complexity , 13 ( 4 ) : 457 – 479 .
   Web of Science ®Google Scholar
• Yokoyama , M. 1990 . Computing Topological Degree Using Noisy Information . Journal of Complexity , 6 ( 4 ) : 379 – 388 .
   Google Scholar
• Yokoyama , M. 1997 . Computing the Topological Degree with Noisy Information . Journal of Complexity , 13 ( 2 ) : 272 – 278 .
   Web of Science ®Google Scholar