Vandermonde systems on equidistant nodes in [0, 1]: accurate computation
نویسندگان
چکیده
This paper deals with Vandermonde matrices V whose nodes are the equidistant points in [0,1]. We give an analytic factorization and explicit formula for the entries of their inverse, and explore its computational issues. We also give asymptotic estimates of the Frobenius norm of both V and its inverse and show that a new representation of the floating point number system allows one to build an accurate algorithm for the interpolation problem on equidistant nodes in [0,1]. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Accurate computations with Said-Ball-Vandermonde matrices
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0, 1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows to use known algorithms for totally positive mat...
متن کاملVandermonde systems on Gauss-Lobatto Chebyshev nodes
This paper deals with Vandermonde matrices Vn whose nodes are the Gauss–Lobatto Chebyshev nodes, also called extrema Chebyshev nodes. We give an analytic factorization and explicit formula for the entries of their inverse, and explore its computational issues. We also give asymptotic estimates of the Frobenius norm of both Vn and its inverse and present an explicit formula for the determinant o...
متن کاملEla Accurate Computations with Totally Positive Bernstein–vandermonde Matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملAccurate computations with totally positive Bernstein-Vandermonde matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملVandermonde Matrices with Chebyshev Nodes
For n × n Vandermonde matrix Vn = (αi−1 j )1≤i j≤n with translated Chebyshev zero nodes, it is discovered that V T n admits an explicit QR decomposition with the R-factor consisting of the coefficients of the translated Chebyshev polynomials of degree less than n. This decomposition then leads to an exact expression for the condition number of its submatrix Vk,n = (αi−1 j )1≤i≤k,1≤j≤n (so-calle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 172 شماره
صفحات -
تاریخ انتشار 2006