Related papers: Estimates for generalized sparse grid hierarchical…
In this article, we define discrete analogue of generalized Hardy spaces and its separable subspace on a homogenous rooted tree and study some of its properties such as completeness, inclusion relations with other spaces, separability,…
This work develops optimal preconditioners for the discrete H(curl) and H(div) problems on two-dimensional surfaces by nodal auxiliary space preconditioning [R. Hiptmair, J. Xu: SIAM J. Numer. Anal. \textbf{45}, 2483-2509 (2007)]. In…
In many regression settings the unknown coefficients may have some known structure, for instance they may be ordered in space or correspond to a vectorized matrix or tensor. At the same time, the unknown coefficients may be sparse, with…
Recently there has been much interest in "sparsifying" sums of rank one matrices: modifying the coefficients such that only a few are nonzero, while approximately preserving the matrix that results from the sum. Results of this sort have…
We consider high-dimensional multiclass classification by sparse multinomial logistic regression. Unlike binary classification, in the multiclass setup one can think about an entire spectrum of possible notions of sparsity associated with…
Let (X,d) be a finite metric space. This paper first discusses the spectrum of the p-distance matrix of a finite metric space of p-negative type and then gives upper and lower bounds for the so called gap of a finite metric space of strict…
Sparse linear system solvers are computationally expensive kernels that lie at the heart of numerous applications. This paper proposes a flexible preconditioning framework to substantially reduce the time and energy requirements of this…
This paper introduces the localized sparsifying preconditioner for the pseudospectral approximations of indefinite systems on periodic structures. The work is built on top of the recently proposed sparsifying preconditioner with two major…
We obtain the local well-posedness of the one dimensional cubic nonlinear Schr\"odinger Equation for initial data in the modulation space $M_{2, p}$ for all $2\le p<\infty$, which covers all the subcritical cases from the viewpoint of…
Generalized spectra of differential operators can be related to spectra of preconditioned discretized operators. Obtaining (estimates of) the eigenvalues of the preconditioned discretized operators may lead to better estimating of the…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
Consider the discrete cubic Hilbert transform defined on finitely supported functions $f$ on $\mathbb{Z}$ by \begin{eqnarray*} H_3f(n) = \sum_{m \not = 0} \frac{f(n- m^3)}{m}. \end{eqnarray*} We prove that there exists $r <2$ and universal…
Randomized methods are becoming increasingly popular in numerical linear algebra. However, few attempts have been made to use them in developing preconditioners. Our interest lies in solving large-scale sparse symmetric positive definite…
The paper concerns foundations of sensitivity and stability analysis in optimization and related areas, being primarily addressed truncated constrained systems. We consider general models, which are described by multifunctions between…
Radial basis functions have become a popular tool for approximation and solution of partial differential equations (PDEs). The recently proposed multilevel sparse interpolation with kernels (MuSIK) algorithm proposed in \cite{Georgoulis}…
We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with…
We abstract and study \emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G = (V, E)$ and a set of \emph{demand pairs} $P \subseteq V \times V$, a…
This is the first of two papers to describe a matrix sparsification algorithm that takes a general real or complex matrix as input and produces a sparse output matrix of the same size. The non-zero entries in the output are chosen to…
This work provides a unified formalism for studying difference and (Hasse-) differential algebraic geometry, by introducing a theory of "iterative Hasse rings and schemes". As an application, Hasse jet spaces are constructed generally,…
We provide sparse estimates for gradients of solutions to divergence form elliptic partial differential equations in terms of the source data. We give a general result of Meyers (or Gehring) type, a result for linear equations with VMO…