The quadratic moment problem for the unit circle and unit disk (Q1596293): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:04, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The quadratic moment problem for the unit circle and unit disk |
scientific article |
Statements
The quadratic moment problem for the unit circle and unit disk (English)
0 references
24 February 2002
0 references
Given complex numbers \(\gamma_{pq}\), \(0 <p,q\leq n\), \(\gamma_{00} > 0\), and a closed set \({\mathbf K}\subset \mathbb{C}\), the truncated complex \(\mathbf K\)-moment problem consists of finding necessary and sufficient conditions for the existence of a positive Borel measure \(\mu\) supported on \(\mathbf K\), such that \(\gamma_{pq} =\int z^p\overline z^q d\mu(z)\). In a recent paper [Trans. Am. Math. Soc. 352, No.~6, 2825-2855 (2000; Zbl 0955.47011)] the authors made an important contribution to this problem by characterizing the existence of atomic representing measures. The present paper deals with the particular quadratic case \(n = 2\), with six complex numbers \(\gamma_{00}, \gamma_{01}, \gamma_{10}, \gamma_{11}, \gamma_{02}, \gamma_{20}\) and \({\mathbf K}={\mathbf T}\) (the unit circle) or \({\mathbf K}=\overline D\) (the closed unit disk). The authors give concrete algorithms for the construction of atomic representing measures in terms of a certain moment matrix \(M(1)\). For instance, let \({\mathbf K}={\mathbf T}\), \(\gamma_{00} = 1\) and \(M(1)\geq 0\). The following are equivalent: (i) A representing measure exists; (ii) A rank \(M(1)\)-atomic representing measure exists; (iii) \(\gamma_{11}=1\). Going beyond the cited paper, the authors provide here a complete parametrization of the existing atomic measures.
0 references
quadratic moment problem
0 references
atomic representing measures
0 references
algorithms
0 references