Ning Zhong
Abstract
The theory of generalized functions is the foundation of the modern theory of partial differential equations (PDE). As computers are playing an ever-larger role in solving PDEs, it is important to know those operations involving generalized functions in analysis and PDE that can be computed on digital computers. In this article, we introduce natural concepts of computability on test functions and generalized functions, as well as computability on Schwartz test functions and tempered distributions. Type-2 Turing machines are used as the machine model [Weihrauch 2000]. It is shown here that differentiation and integration on distributions are computable operators, and various types of Fourier transforms and convolutions are also computable operators. As an application, it is shown that the solution operator of the distributional inhomogeneous three dimensional wave equation is computable.
- Barros-Neto, J. 1973. An introduction to the theory of distributions. In Pure and Applied Mathematics, vol. 14. Marcel Dekker Inc., New York.Google Scholar
- Dunford, N., and Schwartz, J. T. 1959. Linear Operators Part I: General Theory. J. Wiley, New York.Google Scholar
- Grzegorczyk, A. 1955. Computable functionals. Fund. Math. 42, 168--202.Google ScholarCross Ref
- Grzegorczyk, A. 1957. On the definitions of computable real continuous functions. Fund. Math. 44, 61--71.Google ScholarCross Ref
- Hopcroft, J. E., and Ullman, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Pa. Google Scholar
- Kreitz, C., and Weihrauch, K. 1985. Theory of representations. Theoret. Comput. Sci. 38, 35--53.Google ScholarCross Ref
- Myhill, J. 1971. A recursive function defined on a compact interval and having a continuous derivative that is not recursive. Mich. Math. J. 18, 97--98.Google ScholarCross Ref
- Normann, D. 2002. Exact real number computations relative to hereditarily total functionals. Theoret. Comput. Sci. 284, 2, 437--453. Google ScholarDigital Library
- Odifreddi, P. 1989. Classical recursion theory. In Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland, Amsterdam, The Netherland.Google Scholar
- Rauch, J. 1997. Partial differential equations, In Graduate Texts in Mathematics. 2nd ed. Springer, New York.Google Scholar
- Rogers, H. 1967. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York. Google Scholar
- Schwartz, L. 1966. Théorie des Distributions. Hermann, Paris, France. Nouvelle édition.Google Scholar
- Schröder, M. 2001. Admissible representations of limit spaces. In Computability and Complexity in Analysis, Jens Blanck, Vasco Brattka, and Peter Hertling, Eds. Lecture Notes in Computer Science. (Berlin, Springer, Germany), New York.Google Scholar
- Turing, A. M. 1936. On computable numbers, with an application to the "Entscheidungsproblem." Proc. London Math. Soc. 42, 2, 230--265.Google Scholar
- Washihara, M. 1999. Computability and tempered distributions. Math. Japon. 50, 1, 1--7.Google Scholar
- Weihrauch, K. 1987. Computability. In EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Germany. Google Scholar
- Weihrauch, K. 1997. A foundation for computable analysis. In SOFSEM'97: Theory and Practice of Informatics, František Plášil and Keith G. Jeffery, Eds. Lecture Notes in Computer Science, vol. 1338. Springer-Verlag, Berlin, pp. 104--121. Google Scholar
- Weihrauch, K. 1999. Computability on the probability measures on the Borel sets of the unit interval. Theoret. Comput. Sci. 219, 421--437. Google ScholarDigital Library
- Weihrauch, K. 2000. Computable Analysis. Springer-Verlag, Berlin, Germany. Google Scholar
- Weihrauch, K., and Zhong, N. 2002. Is wave propagation computable or can wave computers beat the Turing machine? Proc. London Math. Soc. 85, 2, 312--332.Google ScholarCross Ref
- Zhong, N., and Weihrauch, K. 2000. Computability theory of generalized functions. Informatik Berichte 276, FernUniversität Hagen, Hagen. Sept.Google Scholar
Index Terms
- Computability theory of generalized functions
Recommendations
Characterizing Computable Analysis with Differential Equations
The functions of Computable Analysis are defined by enhancing the capacities of normal Turing Machines to deal with real number inputs. We consider characterizations of these functions using function algebras, known as Real Recursive Functions. Bournez ...
The closure properties on real numbers under limits and computable operators
In effective analysis, various classes of real numbers are discussed. For example, the classes of computable, semi-computable, weakly computable, recursively approximable real numbers, etc. All these classes correspond to some kind of (weak) ...
Computability on subsets of metric spaces
The notions “recursively enumerable” and “recursive” are the basic notions of effectivity in classical recursion theory. In computable analysis, these notions are generalized to closed subsets of Euclidean space using their metric distance functions. We ...
Comments