Abstract

We study a weak greedy type algorithm called the weak pre-orthogonal adaptive Fourier decomposition (WPOAFD) for the Bergman space on a bounded pseudoconvex domain Ω with smooth boundary. We show that any function can be approximated by linear combinations of kernel functions in weak greedy sense.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call