Error estimates for modified local Shepard's interpolation formula (Q598485): 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.apnum.2003.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052896628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(hp\)-meshless cloud method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of Convergence of Shepard's Global Interpolation Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Differentiation and the Solution of Multidimensional Vandermonde Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error analysis of the reproducing kernel particle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate interpolation of large sets of scattered data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4112362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good quality point sets and error estimates for moving least square approximations. / rank
 
Normal rank

Latest revision as of 18:17, 6 June 2024

scientific article
Language Label Description Also known as
English
Error estimates for modified local Shepard's interpolation formula
scientific article

    Statements

    Error estimates for modified local Shepard's interpolation formula (English)
    0 references
    0 references
    6 August 2004
    0 references
    The author constructs a modified local Shepard's interpolation formula. The interpolation operators use approximate Taylor polynomials, which are obtained by least squares fit of polynomials to function values at nearby nodes. This way, the spots of spots of Shepard's functions is eliminated. The quality of the normal equations used to obtain approximating derivatives is measured by a condition number, which is computable. It is shown that the error estimates of the approximation depend crucially on the above condition number. Similar results have been obtained in the content of least square approximation [cf. \textit{C. Zuppa}, Bull. Braz. Math. Soc. 34, 231--249 (2003; Zbl 1056.41007)].
    0 references
    0 references
    convergence
    0 references
    modified local Shepard's interpolation formula
    0 references
    least squares fit
    0 references
    normal equations
    0 references
    condition number
    0 references
    error estimates
    0 references
    multivariate interpolation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references