Efficient solution of the complex quadratic tridiagonal system for \(C^2\) PH quintic splines (Q5948207): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user 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.1023/a:1016621116240 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1620838353 / rank | |||
Normal rank |
Latest revision as of 10:46, 30 July 2024
scientific article; zbMATH DE number 1667963
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient solution of the complex quadratic tridiagonal system for \(C^2\) PH quintic splines |
scientific article; zbMATH DE number 1667963 |
Statements
Efficient solution of the complex quadratic tridiagonal system for \(C^2\) PH quintic splines (English)
0 references
31 October 2001
0 references
The problem at hand is the construction of \(C^2\) Pythagorean-hodograph (PH) quintic spline curves that interpolate a sequence of \(N+1\) points and satisfy prescribed end conditions. This leads to a tridiagonal system of \(N\) quadratic equations in \(N\) complex unknowns. Earlier approaches use a numerical continuation method to compute all \(2^{N+k}\) solutions \((-1\leq k\leq 1)\). Among this multitude of solutions there is a unique good PH spline that is free of undesired loops and extreme curvature variations. The present authors describe a more efficient method which take as a starting point ordinary \(C^2\) cubic splines; the equations for the PH curve are then solved by a Newton-Raphson iteration. The system Jacobian is tridiagonal and satisfies a global Lipschitz condition, yielding a closed-form expression of the Kantorovich condition for convergence of the iterations. Also, because of the structure of the Jacobian the iterations can be performed at \(O(n^2)\) cost. The paper contains extensive numerical tests.
0 references
Pythagorean-hodograph quintic spline curves
0 references
tridiagonal system of quadratic equations
0 references
continuation method
0 references
Newton-Raphson iteration
0 references
convergence
0 references
numerical tests
0 references