Abstract
The problem of lacunary trigonometric interpolation is investigated. Does a trigonometric polynomial T exist which satisfies T(x k) = a k, D m T(x k) = b k, 0 ≤ k ≤ n − 1, where x k = kπ/n is a nodal set, a k and b k are prescribed complex numbers, \(D = \frac{d}{{dx}}\) and m ∈ N. Results obtained by several authors for the periodic case are extended to the antiperiodic case. In particular solvability is established when n as well as m are even. In this case a periodic solution does not exist.
Similar content being viewed by others
REFERENCES
F.-J. Delvos, Hermite interpolation with trigonometric polynomials, BIT, 33 (1993), pp. 113–123.
Liu Yongping, On the trigonometric interpolation and the entire interpolation, Approx. Theory Appl., 6:4 (1990), pp. 85–106.
A. Sharma and Sun Xiehua, A 2-periodic trigonometric interpolation problem, Approx. Theory Appl., 8:4 (1992), pp. 1–16.
A. Sharma and A. K. Varma, Trigonometric interpolation, Duke Math. J., 32 (1965), pp. 341–357.
A. Sharma, J. Szabados, and R. S. Varga, 2-Periodic lacunary trigonometric interpolation: the (0; M) case, in Proc. Conf. Constructive Theory of Functions '87, Varna, Bulgaria, pp. 420–426.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Delvos, FJ., Knoche, L. Lacunary Interpolation by Antiperiodic Trigonometric Polynomials. BIT Numerical Mathematics 39, 439–450 (1999). https://doi.org/10.1023/A:1022314518264
Issue Date:
DOI: https://doi.org/10.1023/A:1022314518264