论文信息 - Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials

Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials

On propose des algorithmes rapides de resolution des systemes primal et dual Px=b et P T a=f ou P est une matrice du type de Vandermonde dont les elements polynomiaux satisfont a une relation de recurrence a trois termes. On etudie la stabilite des algorithmes

Nicholas J. Higham | N. Higham

[1] Walter Gautschi,et al. The condition of Vandermonde-like matrices involving orthogonal polynomials☆ , 1983 .

[2] W. Squire,et al. Solving Nonlinear Vandermonde Systems , 1975, Comput. J..

[3] J. N. Lyness,et al. Van der Monde systems and numerical differentiation , 1966 .

[4] V. Pereyra,et al. On the construction of discrete approximations to linear differential expressions. , 1967 .

[5] Discrete Chebyshev Approximation by Interpolating Rationals , 1984 .

[6] H. Wozniakowski,et al. Iterative refinement implies numerical stability , 1977 .

[7] Charles B. Dunham,et al. Choice of Basis for Chebyshev Approximation , 1982, TOMS.

[8] Å. Björck,et al. Solution of Vandermonde Systems of Equations , 1970 .

[9] Nicholas J. Higham,et al. Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems , 1987 .

[10] G. Golub,et al. The block decomposition of a vandermonde matrix and its applications , 1981 .

[11] L. A. G. Dresel,et al. Elementary Numerical Analysis , 1966 .

[12] R. Skeel. Iterative refinement implies numerical stability for Gaussian elimination , 1980 .