Vandermonde matrices on Chebyshev points

Linear Algebra and Its Applications

Volumn 283, Issue 1-3, 1998, Pages 205-219

  Eisinberg, A ^a   Franze G ^a   Pugliese, P ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Conditioning; Polynomial interpolation; Vandermonde matrices

Indexed keywords

EID: 0039529246     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(98)10092-7     Document Type: Article

References (23)

1. n(x) de degré n sur tout un segment par ses valeurs en (n + 1) points du segment, Izv. Akad. Nauk SSSR 8 (1931) 1025-1050.
2. A. Björck, G. Dahlquist, Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1974.
3. A. Björck, V. Pereyra, Solution of Vandermonde systems of equations, Math. Comp. 24 (1970) 893-903.
4. P.J. Davis, Interpolation and Approximation, Dover, New York, 1975.
5. H. Ehlich, K. Zeller, Auswertung der normen von interpolationsoperatoren, Math. Ann. 164 (1966) 105-112.
6. G. Heinig, K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators, Birkhäuser, Basel, 1984.
7. A. Eisinberg, C. Picardi, On the inversion of Vandermonde matrix, in: Proceedings of the Eighth IFAC World Congress, Kyoto, Japan, 1981.
8. L. Fox, I.B. Parker, Chebyshev Polynomials in Numerical Analysis, Oxford Univ. Press, Oxford, 1968.
9. W. Gautschi, Norm estimates for inverses of Vandermonde matrices, Numer. Math. 23 (1974) 337-347.
10. W. Gautschi, The condition of Vandermonde-like matrices involving orthogonal polynomials. Linear Algebra Appl. 52/53 (1983) 293-300.
11. W. Gautschi, G. Inglese, Lower bounds for the condition number of Vandermonde matrices, Numer. Math. 52 (1988) 241-250.
12. G.H. Golub, C.F. Van Loan, Matrix Computation, second ed., Johns Hopkins Univ. Press, Baltimore, MD, 1989.
13. I.S. Gradshteyn, I.M. Ryzhik, Table of integrals, Series and Products, third ed., Academic Press, New York, 1965.
14. N.J. Higham, Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems, Numer. Math. 50 (1987) 613-632.
15. N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
16. T.A. Kilgore, A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm, J. Approx. Theory 24 (1978) 273-288.
17. D.E. Knuth, The Art of Computer Programming, vol. 1, second ed., Addison-Wesley, Reading, MA, 1973.
18. F.W. Luttmann, T.J. Rivlin, Some numerical experiments in the theory of polynomial interpolation, IBM J. Res. Dev. 9 (1965) 187-191.
19. MATLAB Reference Guide, The MathWorks, Inc., Natick, MA, 1994.
20. M.J.D. Powell, On the maximum errors of polynomial approximation defined by interpolation and by least squares criteria. Computer J. 9 (1968) 404-407.
21. J.F. Traub, Associated polynomials and uniform methods for the solution of linear problems, SIAM Rev. 8 (1966) 277-301.
22. E.E. Tyrtyshnikov, How bad are Hankel matrices?, Numer. Math. 67 (1994) 261-269.
23. S. Wolfram, Mathematica: A System for Doing Mathematics by Computers, second ed., Addison-Wesley, Reading, MA, 1991.