Optimal recovery of functions of class \(E_ p\), \(1\leq p\leq\infty\), in multiply connected domains (Q1358069)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Optimal recovery of functions of class \(E_ p\), \(1\leq p\leq\infty\), in multiply connected domains
scientific article

    Statements

    Optimal recovery of functions of class \(E_ p\), \(1\leq p\leq\infty\), in multiply connected domains (English)
    0 references
    0 references
    0 references
    4 June 1998
    0 references
    Let \(G\) be a domain in the complex plane and let \(z_0, z_1,\dots , z_n\) be distinct points in \(G\). Let \(L^1_p(G)\), \(1\leq p \leq \infty\), denote the class of functions \(f\) that are analytic in \(G\) and have limiting values a.e. on the boundary \(\Gamma\) of \(G\) with \( \int_{\Gamma}|f(z)|^p|dz|\leq 1\). If \(S(\xi_1, \dots ,\xi_n)\) is an arbitrary function then the recovery error of \(f(z_0)\) from values \(f(z_1), \dots, f(z_n)\) by means of the method \(S\), is defined by \(r_n(S)=\sup\{|f(z_0) - S(f(z_1),\dots, f(z_n))|: f\in E^1_p(G)\}\). A method \(S_0\) is said to be a best approximation method if \(r_n(S_0)= \inf r_n(S)\), where the infimum taken over all functions \(S\) in \(n\) variables. The author study the problem of optimal recovery of functions \(f\in E^1_p(G)\) in an m-connected domain \(G\). He investigates the structure of the set of linear best recovery methods and studies the question of the behavior of the coefficients of linear best methods as the given points \(z_1,\dots, z_n\) tend to the boundary \(\Gamma\). The number and location of zeros of an extremal function in the problem of the error of a best approximation method (in \(E^1_{\infty}(G)\)) are also considered.
    0 references
    0 references
    0 references
    0 references
    0 references
    best recovery of analytic functions
    0 references
    Cauchy kernel
    0 references
    complex Green's function
    0 references
    harmonic measure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references