×

Rectangular Vandermonde matrices on Chebyshev nodes. (English) Zbl 0992.15023

A rectangular Vandermonde matrix \(V=\{V_{ij}\}= \{x_i^{j-1}\}\) \((i=1,\dots, n;\;j=1,\dots, m;\;n\leq m)\) defined on the so-called Chebyshev nodes (the roots of Chebyshev polynomials of the first order) is studied, by making use of combinatorial identities from number theory [cf. A. Eisinberg, P. Pugliese, and N. Salerno, Numer. Math. 87, No. 4, 663–674 (2001; Zbl 0974.65029); A. Eisinberg, G. Franzé, and P. Puyliese, Linear Algebra Appl. 283, No. 1-3, 205–219 (1998; Zbl 0935.65016) and Numer. Math. 80, No. 1, 75–85 (1998; Zbl 0913.65022)]. The explicit factorizations \(V=HUD\) as well as \(V^+= (1/n)D^{-1}QBH^T\) are presented, where \(H\) is rectangular, \(U\) and \(Q=U^{-1}\) are triangular, \(D\) and \(B\) \((B_{1,1}= 1;\;B_{i,i}=2;\;i=2,\dots,n)\) are diagonal matrices. It is proved that the so-called condition number [cf. G. H. Golub and C. F. Van Loan, Matrix computations, 2nd ed. (1989; Zbl 0733.65016), 1. Aufl. (Zbl 0559.65011)] of the matrix \(V\) does not depend on the dimension of the nodes sets. Numerical experiments are also performed and, as a result, some numerical properties of the proposed formulae are established.
Reviewer: A.A.Bogush (Minsk)

MSC:

15B57 Hermitian, skew-Hermitian, and related matrices
15A12 Conditioning of matrices
65F35 Numerical computation of matrix norms, conditioning, scaling
15A09 Theory of matrix inversion and generalized inverses
15A23 Factorization of matrices
68R05 Combinatorics in computer science
93E24 Least squares and related methods for stochastic control systems

Software:

Mathematica; Matlab
Full Text: DOI

References:

[1] Demeure, C. J., Fast QR factorization of Vandermonde matrices, Linear Algebra Appl., 122 (3-4), 165-194 (1989) · Zbl 0687.65025
[2] A. Eisinberg, P. Pugliese, N. Salerno, Vandermonde matrices on integer nodes: the rectangular case, Numer. Math., 87 (4) (2001) 663-674; A. Eisinberg, P. Pugliese, N. Salerno, Vandermonde matrices on integer nodes: the rectangular case, Numer. Math., 87 (4) (2001) 663-674 · Zbl 0974.65029
[3] Eisinberg, A.; Franzé, G.; Pugliese, P., Vandermonde matrices on Chebyshev nodes, Linear Algebra Appl., 283, 205-219 (1998) · Zbl 0935.65016
[4] Eisinberg, A.; Franzé, G.; Pugliese, P., Vandermonde matrices on integer nodes, Numer. Math., 80, 75-85 (1998) · Zbl 0913.65022
[5] D.E. Knuth, The Art of Computer Programming, vol. 1. Fundamental Algorithms, second ed., Addison-Wesley, Reading, MA, 1973; D.E. Knuth, The Art of Computer Programming, vol. 1. Fundamental Algorithms, second ed., Addison-Wesley, Reading, MA, 1973 · Zbl 0302.68010
[6] I.S. Gradshteyn, I.M. Ryzhik, Table of Integrals, Series and Products, third ed., Academic Press, New York, 1965; I.S. Gradshteyn, I.M. Ryzhik, Table of Integrals, Series and Products, third ed., Academic Press, New York, 1965 · Zbl 0918.65002
[7] Fox, L.; Parker, I. B., Chebyshev Polynomials in Numerical Analysis (1968), Oxford University Press: Oxford University Press Oxford · Zbl 0153.17502
[8] Gautschi, W., Norm estimates for inverses of Vandermonde matrices, Numer. Math., 23, 337-347 (1974) · Zbl 0304.65031
[9] Gautschi, W.; Inglese, G., Lower bounds for the condition number of Vandermonde matrices, Numer. Math., 52, 241-250 (1998) · Zbl 0646.15003
[10] E.E. Tyrtyshnikov, How bad are Hankel matrices? Numer. math. 67 (1994) 337-347; E.E. Tyrtyshnikov, How bad are Hankel matrices? Numer. math. 67 (1994) 337-347
[11] Gautschi, W., The condition of Vandermonde-like matrices involving orthogonal polynomials, Linear Algebra Appl., 52/53, 293-300 (1983) · Zbl 0522.33005
[12] G.H. Golub, C.F. VanLoan, Matrix Computation, second ed. The Johns Hopkins University Press, Baltimore, MD, 1989; G.H. Golub, C.F. VanLoan, Matrix Computation, second ed. The Johns Hopkins University Press, Baltimore, MD, 1989 · Zbl 0733.65016
[13] The MathWorks, Inc. MATLAB Reference Guide, 1994; The MathWorks, Inc. MATLAB Reference Guide, 1994
[14] S. Wolfram, Mathematica: a System for Doing Mathematics by Computers, second ed., Addison-Wesley, Reading MA 1991; S. Wolfram, Mathematica: a System for Doing Mathematics by Computers, second ed., Addison-Wesley, Reading MA 1991 · Zbl 0817.68039
[15] S.D. Conte, C. de Boor, Elementary Numerical Analysis, second ed., McGraw-Hill, New York 1972; S.D. Conte, C. de Boor, Elementary Numerical Analysis, second ed., McGraw-Hill, New York 1972 · Zbl 0257.65002
[16] Forsythe, G. E., Generation and use of orthogonal polynomials for data-fitting with a digital computer, J. SIAM, 5, 1050-1068 (1957) · Zbl 0168.03005
[17] A.A. Bijörk, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, PA, 1996; A.A. Bijörk, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, PA, 1996 · Zbl 0847.65023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.