s-numbers in information-based complexity (Q757049)
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 4193116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | s-numbers in information-based complexity |
scientific article; zbMATH DE number 4193116 |
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
0.7969881892204285
0 references
0.7500758171081543
0 references
0.7288998365402222
0 references
0.7288998365402222
0 references
