Abstract
LetF1 andF2 be normed linear spaces andS:F0 →F2 a linear operator on a balanced subsetF0 ofF1. IfN denotes a finite dimensional linear information operator onF0, it is known that there need not be alinear algorithmφ:N(F4) →F2 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 imbeddingF2 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
