Are linear algorithms always good for linear problems? (Q1082778): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Arthur G. Werschulz / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Henryk Woźniakowski / rank | |||
Normal rank | |||
Revision as of 15:10, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are linear algorithms always good for linear problems? |
scientific article |
Statements
Are linear algorithms always good for linear problems? (English)
0 references
1986
0 references
The question is, if there are linear optimal error algorithms for all linear problems. The answer is no, which is shown in this paper with a general construction, for which every linear algorithm has infinite error, but there is a mildly nonlinear algorithm with finite error, which can be made arbitrarily small if appropriate information is used. As an example the inversion of Laplace transform over a finite interval is considered, a problem arising in remote sensing.
0 references
complexity
0 references
information operator
0 references
Laplace transform inversion
0 references
linear optimal error algorithms
0 references
mildly nonlinear algorithm
0 references
