Lower bounds for separable approximations of the Hilbert kernel
From MaRDI portal
Recommendations
- Lower bounds for kernelization
- Lower bounds on kernelization
- Lower bounds for kernelizations and other preprocessing procedures
- Lower bounds for kernelizations and other preprocessing procedures
- A universal lower bound for the kernel estimate
- scientific article; zbMATH DE number 1986050
- Probability error bounds for approximation of functions in reproducing kernel Hilbert spaces
- scientific article; zbMATH DE number 884957
- \(n\)-best kernel approximation in reproducing kernel Hilbert spaces
- On approximation by spherical reproducing kernel Hilbert spaces
Cited in
(12)- Constructive representation of functions in low-rank tensor formats
- The integral operator with logarithmic kernel has only one positive eigenvalue
- Rational Krylov for Stieltjes matrix functions: convergence and pole selection
- A reduced basis method for fractional diffusion operators. I
- On rational Krylov and reduced basis methods for fractional diffusion
- Analysis of the rational Krylov subspace projection method for large-scale algebraic Riccati equations
- Adaptive model order reduction for the Jacobian calculation in inverse multi-frequency problem for Maxwell's equations
- On convergence of Krylov subspace approximations of time-invariant self-adjoint dynamical systems
- Lower bounds on kernelization
- On the singular values of matrices with displacement structure
- Bounds on the singular values of matrices with displacement structure
- Compression properties for large Toeplitz-like matrices
This page was built for publication: Lower bounds for separable approximations of the Hilbert kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508630)
