zbMATH — the first resource for mathematics

Étude et convergence de fonctions ”spline” complexes. (Investigation and convergence of complex ”spline” functions). (French) Zbl 0592.41012
Summary: We prove the existence and the uniqueness of a complex interpolating spline function of order m, on a simply connected, bounded open subset \(\Omega\) in \({\mathbb{C}}\). Using the Aronszajn-Bergman kernels, we characterize these functions and study their convergence properties to some analytic functions on \(\Omega\). Finally, we give an application of these results to the harmonic real functions on \(\Omega\).
41A15 Spline approximation
41A05 Interpolation in approximation theory
Full Text: DOI EuDML
[1] M. ATTEIA, Fonctions < spline > dans le champ complexe, C.R.A.S., t. 273, octobre 1971, pp. 678-698. Zbl0271.41014 MR301427 · Zbl 0271.41014
[2] [2] M. ATTEIA, Fonctions < spline > et noyaux reproduisants d’Aronszajn-Bergman, R.A.I.R.O., 4e année R. 3, 1970, pp. 31-43. Zbl0213.12502 MR300061 · Zbl 0213.12502
[3] C. FAGE-SIMPSON, Fonctions < spline > complexe d’interpolation d’ordre m dans le champ complexe, Thèse de 3e Cycle (décembre 1981).
[4] P.-J. LAURENT, Approximation, Optimisation, Hermann. Zbl0238.90058 · Zbl 0238.90058
[5] J. NEČAS, Les méthodes directes en théorie des équations elliptiques, Masson, 1967 (chap. 2). Zbl1225.35003 MR227584 · Zbl 1225.35003
[6] [6] P. RABIER, Interpolation harmonique, R.A.I.R.O., vol. 11, n^\circ 2, 1977. Zbl0364.41001 MR447886 · Zbl 0364.41001
[7] W. RUDIN, Real and complex analysis, McGraw-Hill. Zbl0925.00005 · Zbl 0925.00005
[8] L. SCHWARTZ, Sous-espaces hilbertiens d’espaces vectoriels topologiques et noyaux associés, Journal d’Analyse Mathématique, Jérusalem, vol. 13, 1964. Zbl0124.06504 · Zbl 0124.06504
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.