Continuous Cross Approximation of Matrices Arising Out of Kernel Functions
From MaRDI portal
Cites work
- A fast algorithm for particle simulations
- Adaptive low-rank approximation of collocation matrices
- An Extension of Chebfun to Two Dimensions
- Approximation of boundary element matrices
- Eigenvalues of Analytic Kernels
- Extreme learning machine: Theory and applications
- Fast Direct Methods for Gaussian Processes
- Fast Direct Solvers
- Fast Low-Rank Kernel Matrix Factorization through Skeletonized Interpolation
- Generalized Gaussian Quadratures and Singular Value Decompositions of Integral Operators
- Hierarchical adaptive low-rank format with applications to discretized PDEs
- Hierarchical interpolative factorization for elliptic operators: differential equations
- Improved error bound for multivariate Chebyshev polynomial interpolation
- Julia: a fresh approach to numerical computing
- Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
- Rank of Matrices Arising out of Singular Kernel Functions
- Real and complex analysis
- Support-vector networks
This page was built for publication: Continuous Cross Approximation of Matrices Arising Out of Kernel Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284115)