Computational complexity in numerical analysis

The authors state their objectives as follows. They wish to present to the Polish audience the main aspects of a modern approach to numerical methods based on the concept of computational complexity. Instead of looking for computational methods which compare favorably with other commonly used techniques, and "gradually'' improving numerical methods for solving a given set of problems, one could formulate an optimality criterion based on the cost of performing numerical computations and regard the choice of a computational technique as a problem of optimization theory. This approach is illustrated by specific examples, such as the choice of a fast Fourier transformation, and a solution of an algebraic system of linear equations. (see MR0519667)