Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T12:58:51.445Z Has data issue: false hasContentIssue false
  • English
  • Français

Tubular sets and multivariate Polya algorithm

Part of: Approximations and expansions

Published online by Cambridge University Press:  09 April 2009

Robert Huotari
Robert Huotari
Affiliation:
Idaho State University, Pocatello, Idaho 83209, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Some new results concerning tubular sets are presented, with applications to the convergence of the Polya algorithm in the contexts of simultaneous approximation and approximation of multivariate functions by univariate functions. (The Polya algorithm constructs a best uniform approximation from the limit, as p → ∞, of best Lp approximations.)

Keywords

Polya algorithmmultivariate approximationtubular set.

MSC classification

Secondary: 41A30: Approximation by other special function classes 41A63: Multidimensional problems (should also be assigned at least one other classification number in this section)
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 55 , Issue 2 , October 1993 , pp. 232 - 237
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]Cheney, E. W., Multivariate Approximation Theory, CBMS-NSF Regional Conf. Ser. in Appl. Math. (SIAM, Philadelphia, 1986).CrossRefGoogle Scholar
[2]Darst, R. B., Legg, D. and Townsend, T., ‘The Polya algorithm in L∞ approximation’, J. Approx. Theory 38 (1983), 209–220.CrossRefGoogle Scholar
[3]Descloux, J., ‘Approximations in Lp and chebychev approximations’, J. Soc. Ind. Appl. 11 (1963), 1017–1026.CrossRefGoogle Scholar
[4]Egger, A. and Huotari, R., ‘The Polya algorithm on convex sets’, J. Approx. Theory 56 (1989), 212–216.CrossRefGoogle Scholar
[5]Goel, D. S., Holland, A. S. B., Nassim, C. and Sahney, B. N., ‘Characterization of an element of best lp simultaneous approximation’, in: S. Ramanujan Memorial Volume (Madras, 1984) pp. 10–14.Google Scholar
[6]Huotari, R., ‘The p-limit selection in uniform approximation’, preprint.Google Scholar
[7]Huotari, R., Legg, D. and Townsend, D., ‘The Polya algorithm on cylindrical sets’, J. Approx. Theory 53 (1988), 335–349.CrossRefGoogle Scholar
[8]Legg, D. and Townsend, D., ‘The Polya algorithm for convex approximation’, J. Math. Anal. Appl. 141 (1989), 431–441.CrossRefGoogle Scholar
[9]Polya, G., ‘Sur un algorithm toujours convergent pour obtenir les polynomes de meilleure approximation de Tchebycheff’, C. R. Acad. Sci. Paris Ser I Math. 157 (1913), 840–843.Google Scholar
[10]Rice, J., The Approximation of Functions, Vol. II (Addison-Wesley, Reading, 1964).Google Scholar
[11]Sahab, S., ‘Best simultaneous approximation of quasi-continuous functions by monotone functions’, J. Austral. Math. Soc. (Series A), to appear.Google Scholar
[12]Sahab, S., ‘On the monotone simultaneous approximation on [0, 1]’, Bull. Austral. Math. Soc. 39 (1988), 401–411.CrossRefGoogle Scholar
[13]Singer, I., Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces (Springer, Berlin, 1970).CrossRefGoogle Scholar