Trigonometric moment problem with a port, the Levinson algorithm, and some application issues (Q1204939): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3819492 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3356865 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5737276 / rank | |||
Normal rank | |||
Latest revision as of 15:06, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trigonometric moment problem with a port, the Levinson algorithm, and some application issues |
scientific article |
Statements
Trigonometric moment problem with a port, the Levinson algorithm, and some application issues (English)
0 references
1 April 1993
0 references
An effective test of solvability of a trigonometric moment problem with a port is obtained. The test is based on the Levinson algorithm. It uses recurrence relations for polynomials orthogonal on the unit circle. Some applications are discussed.
0 references
orthogonal polynomials
0 references
trigonometric moment problem
0 references
Levinson algorithm
0 references
recurrence relations
0 references
