No label defined (Q3777397)
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 4039226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4039226 |
Statements
1988
0 references
Nevanlinna-Pick theory
0 references
error estimation
0 references
ill-posed problems
0 references
moment problems
0 references
adaptive sequential algorithm
0 references
binary tree algorithm
0 references
0.794213593006134
0 references
0.7929382920265198
0 references
0.7911545038223267
0 references
0.7911394238471985
0 references
[For the entire collection see Zbl 0627.00019.] This paper has a purely functional-analytic approach to the solution of a general class of ill-posed problems known as `moment problems'. A new adaptive sequential algorithm, which involves the choice of `nodes' via a binary tree algorithm, is proved to yield better results than any non- adaptive algorithm. The algorithm is adaptive in the sense that it is adapted to the particular norm used to measure the recovery error. The solution obtained by this method is termed `analytical centre', and several nice properties of this solution are demonstrated. The paper is difficult to read. It uses a lot of implicit notation and it also assumes that the reader is familiar with details of the theory of moment problems.
0 references