Result: Construction of the polynomial of least deviation for approximations with a sign-sensitive weight

Title:
Construction of the polynomial of least deviation for approximations with a sign-sensitive weight
Authors:
Chumak, A. A.
Publisher Information:
Russian Academy of Sciences - RAS (Rossiĭskaya Akademiya Nauk - RAN), Moscow; Nauka, Moscow
Subject Terms:
Best approximation, Chebyshev systems, approximations, Merchubery theorem, compact, Algorithms for approximation of functions, Chebyshev functions, Numerical approximation and evaluation of special functions, iteration, Weierstrass theorem, Haar theorem
Document Type:
Academic journal Article
File Description:
application/xml
Access URL:
https://zbmath.org/2124558
Accession Number:
edsair.c2b0b933574d..545e2e2ab229779c19db913c8486f9a1
Database:
OpenAIRE

Further Information

There is developed an iteration algorithm of the Remez type for finding the generalized polynomial of the least deviation from the real continuous function in the sign - sensitive metrics. This function is determined by non-degenerated continuous weight at the compact of the real line or of the circle. A convergence of given algorithm at the rate of geometric progression is proved.