default search action
Journal of Approximation Theory, Volume 141
Volume 141, Number 1, July 2006
- Friedrich Littmann:
One-sided approximation by entire functions. 1-7 - A. L. Brown:
Continuous selections for metric projections in spaces of continuous functions and a disjoint leaves condition. 29-62 - Heinz H. Bauschke, Patrick L. Combettes, D. Russell Luke:
A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space. 63-69 - Boris P. Osilenker:
Generalized trace formula and asymptotics of the averaged Turan determinant for polynomials orthogonal with a discrete Sobolev inner product. 70-97
Volume 141, Number 2, August 2006
- P. Bouboulis, Leoni Dalla, Vasileios Drakopoulos:
Construction of recurrent bivariate fractal interpolation surfaces and computation of their box-counting dimension. 99-117 - Kerstin Hesse, Ian H. Sloan:
Cubature over the sphere S2 in Sobolev spaces of arbitrary order. 118-133 - Len Bos, Stefano De Marchi, Marco Vianello:
On the Lebesgue constant for the Xu interpolation formula. 134-141 - Avram Sidi:
Algebraic properties of some new vector-valued rational interpolants. 142-161 - Szilárd Gy. Révész:
Turán type reverse Markov inequalities for compact convex sets. 162-173 - Alexander I. Aptekarev, Alicia Cachafeiro, Francisco Marcellán:
A scalar Riemann boundary value problem approach to orthogonal polynomials on the circle. 174-181 - Michael J. Johnson:
A note on the limited stability of surface spline interpolation. 182-188 - E. Brian Davies, Barry Simon:
Eigenvalue estimates for non-normal matrices and the zeros of random orthogonal polynomials on the unit circle. 189-213 - Jorge Bustamante, José M. Quesada:
On an extremal relation of Bernstein operators. 214-215
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.