Reconstruction of <i>H<sup>p</sup> </i>-Functions: Best Approximation, Regularization and Optimal Error Estimates (Q4820448)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2108034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstruction of <i>H<sup>p</sup> </i>-Functions: Best Approximation, Regularization and Optimal Error Estimates |
scientific article; zbMATH DE number 2108034 |
Statements
Reconstruction of <i>H<sup>p</sup> </i>-Functions: Best Approximation, Regularization and Optimal Error Estimates (English)
0 references
15 October 2004
0 references
Hardy space
0 references
ill-posed problem
0 references
best pointwise approximation
0 references
regularization
0 references
optimal error estimates
0 references
Blaschke condition
0 references
0.8913065
0 references
0.88650024
0 references
0 references
0.8799344
0 references
0.87890357
0 references
0.87884927
0 references
0.8748131
0 references
0.87437075
0 references
The reconstruction of an \(H^p\)-function \(u\) from its values at a given set of points in the unit disk \(U\) is the main problem under consideration in the present paper. More specifically, the problem is to find a function \(u\in H^p\) with \[ u(z_{nk})=\mu_{nk}, \qquad n=1,2,\ldots; \quad k=1,2,\ldots,n, \] where \(\{z_{nk}\}_{n=1}^\infty\), \(1\leq k\leq n\) is a given point system in \(U\) (\(z_{nk}\not=z_{nj}\), \(j\not=k\)), which satisfy the Blaschke condition \[ \lim_{n\to\infty} \sum_{k=1}^n (1-| z_{nk}| )=\infty, \] and \(\{\mu_{nk}\}_{n=1}^\infty\), \(1\leq k\leq n\) is a given data. The authors present a regularization of the general problem based on finite best approximations. They give an explicit form of a sequence of functions (not necessarily analytic) that converge optimally to the solution whenever the data is exact, and that represent approximations to the solution whenever the data is nonexact. In the latter case the error of approximation is made as small as possible.
0 references