You are here: MIMS > EPrints
MIMS EPrints

2006.173: Stability analysis of algorithms for solving confluent Vandermonde-like systems

2006.173: Nicholas J. Higham (1990) Stability analysis of algorithms for solving confluent Vandermonde-like systems. SIAM Journal On Matrix Analysis And Applications, 11 (1). pp. 23-41. ISSN 1095-7162

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1844 Kb

Official URL:


A confluent Vandermonde-like matrix $P(\alpha _0 ,\alpha _1 , \cdots ,\alpha _n )$ is a generalisation of the confluent Vandermonde matrix in which the monomials are replaced by arbitrary polynomials. For the case where the polynomials satisfy a three-term recurrence relation algorithms for solving the systems $Px = b$ and $P^T a = f$ in $O(n^2 )$ operations are derived. Forward and backward error analyses that provide bounds for the relative error and the residual of the computed solution are given. The bounds reveal a rich variety of problem-dependent phenomena, including both good and bad stability properties and the possibility of Xextremely accurate solutions. To combat potential instability, a method is derived for computing a “stable” ordering of the points $\alpha _i $; it mimics the interchanges performed by Gaussian elimination with partial pivoting, using only $O(n^2)$ operations. The results of extensive numerical tests are summarised, and recommendations are given for how to use the fast algorithms to solve Vandermonde-like systems in a stable manner.

Item Type:Article
Uncontrolled Keywords:Vandermonde matrix, orthogonal polynomials, Hermite interpolation, Clenshaw recurrence, forward error analysis, backward error analysis, stability, iterative refinement
Subjects:MSC 2000 > 15 Linear and multilinear algebra; matrix theory
MSC 2000 > 65 Numerical analysis
MIMS number:2006.173
Deposited By:Miss Louise Stait
Deposited On:04 July 2006

Download Statistics: last 4 weeks
Repository Staff Only: edit this item