Vandermonde systems on equidistant nodes in \([0,1]\): accurate computation

DOI10.1016/j.amc.2005.02.020zbMath1089.65022MaRDI QIDQ2489396

Alfredo Eisinberg, Giuseppe Fedele, C. Imbrogno

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.02.020

zbMATH Keywords

numerical experiments; conditioning; inverse; equidistant nodes; polynomial interpolation; Vandermonde matrices; Frobenius norms; floating point number system

Mathematics Subject Classification ID

65D05: Numerical interpolation

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Exact solution of 3D Timoshenko beam problem using linked interpolation of arbitrary order, Approximation error of the Lagrange reconstructing polynomial, Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization, Accurate floating-point summation: a new approach, On the inversion of the Vandermonde matrix

Uses Software

• Mathematica
• Matlab
• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
• Lower bounds for the condition number of Vandermonde matrices
• Vandermonde matrices on integer nodes
• How bad are Hankel matrices?
• Accurate floating-point summation: a new approach
• A property of the elementary symmetric functions
• Solution of Vandermonde systems of equations