High order approximation of rational curves by polynomial curves (Q2432790): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cagd.2006.06.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2083162626 / rank | |||
Normal rank |
Revision as of 20:29, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | High order approximation of rational curves by polynomial curves |
scientific article |
Statements
High order approximation of rational curves by polynomial curves (English)
0 references
25 October 2006
0 references
The author shows the existence of polynomial curves which have \(n\) points of geometric contact with a given \(\mathbb R^d\)-valued rational curve \(f(t)=f(t)/g(t)\): For parameters \(t_1<t_2<\cdots<t_n\) and scalars \(\mu_1,\ldots,\mu_n\) there exists an \(\mathbb R^d\)-valued polynomial \(p\) with \(\deg(p)\leq n+\deg(f)+\deg(g)-2\) such that \(p(t_i)=r(t_i)\) and \(p'(t_i)=\mu_i r'(t_i)\), provided \(g\) has no real roots in \([t_0,t_n]\) and no double roots at all. The result extends to interpolating higher derivatives by letting parameters coalesce. These polynomials of degree \(\approx n\) as \(n\) is growing, are shown to have an approximation order of \((t_n-t_1)^{2n}\); they are computable via the Euclidean algorithm. For instance, applying the construction to \(r(t)={1\over 1+t^2}{2\choose 2t}\) leads to Hermite interpolants of a circle which have polynomial degree \(n+1\) and approximation order \(2n\). For special choices of parameters and \(n=2,3\) one retrieves previously known Hermite interpolants of circular arcs.
0 references
rational curves
0 references
polynomial interpolation
0 references
high order approximation
0 references
Euclid's algorithm
0 references
polynomial curves
0 references