Uniform approximation by generalised polynomials
From MaRDI portal
Publication:4150642
DOI10.1007/BF01932146zbMath0373.41018MaRDI QIDQ4150642
Publication date: 1977
Published in: BIT (Search for Journal in Brave)
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)
Related Items (3)
A linear space where strongly unique elements of best approximation exist ⋮ On first-degree multivariate polynomial approximation ⋮ A geometric characterization of H-sets
Cites Work
- Unnamed Item
- Unnamed Item
- Dégénérescence dans les approximations de Tschebyscheff linéaires et discrètes
- H-sets in linear Approximation
- Minimal H-sets and unicity of best approximations
- Some Chebyshev approximations by polynomials in two variables
- Convergence de l'algorithme de Remes
- Some theorems on Cebysev approximation. II
- Théoremes de caractérisation d'une meilleure approximation dans un espace norme et généralisation de l'algorithme de Remes
- Etude de l'algorithme de Rémès en l'absence de condition de Haar. (Study on the algorithm by Rémès in absence of the condition by Haar)
- Some extremal signatures for polynomials
- Ein Konstruktionsverfahren bei allgemeiner linearer Approximation
- Approximation von Funktionen bei einer und bei mehreren unabhängigen Veränderlichen
- A Unified Approach to Certain Problems of Approximation and Minimization
This page was built for publication: Uniform approximation by generalised polynomials