Related papers: Summation-by-parts operators for general function …
The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…
Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
Convergence of operators acting on a given Hilbert space is an old and well studied topic in operator theory. The idea of introducing a related notion for operators acting on arying spaces is natural. However, it seems that the first…
The calculation of a large family of four point functions of general BPS operators in N=4 SYM is reduced to the evaluation of colour contractions. For 1/2 BPS operators O_\Delta the explicit results at order g^4 for the function < O_n O_2…
In this paper, we design high order accurate and stable finite difference schemes for the initial-boundary value problem, associated with the magnetic induction equation with resistivity. We use Summation-By-Parts (SBP) finite difference…
Efficiency of intrinsic operator techniques (using only products and ranks of tensor operators) is first evidenced by condensed proofs of already known $\bigtriangledown$-triangle sum rules of su(2)/su$_q$(2). {\em A new compact}…
In this paper, we present a block-oriented scheme for adaptive mesh refinement based on summation-by-parts (SBP) finite difference methods and simultaneous-approximation-term (SAT) interface treatment. Since the order of accuracy at SBP-SAT…
We study the properties of different type of transforms by means of operational methods and discuss the relevant interplay with many families of special functions. We consider in particular the binomial transform and its generalizations. A…
This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…
In the last decades many authors have become interested in the study of multilinear and polynomial generalizations of families of operator ideals (such as, for instance, the ideal of absolutely summing operators). However, these…
Submodular functions are at the core of many machine learning and data mining tasks. The underlying submodular functions for many of these tasks are decomposable, i.e., they are sum of several simple submodular functions. In many data…
We show that the binomial states (BS) of Stoler {\it et al.} admit the ladder and displacement operator formalism. By generalizing the ladder operator formalism we propose an eigenvalue equation which possesses the number and the squeezed…
Sampling-based algorithms are classical approaches to perform Bayesian inference in inverse problems. They provide estimators with the associated credibility intervals to quantify the uncertainty on the estimators. Although these methods…
It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are…
We will show that a local space-time estimate implies a global space-time estimate for dispersive operators. In order for this implication we consider a Littlewood-Paley type square function estimate for dispersive operators in a time…
The convergence of a new general variable metric algorithm based on compositions of averaged operators is established. Applications to monotone operator splitting are presented.
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…
In this paper, we present the basic concepts of the geometric theory of composition operators on Sobolev spaces. The main objects of the theory are topological mappings which generate bounded embedding operators on Sobolev spaces by the…
A sum-product network (SPN) is a probabilistic model, based on a rooted acyclic directed graph, in which terminal nodes represent univariate probability distributions and non-terminal nodes represent convex combinations (weighted sums) and…