Probabilistic complexity analysis for linear problems in bounded domains (Q757053)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Probabilistic complexity analysis for linear problems in bounded domains
scientific article

    Statements

    Probabilistic complexity analysis for linear problems in bounded domains (English)
    0 references
    0 references
    1990
    0 references
    In the study of information-based complexity let p be the probabilistic complexity for solving a problem on a bounded domain. The p can be interpreted as the minimal number of information operations needed to solve the problem with the given precision requirement. Using tools from the Banach space theory, the author provides two-sided estimates of p with upper and lower bounds differing only by a constant factor, for the approximation of functions of the periodic Sobolev class in the Hilbert space.
    0 references
    linear problems
    0 references
    information-based complexity
    0 references
    Banach space
    0 references

    Identifiers