McNaughton functions play the same role in Εukasiewicz logics as Boolean functions do in classical logic. Formulas in one variable are an important ingredient of automated deduction in many-valued logics: the aim of this paper is to establish some results on the complexity of the problems of functio
Approximating harmonic functions on Rn with one function of a single complex variable
β Scribed by R. J. Whitley; T. V. Hromadka II
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 114 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0749-159X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let β be a bounded open set in R n , n ΟΎ 2, with R n Οͺ β a connected set that is not thin at each point of Ρ¨β. Then any solution to a Dirichlet problem for given continuous boundary data on Ρ¨β can be approximated in a simple way by a sum that involves one function f (z) of a single complex variable z; any analytic function f(z) not a polynomial can be used. One consequence of this approximation property is that any harmonic polynomial can be written (exactly, not approximately) as a finite sum involving polynomials in one complex variable. These results reveal an unexpected simplicity in the structure of harmonic functions on R n . It is a common and simple observation that harmonic analysis is more difficult in three or more dimensions than in two dimensions because you do not have the direct use of the theory of analytic functions of a single complex variable; the results here show that this obvious observation is not correct.
For applications, these approximating sums provide a large collection of functions that can be fit to given boundary data and used for the numerical solution of Dirichlet problems in R n .
The harmonic functions considered will be real-valued functions of a variable in R n , typically x Ο (x 1 , x 2 , . . . , x n ), with n ΟΎ 2.
The Walsh-Lebesgue Theorem states that if K is a compact subset of R 2 , with R 2 Οͺ K connected, then every continuous real-valued function on Ρ¨K can be uniformly approximated by functions of the form Re P(z), P(z) a polynomial in the complex variable z. Theorem 1 generalizes this result to R n , with a proof that is a modification of the proof given in [1, Corollary 6.3.4, p 173] for R 2 .
Theorem 1. Let β be a bounded domain in R n , n ΟΎ 2, with R n Οͺ β connected. Suppose that R n Οͺ β is not thin at any point of Ρ¨β.
(1)
π SIMILAR VOLUMES
In contrast to the complex case, the best Chebyshev approximation with respect to a finite-dimensional Haar subspace \(V \subset C(Q)\) ( \(Q\) compact) is always strongly unique if all functions are real valued. However, strong uniqueness still holds for complex valued functions \(f\) with a so-cal
Information is given concerning the implemention and complexity of an important family of signal classi"ers.