Let X be a normed linear space, Un an n-dimensional Chebyshev subspace of X. For f ∈ X denote by p(f) ∈ Un its best approximation in Un. The problem of strong unicity consists in estimating how fast ...
Kövari and Pommerenke [19], and Elliott [8], have shown that the truncated Faber series gives a polynomial approximation which (for practical values of the degree of the polynomial) is very close to ...
Approximation theory and asymptotic methods form a foundational framework that bridges classical ideas with modern numerical analysis, enabling researchers to obtain practical, near‐optimal solutions ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results