Abstract
The algorithm considered in this paper is due to Diliberto and Straus [2]. It produces, for a given element f ε C(S×T), an element w ε C(S) + C(T) which is a best approximation to f from C(S) + C(T) using the usual supremum norm. We begin with some notation. We will assume S and T are compact Hausdorff spaces. The linear subspace C(S) + C(T) will be denoted on occasion by W. Note that an obvious interpretation of C(S), C(T) as subspaces of C(S×T) must be made, and that with this interpretation W is closed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aumann, G. “Uber Approximative Nomographie, I, II and III”, Bayer. Akad. Wiss. Math-Nat. K1. S.B. (1958), 137-155 ibid 1959, 103-109; ibid. (1960), 27-34.
Diliberto, S.P. and Straus, E.G. “On the approximation of a function of several variables by the sum of functions of fewer variables,” Pacific J. Math. 1 (1951), 195–210.
Von Golitschek, M. and Cheney, E.W. “On the algorithm of Dilberto and Straus for approximating bivariate functions by univariate ones”, Numer. Funct. Analysis and Optimisation 1 (1979), 341–363.
Golomb, M. “Approximation by functions of fewer variables” in “On Numerical Approximation,” R. Langer, ed. University of Wisconsin Press, Madison, Wisconsin, 1959, 275–327.
Light, W.A. and Cheney, E.W. “Approximation Theory in Tensor Product Spaces”, Springer Lecture notes in Mathematics vol. 1169 (1985), Heidelberg.
Light, W.A. and Cheney, E.W. “On the approximation of a bivariate function by sums of univariate functions”, J. Approx. Th. 29 (1980), 305–322.
Von Neumann, J. “Functional Operators, Vol. II” Annals of Mathematics Studies 22, Princeton University Press, 1950.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer Basel AG
About this chapter
Cite this chapter
von Golitschek, M., Light, W.A. (1987). Some Properties of the Diliberto-Straus Algorithms in C(S×T). In: Collatz, L., Meinardus, G., Nürnberger, G. (eds) Numerical Methods of Approximation Theory/Numerische Methoden der Approximationstheorie. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 81. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-6656-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-0348-6656-9_7
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-6657-6
Online ISBN: 978-3-0348-6656-9
eBook Packages: Springer Book Archive