A simple unified method for the realization of generalized splines by using the matrix sweep algorithm (Q1921808)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1921808 |
scientific article; zbMATH DE number 923528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple unified method for the realization of generalized splines by using the matrix sweep algorithm |
scientific article; zbMATH DE number 923528 |
Statements
A simple unified method for the realization of generalized splines by using the matrix sweep algorithm (English)
0 references
20 July 1997
0 references
Let \(L\) be a differential operator \[ L\equiv{d^n\over dx^n}+a_{n-1}{d^{n-1}\over dx^{n-1}}+\cdots+a_1{d\over dx}+a_0, \] where \(a_0\), \(a_1,\dots,a_{n-1}\) are constants. Let \(L^*\) be the conjugate operator to the operator \(L\). Let \(a=x_0<x_1<\cdots<x_N=b\) be the set of knots and let \(f_k\), \(k=0,1,\dots,N\), be a set of real numbers. The author proposes a method for the construction of a generalized spline \(S(x)\in C^{2(n-1)}[a,b]\) of order \(2n-1\), which satisfies the following conditions: 1) \(S(x_k)=f_k\), \(k=0,1,\dots,N\); 2) on each segment \([x_k,x_{k+1}]\), \(k=0,1,\dots,N-1\), the basis function of the spline \(S(x)\) is the solution of the differential equation \(L^*LS=0\). The author offers a special algorithm for the construction of the spline and investigates its stability.
0 references
matrix sweep algorithm
0 references
differential operator
0 references
generalized spline
0 references
algorithm
0 references
stability
0 references
0.7797600626945496
0 references
0.7722324728965759
0 references
0.7715979814529419
0 references
0.7705408334732056
0 references