s-numbers in information-based complexity (Q757049): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:26, 30 January 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
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
worst analysis
0 references
average case analysis
0 references
linear problems
0 references
information-based complexity
0 references
