Lower bounds for the condition number of a real confluent Vandermonde matrix
HTML articles powered by AMS MathViewer
- by Ren-Cang Li;
- Math. Comp. 75 (2006), 1987-1995
- DOI: https://doi.org/10.1090/S0025-5718-06-01856-4
- Published electronically: May 16, 2006
- PDF | Request permission
Abstract:
Lower bounds on the condition number $\kappa _p(V_{\mathrm {c}})$ of a real confluent Vandermonde matrix $V_{\mathrm {c}}$ are established in terms of the dimension $n$, or $n$ and the largest absolute value among all nodes that define the confluent Vandermonde matrix and the interval that contains the nodes. In particular, it is proved that for any modest $k_{\max }$ (the largest multiplicity of distinct nodes), $\kappa _p(V_{\mathrm {c}})$ behaves no smaller than ${\mathcal O}_n((1+\sqrt 2 )^n)$, or than ${\mathcal O}_n((1+\sqrt 2 )^{2n})$ if all nodes are nonnegative. It is not clear whether those bounds are asymptotically sharp for modest $k_{\max }$.References
- George E. Andrews, Richard Askey, and Ranjan Roy, Special functions, Encyclopedia of Mathematics and its Applications, vol. 71, Cambridge University Press, Cambridge, 1999. MR 1688958, DOI 10.1017/CBO9781107325937
- Bernhard Beckermann, The condition number of real Vandermonde, Krylov and positive definite Hankel matrices, Numer. Math. 85 (2000), no. 4, 553–577. MR 1771780, DOI 10.1007/PL00005392
- Åke Björck and Victor Pereyra, Solution of Vandermonde systems of equations, Math. Comp. 24 (1970), 893–903. MR 290541, DOI 10.1090/S0025-5718-1970-0290541-1
- Ȧke Björck and Tommy Elfving, Algorithms for confluent Vandermonde systems, Numer. Math. 21 (1973/74), 130–137. MR 336975, DOI 10.1007/BF01436299
- Peter Borwein and Tamás Erdélyi, Polynomials and polynomial inequalities, Graduate Texts in Mathematics, vol. 161, Springer-Verlag, New York, 1995. MR 1367960, DOI 10.1007/978-1-4612-0793-1
- Walter Gautschi, The condition of Vandermonde-like matrices involving orthogonal polynomials, Linear Algebra Appl. 52/53 (1983), 293–300. MR 709357, DOI 10.1016/0024-3795(83)80020-2
- Walter Gautschi, How (un)stable are Vandermonde systems?, Asymptotic and computational analysis (Winnipeg, MB, 1989) Lecture Notes in Pure and Appl. Math., vol. 124, Dekker, New York, 1990, pp. 193–210. MR 1052434
- Nicholas J. Higham, Accuracy and stability of numerical algorithms, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1996. MR 1368629
- Ren Cang Li, Norms of certain matrices with applications to variations of the spectra of matrices and matrix pencils, Linear Algebra Appl. 182 (1993), 199–234. MR 1207083, DOI 10.1016/0024-3795(93)90500-N
- —, Asymptotically optimal lower bounds for the condition number of a real Vandermonde matrix, Technical Report 2004-05, Department of Mathematics, University of Kentucky, 2004, Avaliable at http://www.ms.uky.edu/~math/MAreport/. (Shortened version to appear in SIAM J. Matrix Appl.)
- Lothar Reichel and Gerhard Opfer, Chebyshev-Vandermonde systems, Math. Comp. 57 (1991), no. 196, 703–721. MR 1094957, DOI 10.1090/S0025-5718-1991-1094957-9
- Evgenij E. Tyrtyshnikov, How bad are Hankel matrices?, Numer. Math. 67 (1994), no. 2, 261–269. MR 1262784, DOI 10.1007/s002110050027
Bibliographic Information
- Ren-Cang Li
- Affiliation: Department of Mathematics, University of Kentucky, Lexington, Kentucky 40506
- Email: rcli@ms.uky.edu
- Received by editor(s): October 20, 2004
- Received by editor(s) in revised form: May 23, 2005
- Published electronically: May 16, 2006
- Additional Notes: This work was supported in part by the National Science Foundation CAREER award under Grant No. CCR-9875201 and by the National Science Foundation under Grant No. DMS-0510664.
- © Copyright 2006 American Mathematical Society
- Journal: Math. Comp. 75 (2006), 1987-1995
- MSC (2000): Primary 15A12, 65F35
- DOI: https://doi.org/10.1090/S0025-5718-06-01856-4
- MathSciNet review: 2240645