2006
DOI: 10.1016/j.csda.2004.07.008
|View full text |Cite
|
Sign up to set email alerts
|

Fast and compact smoothing on large multidimensional grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
143
0
1

Year Published

2006
2006
2021
2021

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 174 publications
(159 citation statements)
references
References 4 publications
0
143
0
1
Order By: Relevance
“…The procedure consists of several different steps: first, the major principal components in the zero- Recently, with the increasing of the use of second-order data, several algorithms have been proposed. One of them is the methodology presented by Eilers, i.e., the asymmetric least-squares method [31], which was recently adapted to multidimensional data [32]. This method consists in the On the other hand, on-line coupling between LC and FT-IR becomes a difficult task: as the mobile phases employed in LC absorb strongly in the mid infrared, their accurate compensation is crucial to obtain characteristic analyte spectra.…”
Section: Background Correctionmentioning
confidence: 99%
“…The procedure consists of several different steps: first, the major principal components in the zero- Recently, with the increasing of the use of second-order data, several algorithms have been proposed. One of them is the methodology presented by Eilers, i.e., the asymmetric least-squares method [31], which was recently adapted to multidimensional data [32]. This method consists in the On the other hand, on-line coupling between LC and FT-IR becomes a difficult task: as the mobile phases employed in LC absorb strongly in the mid infrared, their accurate compensation is crucial to obtain characteristic analyte spectra.…”
Section: Background Correctionmentioning
confidence: 99%
“…We present the array algorithm in a nutshell here; for a more detailed account one should consult Currie et al (2006) or Eilers et al (2006). Assume that the T × A matrix Z = BAB is a model for the expected values of the matrix Y of the same size.…”
Section: Efficient Computation Using Array Regressionmentioning
confidence: 99%
“…The standard approach, using vectorization of the data table and Kronecker products for the tensor product basis, puts heavy demands on memory and computation time. Fortunately we can adapt the array regression algorithms Eilers et al 2006) to our case, gaining at least an order of magnitude if efficiency. Details are presented in Sect.…”
Section: Introductionmentioning
confidence: 99%
“…Then, in this new context, the full regression basis B is defined as the 'row-wise' Kronecker product (denoted by , Eilers et al, 2006) of the marginal B-spline bases B 1 = B(x 1 ) and B 2 = B(x 2 ) of dimensions m × c 1 and m × c 2 , respectively:…”
Section: The Spatial Clmmmentioning
confidence: 99%