On the average complexity of multivariate problems (Q757054): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3935962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptically contoured measures on infinite-dimensional Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian measures in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of linear functionals on a Banach space with a Gaussian measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4042533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can adaption help on the average? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for linear problems with Gaussian measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case optimal algorithms in Hilbert spaces / rank
 
Normal rank

Latest revision as of 15:24, 21 June 2024

scientific article
Language Label Description Also known as
English
On the average complexity of multivariate problems
scientific article

    Statements

    On the average complexity of multivariate problems (English)
    0 references
    1990
    0 references
    A linear problem is the approximation of S(f), where S is a continuous linear operation S: \(F_ 1\to F_ 2\). It is typically assumed that \(F_ 2\) is a separable Hilbert space, and either \(F_ 1\) is also a separable Hilbert space or S is of some special form. Known results are extended for the case where \(F_ 1\) is a separable Banach space equipped with a Gaussian or orthogonally invariant measure, and S is an arbitrary continuous linear operator. The results are applied to the approximation of real functions of d variables. In particular, it is shown that the average complexity of this problem is almost independent of the dimension d if arbitrary linear functionals are permitted in the information.
    0 references
    linear problems
    0 references
    Wiener space
    0 references
    optimal algorithm
    0 references

    Identifiers