On Generalized Weighted Hilbert Matrices

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

We prove trace inequalities for a self-adjoint operator on an abstract Hilbert space, which extend those known previously for Laplacians and Schrodinger operators, freeing them from restrictive assumptions on the nature of the spectrum and allowing operato ...

The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic window of varying siz ...

In this thesis we address the computation of a spectral decomposition for symmetric banded matrices. In light of dealing with large-scale matrices, where classical dense linear algebra routines are not applicable, it is essential to design alternative tech ...

We showthat any k-th closed sphere-of-influence graph in a d-dimensional normed space has a vertex of degree less than 5dk, thus obtaining a common generalization of results of Furedi and Loeb (Proc AmMath Soc 121(4): 1063-1073, 1994 [1]) and Guibas et al. ...

The functional linear model extends the notion of linear regression to the case where the response and covariates are iid elements of an infinite-dimensional Hilbert space. The unknown to be estimated is a Hilbert-Schmidt operator, whose inverse is by defi ...

We consider integer programming problems max {c^Tx : A x = b, l

In this paper, we consider the problem of sequentially optimizing a black-box function

f

based on noisy samples and bandit feedback. We assume that

f

is smooth in the sense of having a bounded norm in some reproducing kernel Hilbert space (RKHS), yield ...

We investigate the combination of Isogeometric Analysis (IGA) and proper orthogonal decomposition (POD) based on the Galerkin method for model order reduction of linear parabolic partial differential equations. For the proposed fully discrete scheme, the a ...

On Generalized Weighted Hilbert Matrices

Chat with Graph Search

Universal Bounds And Semiclassical Estimates For Eigenvalues Of Abstract Schrodinger Operators

Fast Space-Variant Elliptical Filtering Using Box Splines

Fast hierarchical solvers for symmetric eigenvalue problems

Sphere-of-Influence Graphs in Normed Spaces

Methodology And Convergence Rates For Functional Time Series Regression

Faster Algorithms for Integer Programs with Block Structure

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Isogeometric analysis and proper orthogonal decomposition for parabolic problems