Description Usage Arguments Details Value Author(s) See Also
The model at a point z=(z_1,...,z_d) is fitted using n sample points x_1, ..., x_n
s(z) = λ_1*Φ(||z-x_1||)+... +λ_n*Φ(||z-x_n||) + c_0 + c_1*z_1 + ... + c_d*z_d
where Φ(r)=r^3 denotes the cubic radial basis function. The coefficients λ_1,
..., λ_n, c_0, c_1, ..., c_d are determined by this training procedure.
This is for the default case squares==FALSE
. In case squares==TRUE
there are d additional pure square terms and the model is
s_{sq}(z) = s(z) + c_{d+1}*z_1^2 + ... + c_{d+d}*z_d^2
In case ptail==FALSE
the polynomial tail (all coefficients c_i) is omitted completely.
1 2 3 4 5 6 7 8 9 |
xp |
n points x_i of dimension d are arranged in (n x d) matrix |
U |
vector of length n, containing samples f(x_i) of
the scalar function f to be fitted |
ptail |
[TRUE] flag, see description |
squares |
[FALSE] flag, see description |
rho |
[0.0] experimental: 0: interpolating, >0, approximating (spline-like) Gaussian RBFs |
DEBUG2 |
[FALSE] if TRUE, save |
width |
[NA] non relevant for the parameter-free cubic RBF |
The linear equation system is solved via SVD inversion. Near-zero elements in the diagonal matrix D are set to zero in D^{-1}. This is numerically stable for rank-deficient systems.
rbf.model
, an object of class RBFinter
, which is basically a list
with elements:
coef |
(n+d+1 x m) matrix holding in column m the coefficients for the m'th
model: λ_1, ..., λ_n, c_0, c_1, ..., c_d.
In case |
xp |
matrix xp |
d |
size of the polynomial tail. If |
npts |
number n of points x_i |
ptail |
TRUE or FALSE (see description) |
squares |
TRUE or FALSE (see description) |
type |
"CUBIC" |
width |
NA, irrelevant for the parameter-free cubic RBF |
Wolfgang Konen (wolfgang.konen@th-koeln.de), Samineh Bagheri (samineh.bagheri@th-koeln.de)
trainGaussRBF
, trainMQRBF
predict.RBFinter
, interpRBF
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.