Vandermonde systems on equidistant nodes in [0,1]: accurate computation
From MaRDI portal
Publication:2489396
Arguments from integer number theory are utilized to determine an explicit factorization for the entries of the inverse of a Vandermonde matrix with equidistant nodes. Some recursions for the practical implementation of the proposed formula are given. The authors also give formulas for the Frobenius norms of the matrix and its inverse. Simple asymptotic estimates of these norms are given. Results of numerical experiments showing an accurate representation of the floating point number system are reported.
Recommendations
Cites work
- A property of the elementary symmetric functions
- Accurate floating-point summation: a new approach
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- How bad are Hankel matrices?
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 638126 (Why is no real title available?)
- scientific article; zbMATH DE number 1083107 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Lower bounds for the condition number of Vandermonde matrices
- Solution of Vandermonde systems of equations
- Vandermonde matrices on integer nodes
Cited in
(10)- The accurate inversion of Vandermonde matrices
- Accurate floating-point summation: a new approach
- On the inversion of the Vandermonde matrix
- Vandermonde systems on Gauss-Lobatto Chebyshev nodes
- Factorization of Vandermonde matrices and the Newton formula
- Exact solution of 3D Timoshenko beam problem using linked interpolation of arbitrary order
- scientific article; zbMATH DE number 741145 (Why is no real title available?)
- The largest entry in the inverse of a Vandermonde matrix
- Approximation error of the Lagrange reconstructing polynomial
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
This page was built for publication: Vandermonde systems on equidistant nodes in \([0,1]\): accurate computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489396)