算子方程近似解直接方法的优化和信息复杂性研究进展

Advances in the Optimization of Direct Methods and Information Complexity for Approximate Solution of Operator Equation

算子方程近似解直接方法的优化和信息复杂性是80年代发展起来的连续复杂性理论的两个主要方面,是计算机科学和数学的交叉研究领域．本文拟就这两个方面的研究进展做一简要介绍．

The optimization of direct methods and information complexity for approximate solution of operator equation are two main aspects＇of information-based complexity theory, which has been developed from the eighties and is an interdiscipline of computer science and mathematics. The concern of this paper is to introduce the advances in above two aspects.