Research Papers

aequationes mathematicae

, Volume 31, Issue 1, pp 18-25

First online:

Linear problems (with extended range) have linear optimal algorithms

  • Edward W. PackelAffiliated withDepartment of Computer Science, Columbia University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


LetF 1 andF 2 be normed linear spaces andS:F 0F 2 a linear operator on a balanced subsetF 0 ofF 1. IfN denotes a finite dimensional linear information operator onF 0, it is known that there need not be alinear algorithmφ:N(F 4) →F 2 which is optimal in the sense that ‖φ(N(f)) −S(f‖ is minimized. We show that the linear problem defined byS andN can be regarded as having a linear optimal algorithm if we allow the range ofφ to be extended in a natural way. The result depends upon imbeddingF 2 isometrically in the space of continuous functions on a compact Hausdorff spaceX. This is done by making use of a consequence of the classical Banach-Alaoglu theorem.

AMS (1980) subject classification

Primary 41A45, 41A65, 65J10 Secondary 46B99, 68C05