A definiteness test for Hankel matrices and their lower submatrices (Q1086322): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5508534 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient solution of linear systems of equations with recursive structure / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear complexity parallel algorithms for linear systems of equations with recursive structure / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3222981 / rank | |||
Normal rank | |||
Revision as of 17:00, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A definiteness test for Hankel matrices and their lower submatrices |
scientific article |
Statements
A definiteness test for Hankel matrices and their lower submatrices (English)
0 references
1987
0 references
A definiteness test for a Hankel matrix \(R=\{r_{i+j}\}^ N_{i,j=0}\) and its lower submatrix \(S=\{r_{i+j+1}\}^{N-1}_{i,j=0}\) is given. The test allows a description of all extensions of R which preserve definiteness of both R and S. This description in turn can be used as a definiteness test and it demonstrates a remarkable numerical stability.
0 references
Hankel matrix
0 references
Stieltjes moment problem
0 references
stability of real polynomials
0 references
numerically stable definiteness test
0 references
0 references
