Intrinsic parametrization for approximation (Q1102698): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:42, 31 January 2024

scientific article
Language Label Description Also known as
English
Intrinsic parametrization for approximation
scientific article

    Statements

    Intrinsic parametrization for approximation (English)
    0 references
    0 references
    1988
    0 references
    Let \(P_ i\) \((i=1(1)n)\) be n given points. If this set of points is parametrized by a parameter \(t_ i\), the approximation curve \[ Y(t)=\sum^{n}_{i=0}b_ if_ i(t)\quad (t\in I,\quad I=[a,b])\quad (n+1<N) \] with prescribed basis functions \(f_ i\) is called optimal if the shortest distances between the points \(P_ i\) and the approximation curve Y(t) is minimized. An iterative Newton-like approach of intrinsic parametrization for the optimal approximation is proposed. The method is extended to optimal approximation surface of a given set of points \(P_{ik}\) parametrized by parameter values \((u_ i,v_ k)\).
    0 references
    curve approximation
    0 references
    Newton-like methods
    0 references
    approximation curve
    0 references
    intrinsic parametrization
    0 references
    optimal approximation surface
    0 references

    Identifiers