s-numbers in information-based complexity (Q757049): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the quality of computational algorithms. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the quality of computational algorithms. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: HILBERT-Zahlen von Operatoren in BANACHräumen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How powerful is continuous nonlinear information for linear problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian measures in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772256 / 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: Q3743894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4748891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal projections are optimal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous selections. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear problems (with extended range) have linear optimal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments in information-based complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: s-Numbers of operators in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4183861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case optimality for linear problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can adaption help on the average? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic setting of information-based complexity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:24, 21 June 2024

scientific article
Language Label Description Also known as
English
s-numbers in information-based complexity
scientific article

    Statements

    s-numbers in information-based complexity (English)
    0 references
    0 references
    1990
    0 references
    The paper gives a detailed analysis of various approximate methods for solving linear problems in the sense of information-based complexity. It is focused on the situations in which different classes yield the same error, and the maximal differences in the errors of different classes. These are treated in the worst case and average case settings.
    0 references
    0 references
    worst analysis
    0 references
    average case analysis
    0 references
    linear problems
    0 references
    information-based complexity
    0 references