Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Termination conditions for approximating linear problems with noisy information
HTML articles powered by AMS MathViewer

by B. Z. Kacewicz and L. Plaskota PDF
Math. Comp. 59 (1992), 503-513 Request permission

Abstract:

We study the diameter termination criterion for approximating linear continuous problems. It is assumed that only nonexact information about the problem is available. We evaluate the quality of the diameter termination criterion by comparing it with the theoretically best stopping condition. The comparison is made with respect to the cost of computing an $\epsilon$-approximation. Although the diameter termination criterion is independent of a particular problem, it turns out to be essentially equivalent to the theoretical condition. Optimal information and the best way of constructing an $\epsilon$-approximation are exhibited.
References
    K. I. Babenko, Theoretical background and constructing computational algorithms for mathematical-physical problems, Nauka, Moscow, 1979. (Russian)
  • B. Z. Kacewicz and L. Plaskota, On the minimal cost of approximating linear problems based on information with deterministic noise, Numer. Funct. Anal. Optim. 11 (1990), no. 5-6, 511–528. MR 1079289, DOI 10.1080/01630569008816386
  • B. Z. Kacewicz and L. Plaskota, Noisy information for linear problems in the asymptotic setting, J. Complexity 7 (1991), no. 1, 35–57. MR 1096171, DOI 10.1016/0885-064X(91)90043-W
    • A. A. Marchuk and K. Y. Osipenko, Best approximation of functions specified with an error at a finite number of points, Math. Notes 17 (1975), 207-212.
  • C. A. Micchelli and T. J. Rivlin, A survey of optimal recovery, Optimal estimation in approximation theory (Proc. Internat. Sympos., Freudenstadt, 1976) Plenum, New York, 1977, pp. 1–54. MR 0617931
  • J. F. Traub, G. W. Wasilkowski, and H. Woźniakowski, Information-based complexity, Computer Science and Scientific Computing, Academic Press, Inc., Boston, MA, 1988. With contributions by A. G. Werschulz and T. Boult. MR 958691
    • G. M. Trojan, Asymptotic setting for linear problems, unpublished, see Traub et al. [6, pp. 383-395].
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65J10, 41A65
  • Retrieve articles in all journals with MSC: 65J10, 41A65
Additional Information
  • © Copyright 1992 American Mathematical Society
  • Journal: Math. Comp. 59 (1992), 503-513
  • MSC: Primary 65J10; Secondary 41A65
  • DOI: https://doi.org/10.1090/S0025-5718-1992-1142284-4
  • MathSciNet review: 1142284