Vandermonde systems on equidistant nodes in [0,1]: accurate computation
From MaRDI portal
Publication:2489396
Recommendations
Cites work
- 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?)
- 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?
- Lower bounds for the condition number of Vandermonde matrices
- Solution of Vandermonde systems of equations
- Vandermonde matrices on integer nodes
Cited in
(9)- The largest entry in the inverse of a Vandermonde matrix
- Factorization of Vandermonde matrices and the Newton formula
- Accurate floating-point summation: a new approach
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
- Exact solution of 3D Timoshenko beam problem using linked interpolation of arbitrary order
- Approximation error of the Lagrange reconstructing polynomial
- Vandermonde systems on Gauss-Lobatto Chebyshev nodes
- On the inversion of the Vandermonde matrix
- The accurate inversion of Vandermonde matrices
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)