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}
}
  • B. Beckermann
  • Published 1 June 2000
  • Mathematics, Computer Science
  • Numerische Mathematik
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… 

On the Singular Values of Matrices with Displacement Structure

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

  • Ren-Cang Li
  • Computer Science, Mathematics
    SIAM 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

The numerical rank of Krylov matrices

  • A. Dax
  • Computer Science, Mathematics
  • 2017

Vandermonde matrices with Chebyshev nodes

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

On the numerical condition of a generalized Hankel eigenvalue problem

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

  • Ren-Cang Li
  • Mathematics, Computer Science
    Math. 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

Li, Ren-Cang Vandermonde matrices with Chebyshev nodes.

The results, as the author says, can be extended to Vandermonde matrices with nodes being zeros of any translated orthogonal polynomial other than Chebyshev ones.
...

References

SHOWING 1-10 OF 21 REFERENCES

The condition of gram matrices and related problems

  • J. Taylor
  • Computer Science, Mathematics
    Proceedings 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

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

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

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

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

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

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

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

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