相关论文: Localized polynomial frames on the ball
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
Local rings are ubiquitous in algebraic geometry. Not only are they naturally meaningful in a geometric sense, but also they are extremely useful as many problems can be attacked by first reducing to the local case and taking advantage of…
Multiple kernel learning (MKL), structured sparsity, and multi-task learning have recently received considerable attention. In this paper, we show how different MKL algorithms can be understood as applications of either regularization on…
Orthogonal polynomials for a family of weight functions on $[-1,1]^2$, $$ \CW_{\a,\b,\g}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} (1-x^2)^\g(1-y^2)^{\g}, $$ are studied and shown to be related to the Koornwinder polynomials defined on the region…
Let $\Lambda$ be a finite set of nonnegative integers, and let $\mathcal P(\Lambda)$ be the linear hull of the monomials $z^k$ with $k\in\Lambda$, viewed as a subspace of $L^1$ on the unit circle. We characterize the extreme and exposed…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
The purpose of this paper is to discuss representations of high order $C^0$ finite element spaces on simplicial meshes in any dimension. When computing with high order piecewise polynomials the conditioning of the basis is likely to be…
We consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure…
Inspired by how certain proteins "sense" knots and entanglements in DNA molecules, here we ask if there exist local geometric features that may be used as a read-out of the underlying topology of generic polymers. We perform molecular…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
In this paper we present characterizations of the sets of key polynomials and abstract key polynomials for a valuation $\mu$ of $K(x)$, in terms of (ultrametric) balls in the algebraic closure $\overline K$ of $K$ with respect to $v$, a…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
Many quantum systems admit an explicit analytic Fourier space expansion, besides the usual analytic Schrodinger configuration space representation. We argue that the use of weighted orthonormal polynomial expansions for the physical states…
We compute explicitly the Bergman kernels of all two dimensional monomial polyhedra, a class of domains including the Hartogs triangle and some of its generalizations. The kernel is computed from the representation of such domains as…
We derive necessary conditions for localization of continuous frames in terms of generalized Beurling densities. As an important application we provide necessary density conditions for sampling and interpolation in a very large class of…
We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the…
Kernel methods have been widely applied to machine learning and other questions of approximating an unknown function from its finite sample data. To ensure arbitrary accuracy of such approximation, various denseness conditions are imposed…
An important question in the theory of approximate integration is to study the conditions on the nodes $x_{k,n}$ and weights $w_{k,n}$ that allow an estimate of the form $$ \sup_{f\in \mathcal{B}_\gamma}|\sum_k…
In this paper we investigate and compare different gradient algorithms designed for the domain expression of the shape derivative. Our main focus is to examine the usefulness of kernel reproducing Hilbert spaces for PDE constrained shape…
Kernel mean embeddings have recently attracted the attention of the machine learning community. They map measures $\mu$ from some set $M$ to functions in a reproducing kernel Hilbert space (RKHS) with kernel $k$. The RKHS distance of two…