Vandermonde systems on equidistant nodes in \([0,1]\): accurate computation
From MaRDI portal
Publication:2489396
DOI10.1016/j.amc.2005.02.020zbMath1089.65022OpenAlexW2089007131MaRDI QIDQ2489396
C. Imbrogno, Giuseppe Fedele, Alfredo Eisinberg
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
numerical experimentsconditioninginverseequidistant nodespolynomial interpolationVandermonde matricesFrobenius normsfloating point number system
Numerical interpolation (65D05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Accurate floating-point summation: a new approach, Exact solution of 3D Timoshenko beam problem using linked interpolation of arbitrary order, Approximation error of the Lagrange reconstructing polynomial, On the inversion of the Vandermonde matrix, Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
