Fetching the paper…
Reading the bibliography…
Large kernel systems are prone to be ill-conditioned.
LINPACK users’ guide
J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart · 1979
Earlier work this paper cites.
Error estimates and condition numbers for radial basis function interpolation
R. Schaback · 1995
Earlier work this paper cites.
Matrix Computations
G. H. Golub and C. F. V. Loan · 1996
Earlier work this paper cites.
A theory of pseudoskeleton approximations
S. A. Goreinov, E. E. Tyrtyshnikov, and N. L. Zamarashkin · 1997
Earlier work this paper cites.
Matrix Algebra From a Statistician’s Perspective
D. A. Harville · 1997
Earlier work this paper cites.
Solving ill-conditioned and singular linear systems: A tutorial on regularization
A. Neumaier · 1998
Earlier work this paper cites.
Native Hilbert Spaces for Radial Basis Functions I
R. Schaback · 1999
Earlier work this paper cites.
Approximation of boundary element matrices
M. Bebendorf · 2000
Earlier work this paper cites.
Sparse greedy matrix approximation for machine learning
A. J. Smola and B. Schökopf · 2000
Earlier work this paper cites.
Efficient SVM training using low-rank kernel representations
S. Fine and K. Scheinberg · 2001
Earlier work this paper cites.
The maximal-volume concept in approximation by low-rank matrices
S. A. Goreinov and E. E. Tyrtyshnikov · 2001
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
C. Williams and M. Seeger · 2001
Cited alongside, same era.
Kernel independent component analysis
F. R. Bach and M. I. Jordan · 2003
Cited alongside, same era.
Adaptive low-rank approximation of collocation matrices
M. Bebendorf and S. Rjasanow · 2003
Cited alongside, same era.
Hierarchical Matrices
S. Börm, L. Grasedyck, and W. Hackbusch · 2003
Cited alongside, same era.
Discrete Convex Analysis
K. Murota · 2003
Cited alongside, same era.
Predictive low-rank decomposition for kernel methods
F. R. Bach and M. I. Jordan · 2005
Cited alongside, same era.
On the Nyström method for approximating a Gram matrix for improved kernel-based learning
Application of hierarchical matrices for computing the Karhunen-Loève expansion
B. N. Khoromskij, A. Litvinenko, and H. G. Matthies · 2009
Later among the works it cites.
Fast revealing of mode ranks of tensor in canonical form
D. V. Savostyanov · 2009
Later among the works it cites.
The matrix reference manual, 2011
M. Brookes · 2011
Later among the works it cites.
Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
S. A. Goreinov and E. E. Tyrtyshnikov · 2011
Later among the works it cites.
Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
M. Espig, W. Hackbusch, A. Litvinenko, H. G. Matthies, and P. Wähnert · 2012
Later among the works it cites.
On the low-rank approximation by the pivoted Cholesky decomposition
H. Harbrecht, M. Peters, and R. Schneider · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Drineas and M. W. Mahoney · 2005
Cited alongside, same era.
Karhunen–Loève approximation of random fields by generalized fast multipole methods
C. Schwab and R. A. Todor · 2006
Cited alongside, same era.
Lapack-style codes for pivoted Cholesky and QR updating
S. Hammarling, N. J. Higham, and C. Lucas · 2007
Cited alongside, same era.
Numerical recipes: the art of scientific computing
W. H. Press et al · 2007
Cited alongside, same era.
Later among the works it cites.
Matrix analysis
R. A. Horn and C. R. Johnson · 2012
Later among the works it cites.
Sharp analysis of low-rank kernel matrix approximations
F. R. Bach · 2013
Later among the works it cites.
Sampling and low-rank tensor approximation of the response surface
A. Litvinenko, H. G. Matthies, and T. A. El-Moselhy · 2013
Later among the works it cites.
On spectral distribution of kernel matrices related to radial basis functions
A. J. Wathen and S. Zhu · 2015
Closest in time.