initial.sp(X,S,off,expensive=FALSE,XX=FALSE)
S[[i]]
is the ith penalty matrix, but note
that it is not stored as a full matrix, but rather as the smallest square matrix including all
the non-zero elements of the penalty matrix. Element 1,1 of S[[i]]
occupies
element off[i]
, off[i]
of the ith penalty matrix. Each S[[i]]
must be
positive semi-definite. S[[i]]
.TRUE
then the overall amount of smoothing is
adjusted so that the average degrees of freedom per penalized parameter is
exactly 0.5: this is numerically costly. TRUE
then X
contains $X'X$, rather than $X$.magic
,
gam.outer
,
gam
,