Computer Science – Computational Complexity
Scientific paper
2006-08-28
Computer Science
Computational Complexity
corrected abstract
Scientific paper
This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions (computable Lebesgue integrable functions) with a size notion, by introducing Lp-computable Baire categories. We show that Lp-computable Baire categories satisfy the following three basic properties. Singleton sets {f} (where f is Lp-computable) are meager, suitable infinite unions of meager sets are meager, and the whole space of Lp-computable functions is not meager. We give an alternative characterization of meager sets via Banach Mazur games. We study the convergence of Fourier series for Lp-computable functions and show that whereas for every p>1, the Fourier series of every Lp-computable function f converges to f in the Lp norm, the set of L1-computable functions whose Fourier series does not diverge almost everywhere is meager.
No associations
LandOfFree
Lp Computable Functions and Fourier Series does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lp Computable Functions and Fourier Series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lp Computable Functions and Fourier Series will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-106074