# The condition number of real Vandermonde, Krylov and positive definite Hankel matrices

@article{Beckermann2000TheCN, title={The condition number of real Vandermonde, Krylov and positive definite Hankel matrices}, author={Bernhard Beckermann}, journal={Numerische Mathematik}, year={2000}, volume={85}, pages={553-577} }

Summary. We show that the Euclidean condition number of any positive definite Hankel matrix of order
$n\geq 3$ may be bounded from below by
$\gamma^{n-1}/(16n)$ with
$\gamma=\exp(4 \cdot{\it Catalan}/\pi) \approx 3.210$, and that this bound may be improved at most by a factor
$8 \gamma n$. Similar estimates are given for the class of real Vandermonde matrices, the class of row-scaled real Vandermonde matrices, and the class of Krylov matrices with Hermitian argument. Improved bounds are…

## 133 Citations

### On the Singular Values of Matrices with Displacement Structure

- Mathematics, Computer ScienceSIAM J. Matrix Anal. Appl.
- 2017

This paper uses an extremal problem involving rational functions to derive explicit bounds on the singular values of Hankel matrices, and shows that a real $n\times n$ positive definite Hankel matrix can be approximated, up to an accuracy of $0<\epsilon<1$ by a rank $\mathcal{O}(\log n\log(1/\ep silon) )$ matrix.

### Asymptotically Optimal Lower Bounds for the Condition Number of a Real Vandermonde Matrix

- Computer Science, MathematicsSIAM J. Matrix Anal. Appl.
- 2006

Lower bounds on the condition number $\min\kappa_p(V)$ of a real Vandermonde matrix $V$ are established in terms of the dimension $n$ or $n$ and the largest absolute value among all nodes that define…

### Vandermonde Matrices with Nodes in the Unit Disk and the Large Sieve

- Computer Science, MathematicsApplied and Computational Harmonic Analysis
- 2019

### Minimal condition number for positive definite Hankel matrices using semidefinite programming

- Computer Science, Mathematics
- 2010

### On the numerical condition of a generalized Hankel eigenvalue problem

- MathematicsNumerische Mathematik
- 2007

The sensitivity of the nonlinear application mapping the vector of Hankel entries to its generalized eigenvalues is studied, a result on the condition number of Vandermonde matrices with not necessarily real abscissas which are possibly row-scaled.

### Lower bounds for the condition number of a real confluent Vandermonde matrix

- Mathematics, Computer ScienceMath. Comput.
- 2006

Lower bounds on the condition numberp(Vc) of a real con∞uent Vander- monde matrix Vc are established in terms of the dimension n or n and the largest absolute value among all nodes that deflne the…

### The spectral properties of Vandermonde matrices with clustered nodes

- Mathematics, Computer ScienceArXiv
- 2019

### 05-02 Vandermonde Matrices with Chebyshev Nodes 1

- Computer Science
- 2005

Applications to the study of sharpness in existing error bounds for the conjugate gradient method and the minimal residual method for linear systems and the symmetric Lanczos method for eigenvalue problems are discussed.

## References

SHOWING 1-10 OF 21 REFERENCES

### The condition of gram matrices and related problems

- Computer Science, MathematicsProceedings of the Royal Society of Edinburgh: Section A Mathematics
- 1978

The degree of ill-conditioning, for a general inner-product space, in terms of the basis is characterized, and it is shown, for example, that the powers {1, z, z2,…} are a universally bad choice of basis.

### Lower bounds for the condition number of Vandermonde matrices

- Mathematics
- 1987

SummaryWe derive lower bounds for the ∞-condition number of then×n-Vandermonde matrixVn(x) in the cases where the node vectorxT=[x1, x2,...,xn] has positive elements or real elements located…

### On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type method

- Mathematics
- 1986

SummaryWe investigate approximation problems of the form(P)
$$\mathop {\min }\limits_{p:p(0) = 1} \mathop {\max |p(\lambda )|}\limits_{\lambda \in S} $$
withp ranging over all polynomials of degree…

### The Sensitivity of Least Squares Polynomial Approximation

- Mathematics
- 1999

Given integers N ≥n ≥ 0, we consider the least squares problem of finding the vector of coefficients \( \overrightarrow P\) with respect to a polynomial basis {po, …, p n }, deg p j = j, of a…

### Optimally conditioned Vandermonde matrices

- Mathematics
- 1975

SummaryWe discuss the problem of selecting the points in an (n×n) Vandermonde matrix so as to minimize the condition number of the matrix. We give numerical answers for 2≦n≦6 in the case of symmetric…

### Norm estimates for inverses of Vandermonde matrices

- Mathematics
- 1974

SummaryFormulas, or close two-sided estimates, are given for the norm of the inverse of a Vandermonde matrix when the constituent parameters are arranged in certain symmetric configurations in the…

### Logarithmic Potentials with External Fields

- Mathematics
- 1997

This treatment of potential theory emphasizes the effects of an external field (or weight) on the minimum energy problem. Several important aspects of the external field problem (and its extension to…

### Introduction to Numerical Analysis

- Computer Science
- 2002

This well written book is enlarged by the following topics:
$B$-splines and their computation, elimination methods for
large sparse systems of linear equations, Lanczos algorithm for
eigenvalue…

### The algebraic eigenvalue problem

- Mathematics
- 1965

Theoretical background Perturbation theory Error analysis Solution of linear algebraic equations Hermitian matrices Reduction of a general matrix to condensed form Eigenvalues of matrices of…