相关论文: Near-best univariate spline discrete quasi-interpo…

Are quantum advantages in discrete manufacturing achievable in the near term? As manufacturing-relevant NISQ algorithms, we identified Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) for combinatorial…

We construct new Delone sets associated with badly approximable numbers which are expected to have rotationally invariant diffraction. We optimize the discrepancy of corresponding tile orientations by investigating the linear equation…

In 2004, J-C. Aval, F. Bergeron and N. Bergeron studied the algebra of diagonally quasi-symmetric functions $\operatorname{\mathsf{DQSym}}$ in the ring $\mathbb{Q}[\mathbf{x},\mathbf{y}]$ with two sets of variables. They made conjectures on…

Rational best approximations (in a Chebyshev sense) to real functions are characterized by an equioscillating approximation error. Similar results do not hold true for rational best approximations to complex functions in general. In the…

We present a dimension-incremental method for function approximation in bounded orthonormal product bases to learn the solutions of various differential equations. Therefore, we decompose the source function of the differential equation…

The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword…

We study an abstract family of asymptotically degenerating variational problems. Those are natural generalisations of families of problems emerging upon application of a rescaled Floquet-Bloch-Gelfand transform to resolvent problems for…

We establish Maxwell compactness results for the Discrete De Rham (DDR) polytopal complex: sequences in this polytopal complex with bounded discrete $\boldsymbol{H}(\mathbf{curl})$ (resp. discrete $\boldsymbol{H}(\mathrm{div})$) norm and…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We present a new approach to the numerical upscaling for elliptic problems with rough diffusion coefficient at high contrast. It is based on the localizable orthogonal decomposition of $H^1$ into the image and the kernel of some novel…

This paper establishes comprehensive stability results for quasi-variational inequalities (QVIs) under monotone perturbations of the governing operator. We prove strong convergence of both minimal and maximal solutions when sequences of…

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(\epsilon_{\rm…

In this paper, we give a causal solution to the problem of spline interpolation using H-infinity optimal approximation. Generally speaking, spline interpolation requires filtering the whole sampled data, the past and the future, to…

Decoded Quantum Interferometry (DQI) promises superpolynomial speedups for structured optimization; however, its practical realization is often hindered by significant sensitivity to hardware noise and spectral dispersion. To bridge this…

We introduce a semi-implicit Milstein approximation scheme for some class of non-colliding particle systems modeled by systems of stochastic differential equations with non-constant diffusion coefficients. We show that the scheme converges…

In photonics, Dispersive Quasi-Normal Modes (DQNMs) refer to optical resonant modes, solutions of spectral problems associated with Maxwell's equations for open photonic structures involving dispersive media. Since these DQNMs are the…

Numerically computing global policies to optimal control problems for complex dynamical systems is mostly intractable. In consequence, a number of approximation methods have been developed. However, none of the current methods can quantify…

Quantum Computing offers a new paradigm for efficient computing and many AI applications could benefit from its potential boost in performance. However, the main limitation is the constraint to linear operations that hampers the…

We present a distributed quasi-Newton (DQN) method, which enables a group of agents to compute an optimal solution of a separable multi-agent optimization problem locally using an approximation of the curvature of the aggregate objective…

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…