Traditionally, we measure the quality of an approximation to the solution of a linear operator equation by its error. However, the worst case error is sometimes an unsatisfactory measure of uncertainty, especially for ill-posed problems. In this paper, we propose that the residual be used instead of
โฆ LIBER โฆ
Optimal linear procedures for solving linear operator equations with random data
โ Scribed by A.M. Fedotov
- Publisher
- Elsevier Science
- Year
- 1981
- Weight
- 902 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Optimal residual algorithms for linear o
โ
Arthur G Werschulz
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 961 KB
A simple iterative method for solving li
โ
A.B. Samokhin
๐
Article
๐
1988
๐
Elsevier Science
โ 423 KB
Optimal linear randomized methods for li
โ
Erich Novak
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 576 KB
Basic questions of information-based complexity are strongly related to n-widths and s-numbers. In this paper we study Monte Carlo methods or randomized methods for linear operators. Similar as in the worst case, Math6 defined linear stochastic n-widths. Our main result is the characterization of th
An optimality principle for the error wh
An optimality principle for the error when solving approximately equations with non-linear operators
โ
V.A. Morozov
๐
Article
๐
1974
๐
Elsevier Science
โ 623 KB
The convergence of approximate methods f
โ
G.M. Vainikko; O.O. Karma
๐
Article
๐
1974
๐
Elsevier Science
โ 761 KB
On optimality of Krylov's information wh
โ
A.S Nemirovsky
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 404 KB