How bad are Hankel matrices? (Q1326373): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s002110050027 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005229894 / rank | |||
Normal rank |
Latest revision as of 21:04, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How bad are Hankel matrices? |
scientific article |
Statements
How bad are Hankel matrices? (English)
0 references
9 October 1994
0 references
It is proved that the spectral condition number for any real positive definite Hankel matrix of order \(n\) is lower bounded by \(3 \cdot 2^{n- 6}\). This result appears as a consequence of viewing the corresponding scaled Vandermonde matrix as the Krylov basis matrix whose spectral condition number is bounded from below by \(3^{1\over 2} \cdot 2^{{n\over 2}-3}\). As a byproduct it is obtained a lower estimate for the spectral condition number of Vandermonde matrices with arbitrary nodes.
0 references
conditioning
0 references
spectral condition number
0 references
real positive definite Hankel matrix
0 references
scaled Vandermonde matrix
0 references
Krylov basis matrix
0 references