References
- S. Banach and S. Mazur, Sur les fonctions calculables, Ann. Soc. Pol. de Math. 16 (1937), pp. 223.
- V. Brattka, Computability of Banach Space Principles, Informatik Berichte 286, Fern University Hagen, Fachbereich Informatik, Hagen, June 2001.
- V. Brattka, Computability over topological structures, in Computability and Models, S. Barry Cooper and Sergey S. Goncharov, eds., Kluwer Academic Publishers, New York, 2003, pp. 93–136.
- V. Brattka and A. Yoshikawa, Towards computability of elliptic boundary value problems in variational formulation, J. Complexity 22(6) (2006), pp. 858–880. doi: 10.1016/j.jco.2006.04.007
- V. Brattka, A computable version of Banach's Inverse Mapping Theorem, Annals of Pure and Applied Logic 157 (2-3) (2009), pp. 85–96. doi: 10.1016/j.apal.2008.09.002
- V. Brattka and R. Dillhage, Computability of compact operators on computable Banach spaces with bases, Math. Log. Quart. 53(4/5) (2007), pp. 345–364. doi: 10.1002/malq.200710004
- O. Christensen, An introduction to Frames and Riesz Bases, Birkhauser, Boston, 2003.
- R.J. Duffin and A.C. Schaeffer, A class of nonharmonic Fourier series, Trans. Amer. Math. Soc. 72 (1952), pp. 341–366. doi: 10.1090/S0002-9947-1952-0047179-6
- A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math. 44 (1957), pp. 61–71. doi: 10.4064/fm-44-1-61-71
- C. Heil, A basis theory primer, Birkhauser, Boston, (expanded edition), 1998.
- C. Kreitz and K. Weihrauch, A unified approach to constructive and recursive analysis, in Computation and Proof Theory, Lecture Notes in Mathematics, M. Richter, E. Borger, W. Oberschelp, B.Schinzel, W. Thomas, eds., Vol. 1104, Springer, Berlin, 1984, pp. 259–278.
- D. Lacombe, Les ensembles recursivement ouverts ou fermes, et leurs applications a 1'Analyse recursive, Comptes, Rendus 246 (1958), pp. 28–31.
- D. Lacombe, Quelques procedes de definition en topologie recursive, in: Constructivity in mathematics, A. Heyting, ed., North-Holland, Amsterdam 1959, pp. 129–158.
- J. Leng, D. Han and T. Huang, Optimal dual frames for communication coding with probabilistic erasures, IEEE Trans. Signal Process. 59(11) (2011), pp. 5380–5389. doi: 10.1109/TSP.2011.2162955
- J. Leng and T. Huang, Construction of Fusion Frame Systems in Finite Dimensional Hilbert Spaces, Abstr. Appl. Anal. 2014 (2013). Special Issue Article ID 836731, pp. 9.
- M.B. Pour-El and J.I. Richards, Computability in Analysis and Physics, Springer, Berlin, 1989.
- D. Lacombe, Les ensembles recursivement ouverts ou fermes, et leurs applications a 1'Analyse recursive, Comptes, Rendus 246 (1958), pp. 28–31.
- K. Weihrauch, Computable Analysis, Springer, Berlin, 2000.