similar to: mgcv gam predict problem

Hi, I am trying to find an elegant way to compute and store some frequently used matrices "on demand". The Matrix package already uses something like this for storing decompositions, but I don't know how to do it. The actual context is the following: A list has information about a basis of a B-spline space (nodes, order) and gridpoints at which the basis functions would be

Hello, I've noticed that SPLUS seems to have a function for evaluating derivative matrices of splines. I've found the R function that evaluates matrices from 'smooth.spline'; maybe someone has written something to do the same with smooth.basis? regards, s

I generally run 'make; make check' (with more settings) when building the Debian package. Running 3.2.4 rc from last night, I see a lot of package loading issues during 'make check'. Here is splines as one examples: checking package 'splines' * using log directory '/build/r-base-3.2.3.20160303/tests/splines.Rcheck' * using R version 3.2.4 RC (2016-03-02 r70270) *

--- On Mon, 3/12/12, aleksandr shfets <a_shfets at mail.ru> wrote: > From: aleksandr shfets <a_shfets at mail.ru> > Subject: Fwd: Re[2]: [R] B-spline/smooth.basis derivative matrices > To: "Vassily Shvets" <shv736 at yahoo.com> > Received: Monday, March 12, 2012, 5:15 PM > > > > -------- ???????????? ????????? > -------- > ?? ????:

On 08/02/2012 05:00 AM, r-devel-request at r-project.org wrote: > Now I just have to grovel over the R code in ns() and bs() to figure > out how exactly they pick knots and handle boundary conditions, plus > there is some code that I don't understand in ns() that uses qr() to > postprocess the output from spline.des. I assume this is involved > somehow in imposing the boundary

Dear all, I need to compute tensor product of B-spline defined over equi-spaced break-points. I wrote my own program (it works in a 2-dimensional setting) library(splines) # set the break-points Knots = seq(-1,1,length=10) # number of splines M = (length(Knots)-4)^2 # short cut to splineDesign function bspline = function(x) splineDesign(Knots,x,outer.ok = T) # bivariate tensor product of

Hi, I would like to fit an (interpolating) spline to data where the derivatives at the endpoints of the interval are nonzero, thus the natural spline endpoint-specification does not make sense. Books (de Boor, etc) suggest that in this case I use not-a-knot splines. I know what not-a-knot splines are (so if I were solving for the coefficients directly I knew how to do this), but I don't

Dear R developers, The trace of the hat matrix H~(n,n) is computed as follows: tr(H) = tr(BS^-1B') = tr(S^-1B'B) := tr(X) = sum(diag(X)) with B~(n,p), S~(p,p). Since p is of the order 10^3 but S is sparse I would like to employ Taucs linear solver ( http://www.tau.ac.il/~stoledo/taucs/ ) on SX = B'B. (Further improvement by implying a looping over i=1,...,p, calling

Dear all, I hope the following problem haven't been discussed here recently (I could not find anything about it the help archive files) : I tried to compile R-0.64.2 from the source files without much success... the last lines from the output of the ./configure command were : ---------------------------------------------------------- R is now configured for mips-sgi-irix6.4 Source

Dear List, I'm using GAMs in a multiple imputation project, and I want to be able to combine the parameter estimates and covariance matrices from each completed dataset's fitted model in the end. In order to do this, I need the knots to be uniform for each model with partially-imputed data. I want to specify these knots based on the quantiles of the unique values of the non-missing

Hi, there, I have 5 datasets. I would like to choose a basis spline with same knots in GAM function in order to obtain same basis function for 5 datasets. Moreover, the basis spline is used to for an interaction of two covarites. I used "cr" in one covariate, but it can only smooth w.r.t 1 covariate. Can anyone give me some suggestion about how to choose a proper smoothing spline

I would like to fit a logistic regression using a smothing spline, where the spline is a piecewise cubic polynomial. Is the knots option used to define the subintervals for each piece of the cubic spline? If yes and there are k knots, then why does the coefficients field in the returned object from gam only list k coefficients? Shouldn't there be 4k -4 coefficients? Sincerely, Bill

Dear List, I'm using gam in a multiple imputation framework -- specifying the knot locations, and saving the results of multiple models, each of which is fit with slightly different data (because some of it is predicted when missing). In MI, coefficients from multiple models are averaged, as are variance-covariance matrices. VCV's get an additional correction to account for how

Hello everyone,          Dr. wood told me that I can adapting his example to force cubic spline to pass through certain point.          I still have no idea how to achieve this. Suppose we want to force the cubic spline to pass (1,1), how can I achieve this by adapting the following code? # Penalized example: monotonic penalized regression spline ..... # Generate data from a monotonic truth.

Hi again, Beside R_ParseVector()'s possible inconsistent behavior, R's handling of zero-length named elements does not seem consistent either: ``` > lst <- list() > lst[[""]] <- 1 > names(lst) [1] "" > list("" = 1) Error: attempt to use zero-length variable name ``` Should the parser be made to accept as valid what is otherwise possible

During some recent testing of winbindd (3.0.22) in a multi-domain, multi-DC AD context, the AD expert I was working with was very interested in winbindd's choice of domain controller (it apparently was not choosing the one(s) AD-expert expected). I understand that Windows domain members have an algorithm based on DNS SRV records and IP address comparison, and I've seen some code posted in

I have a situation like below: Samba servers in many cities; one "backup" server in the central location that fetches user profiles each night (changes really with rsync). Users work in many locations; sometimes one user can work in city A, and a day later he can work in city B. This means that they have problems with their profiles - user profile for city A will be different from

Hi, I'm currently using the nbfw (netbios forwarder - http://nbfw.sourceforge.net/) patch with samba on a linux masquerading firewall/router. It works pretty well. I was wondering if there was plan to include this patch in samba (or TNG) I was also wondering if there was any way to use this as a mean to do cross-subnet browsing efficient. The paradox is that browsing works better between a

We submitted bug 3342 on Dec. 20th, Too many open files. It has not moved from the new state. So lets try here. We have Dell Quad Xeon server that we end up rebooting about every 2-3 weeks when the number of open samba files sky rockets. The system is a ClearCase server system. We have been monitoring this system for a few months now and are not able to pin down a cause to this issue. The system

I am working on a Linux-AD integration using winbindd in security=ads mode with idmap=ad. Everything is basically working, but the performance of user (and group) enumeration has been very poor and I am almost at the stage where I ask my users if they can live without it, though I would prefer not to. In my test environment, I have about 8500 users in AD, of which currently only about 10 have