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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.02.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089007131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Vandermonde systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate floating-point summation: a new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vandermonde matrices on integer nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of the elementary symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the condition number of Vandermonde matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad are Hankel matrices? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305272 / rank
 
Normal rank

Latest revision as of 13:18, 24 June 2024

scientific article
Language Label Description Also known as
English
Vandermonde systems on equidistant nodes in \([0,1]\): accurate computation
scientific article

    Statements

    Vandermonde systems on equidistant nodes in \([0,1]\): accurate computation (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    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.
    0 references
    0 references
    Vandermonde matrices
    0 references
    polynomial interpolation
    0 references
    conditioning
    0 references
    inverse
    0 references
    equidistant nodes
    0 references
    Frobenius norms
    0 references
    numerical experiments
    0 references
    floating point number system
    0 references
    0 references
    0 references
    0 references
    0 references