Approximation of high-dimensional kernel matrices by multilevel circulant matrices
From MaRDI portal
Publication:990819
DOI10.1016/j.jco.2010.02.003zbMath1197.65045OpenAlexW2010916095MaRDI QIDQ990819
Publication date: 1 September 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.02.003
convergencefast Fourier transformcirculant matriceskernel matricesfast discrete algorithmsfast kernel-based methodsmultilevel circulant matrices
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Generalized Mercer Kernels and Reproducing Kernel Banach Spaces ⋮ On the minimal polynomials and the inverses of multilevel scaled factor circulant matrices ⋮ Reproducing Kernel Banach Spaces with the ℓ1 Norm II: Error Analysis for Regularized Least Square Regression
Cites Work
- Propriétés des matrices ``bien localisées près de leur diagonale et quelques applications. (Properties of matrices ``well localized near the diagonal and some applications)
- Approximation theory in tensor product spaces
- The optimal recovery of smooth functions
- A practical guide to splines
- On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
- A unifying approach to some old and new theorems on distribution and clustering
- Regularization networks and support vector machines
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Lectures on Fourier Integrals. (AM-42)
- Kernel techniques: From machine learning to meshless methods
- Theory of Reproducing Kernels
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation of high-dimensional kernel matrices by multilevel circulant matrices