default search action
Journal of Approximation Theory, Volume 147
Volume 147, Number 1, July 2007
- Paul C. Kainen, Vera Kurková, Andrew Vogt:
A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves. 1-10 - Victor Didenko, Seng Luan Lee, Steffen Roch, Bernd Silbermann:
Approximate foveated images and reconstruction of their uniform pre-images. 11-27 - Christopher Heil, Gitta Kutyniok:
The Homogeneous Approximation Property for wavelet frames. 28-46 - Christiane Kraus:
Maximal convergence theorems for functions of squared modulus holomorphic type in R2 and some applications. 47-66 - Marcin Bownik, Ole W. Christensen:
Characterization and perturbation of Gabor frame sequences with rational parameters. 67-80 - Sergey K. Bagdasarov:
Generalizations of the time optimal problem and Lyapunov theorem on the range of vector measures. 81-111 - Shunsheng Guo, Qiulan Qi, Guofen Liu:
The central approximation theorems for Baskakov-Bézier operators. 112-124 - Zeev Ditzian:
A note on equivalence of moduli of smoothness on the sphere. 125-128
Volume 147, Number 2, August 2007
- Eli Levin, Doron S. Lubinsky:
Orthogonal polynomials for weights close to indeterminacy. 129-168 - Yi Ge Pan:
Christoffel functions and mean convergence for Lagrange interpolation for exponential weights. 169-184 - David L. Donoho, Michael Elad, Vladimir N. Temlyakov:
On Lebesgue-type inequalities for greedy approximation. 185-195 - Hong Oh Kim, Rae Young Kim, Jae Kun Lim, Zuowei Shen:
A pair of orthogonal frames. 196-204 - Ying Guang Shi:
A note on the distance between two consecutive zeros of m-orthogonal polynomials for a generalized Jacobi weight. 205-214 - Heng Zhou:
Divergence of Cesàro means of spherical h-harmonic expansions. 215-220
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.