<p>A general scheme for estimating the total error of a computational algorithm is presented. Optimal algorithms are constructed under conditions that utilize the most complete information available about the problem. Reserves for computing optimization are considered.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Elements of the General Theory of Optimal Algorithms

  • V. K. Zadiraka,
  • I. V. Shvidchenko

摘要

A general scheme for estimating the total error of a computational algorithm is presented. Optimal algorithms are constructed under conditions that utilize the most complete information available about the problem. Reserves for computing optimization are considered.