Related papers: Tractability of multivariate analytic problems
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
This paper develops a functional-analytic framework for approximating the push-forward induced by an analytic map from finitely many samples. Instead of working directly with the map, we study the push-forward on the space of locally…
Complicated physical problems usually are solved by resorting to perturbation theory leading to solutions in the form of asymptotic series in powers of small parameters. However, finite, and even large values of the parameters often are of…
This work is devoted to study the relation between the regularity index and the decay for solutions of the modified Korteweg-de Vries equation in weighted Sobolev spaces. We show if a solution belongs to a Sobolev space and has a large…
Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…
We prove trace theorems for weighted mixed norm Sobolev spaces in the upper-half space where the weight is a power function of the vertical variable. The results show the differentiability order of the trace functions depends only on the…
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal…
We study fractional variants of the quasi-norms introduced by Brezis, Van Schaftingen, and Yung in the study of the Sobolev space $\dot W^{1,p}$. The resulting spaces are identified as a special class of real interpolation spaces of…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
We establish several fundamental properties of analysis-suitable T-splines which are important for design and analysis. First, we characterize T-spline spaces and prove that the space of smooth bicubic polynomials, defined over the extended…
We introduce and study properties of certain new harmonic function spaces on products of upper half-spaces.Norm estimates for the so-called expanded Bergman projections are obtained.Sharp theorems on multipliers acting on certain Sobolev…
Due to the limitation on computational power of existing computers, the polynomial time does not works for identifying the tractable problems in big data computing. This paper adopts the sublinear time as the new tractable standard to…
Optimization of decision problems in stochastic environments is usually concerned with maximizing the probability of achieving the goal and minimizing the expected episode length. For interacting agents in time-critical applications,…
The main result of [C. Morosi and L. Pizzocchero, Nonlinear Analysis, 2012] is presented in a variant, based on a C^infinity formulation of the Cauchy problem; in this approach, the a posteriori analysis of an approximate solution gives a…
The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of…
We lay some mathematically rigorous foundations for the resolution of differential equations with respect to semi-classical bases and topologies, namely Freud-Sobolev polynomials and spaces. In this quest, we uncover an elegant theory…
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a…
In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…
We develop an approximation theory in Hilbert spaces that generalizes the classical theory of approximation by entire functions of exponential type. The results advance harmonic analysis on manifolds and graphs, thus facilitating data…