Rate of approximation of entire functions by a complete Dirichlet system (Q1058620)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rate of approximation of entire functions by a complete Dirichlet system |
scientific article |
Statements
Rate of approximation of entire functions by a complete Dirichlet system (English)
0 references
1984
0 references
The author describes the class of functions that can be approximated at the rate of a geometric progression by a complete Dirichlet system with bounded exponents. Let \(\{\lambda_ n\}\) be a sequence of complex numbers satisfying Re \(\lambda\) \({}_ k\geq a>0\), \(| \lambda_ k| \leq M\). Let \(H_ n\) be the set of generalized Dirichlet polynomials constructed by the first n functions of the system \(\{x^{s_ k-1}e^{-\lambda_ kx}\}\) \((s_ k\) is the number of times \(\lambda_ k\) appears in \(\lambda_ 1,...,\lambda_ k)\). For \(f\in L_ 2(0,\infty)\) set \[ E_ n(f)=\inf_{P\in H_ n}\| f-P\|_{L_ 2(0,\infty)}. \] The main result is the following Theorem. Let \(f\in L_ 2(0,\infty)\). Then \(\overline{\lim}_{n\to \infty}^ n\sqrt{E_ n(f)}<1\Leftrightarrow f\) coincides almost everywhere with the restriction of an entire function of exponential type with indicator diagram in the open left halfplane.
0 references
complete Dirichlet system
0 references
entire function of exponential type
0 references
indicator diagram
0 references