Dispersion Mapping Theorems.
Abstract
A function of three variables is often regarded as inherently simpler than a function of five variables, and there has been much attention given to the nature of complicated functions that can be expressed exactly in various ways in terms of simpler functions. From the viewpoint of computation, however, it is sufficient if a function F can be approximated arbitrarily well by combinations of simple functions. This paper deals with the general structure of this process, and obtains specific theorems that help to describe its limitations, and necessary conditions on the functions F for which this is possible. More detailed applications will be made in the future.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1979
- Accession Number
- ADA079704
Entities
People
- R. Creighton Buck
Organizations
- University of Wisconsin–Madison