Skip to main content

Linear problems for univariate functions with noisy data

  • Chapter
  • First Online:
Average-Case Analysis of Numerical Problems

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1733))

  • 2693 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

2.1. Notes and References

  • Plaskota, L. (1992), Function approximation and integration on the Wiener space, J. Complexity 8, 301–321.

    Article  MathSciNet  MATH  Google Scholar 

  • Plaskota, L. (1993), A note on varying cardinality in the average case setting, J. Complexity 9, 458–470.

    Article  MathSciNet  MATH  Google Scholar 

  • Plaskota, L. (1996), Noisy information and computational complexity, Cambridge Univ. Press, Cambridge. p. 177

    Book  MATH  Google Scholar 

  • Plaskota, L. (1996), Noisy information and computational complexity, Cambridge Univ. Press, Cambridge. p. 195

    Book  MATH  Google Scholar 

  • Plaskota, L. (1992), Function approximation and integration on the Wiener space, J. Complexity 8, 301–321.

    Article  MathSciNet  MATH  Google Scholar 

  • Ritter, K. (1996b), Almost optimal differentiation using noisy data, J. Approx. Theory bf 86, 293–309.

    Article  MathSciNet  MATH  Google Scholar 

  • Plaskota, L. (1998), Average case L 2-approximation in the presence of Gaussian noise, J. Approx. Theory 93, 501–515.

    Article  MathSciNet  MATH  Google Scholar 

  • Benhenni, K., and Cambanis, S. (1996), The effect of quantization on the performance of sampling design, Tech. Rep.. No. 481, Dept. of Statistics, Univ. of North Carolina, Chapel Hill.

    MATH  Google Scholar 

3.1. Notes and References

  • Ritter, K. (1996b), Almost optimal differentiation using noisy data, J. Approx. Theory bf 86, 293–309.

    Article  MathSciNet  MATH  Google Scholar 

  • Micchelli, C. A. (1976), On an optimal method for the numerical differentiation of smooth functions, J. Approx. Theory 18, 189–204.

    Article  MathSciNet  MATH  Google Scholar 

  • Kwong, Man Kam, and Zettl, A. (1992), Norm inequalities for derivatives and differences, Lect. Notes in Math. 1536, Springer-Verlag, Berlin.

    MATH  Google Scholar 

  • Donoho, D. L. (1994), Asymptotic minimax risk for sup-norm loss: solution via optimal recovery, Probab. Theory Relat. Fields 99, 145–170.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Klaus Ritter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag

About this chapter

Cite this chapter

Ritter, K. (2000). Linear problems for univariate functions with noisy data. In: Ritter, K. (eds) Average-Case Analysis of Numerical Problems. Lecture Notes in Mathematics, vol 1733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0103939

Download citation

  • DOI: https://doi.org/10.1007/BFb0103939

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67449-8

  • Online ISBN: 978-3-540-45592-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics