Restricted uniform rational approximations

We consider the approximation of continuous functions from various restricted classes of rational functions. More precisely, for a function f continuous on [0,1] we consider [Mathematical Equation] where || || [0,1] is the uniform norm on [0,1] and A[sub n] is some restricted subset of the rea...

Full description

Bibliographic Details
Main Author: Borwein, Peter B.
Language:English
Published: 2010
Online Access:http://hdl.handle.net/2429/21801
id ndltd-UBC-oai-circle.library.ubc.ca-2429-21801
record_format oai_dc
spelling ndltd-UBC-oai-circle.library.ubc.ca-2429-218012018-01-05T17:41:17Z Restricted uniform rational approximations Borwein, Peter B. We consider the approximation of continuous functions from various restricted classes of rational functions. More precisely, for a function f continuous on [0,1] we consider [Mathematical Equation] where || || [0,1] is the uniform norm on [0,1] and A[sub n] is some restricted subset of the real rational functions of degree n . We are primarily concerned with the following three restrictions: monotone denominators, denominators having positive coefficients and both numerators and denominators having positive coefficients. We compare the order of approximation (the asymptotic behaviour of ε[sub n] ) from restricted rationals to the orders of approximation by polynomials and unrestricted rationals. We show, for functions that are exactly k-times differentiable on [0,1], that restricted rational approximation cannot be spectacularly more efficient than polynomial approximation. For example, if A[sub n] is the class of rational functions of degree n with monotone denominators and for some f the corresponding [Mathematical Equation] then f is k-times continuously differentiable on (0,1] . The situation is more complicated for analytic functions. In this case restricted rational approximations vary from being no more efficient than polynomials to being arbitrarily faster. For functions of the form ∑a[sub n]x[sup n], where a[sub n] ↓ 0, we show that the order of approximation by rationals with denominators having positive coefficients is the same as the polynomial order. Finally, we develop approximation theorems for rational functions with positive coefficients. (This class does not contain the polynomials so we cannot a priori assert denseness.) We show that it is possible to approximate positive functions fairly efficiently from this class. For instance, if f is analytic and positive on [0,1] then the order of approximation by rational functions of degree n with positive coefficients is at least as rapid as [Mathematical Equation], where ρ > 1 . Science, Faculty of Mathematics, Department of Graduate 2010-03-11T20:29:56Z 2010-03-11T20:29:56Z 1979 Text Thesis/Dissertation http://hdl.handle.net/2429/21801 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
collection NDLTD
language English
sources NDLTD
description We consider the approximation of continuous functions from various restricted classes of rational functions. More precisely, for a function f continuous on [0,1] we consider [Mathematical Equation] where || || [0,1] is the uniform norm on [0,1] and A[sub n] is some restricted subset of the real rational functions of degree n . We are primarily concerned with the following three restrictions: monotone denominators, denominators having positive coefficients and both numerators and denominators having positive coefficients. We compare the order of approximation (the asymptotic behaviour of ε[sub n] ) from restricted rationals to the orders of approximation by polynomials and unrestricted rationals. We show, for functions that are exactly k-times differentiable on [0,1], that restricted rational approximation cannot be spectacularly more efficient than polynomial approximation. For example, if A[sub n] is the class of rational functions of degree n with monotone denominators and for some f the corresponding [Mathematical Equation] then f is k-times continuously differentiable on (0,1] . The situation is more complicated for analytic functions. In this case restricted rational approximations vary from being no more efficient than polynomials to being arbitrarily faster. For functions of the form ∑a[sub n]x[sup n], where a[sub n] ↓ 0, we show that the order of approximation by rationals with denominators having positive coefficients is the same as the polynomial order. Finally, we develop approximation theorems for rational functions with positive coefficients. (This class does not contain the polynomials so we cannot a priori assert denseness.) We show that it is possible to approximate positive functions fairly efficiently from this class. For instance, if f is analytic and positive on [0,1] then the order of approximation by rational functions of degree n with positive coefficients is at least as rapid as [Mathematical Equation], where ρ > 1 . === Science, Faculty of === Mathematics, Department of === Graduate
author Borwein, Peter B.
spellingShingle Borwein, Peter B.
Restricted uniform rational approximations
author_facet Borwein, Peter B.
author_sort Borwein, Peter B.
title Restricted uniform rational approximations
title_short Restricted uniform rational approximations
title_full Restricted uniform rational approximations
title_fullStr Restricted uniform rational approximations
title_full_unstemmed Restricted uniform rational approximations
title_sort restricted uniform rational approximations
publishDate 2010
url http://hdl.handle.net/2429/21801
work_keys_str_mv AT borweinpeterb restricteduniformrationalapproximations
_version_ 1718591821170343936