相关论文: Efficient algorithm for computing the Euler-Poinca…

Relying on the classical connection between Backward Stochastic Differential Equations (BSDEs) and non-linear parabolic partial differential equations (PDEs), we propose a new probabilistic learning scheme for solving high-dimensional…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

A domain $S\subset{\mathbb{R}}^d$ is said to fulfill the Poincar\'{e} cone property if any point in the boundary of $S$ is the vertex of a (finite) cone which does not otherwise intersects the closure $\bar{S}$. For more than a century,…

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…

This paper deals with the backward Euler method applied to semilinear parabolic stochastic partial differential equations (SPDEs) driven by additive noise. The SPDE is discretized in space by the finite element method and in time by the…

By the work of J.Huh, one can interpret binomial coefficients as a solution to an intersection problem on a permutohedral variety $X_E$. Applying Hirzebruch-Riemann-Roch, this intersection problem is equivalent to computing Euler…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

In Semi-Supervised Semi-Private (SP) learning, the learner has access to both public unlabelled and private labelled data. We propose a computationally efficient algorithm that, under mild assumptions on the data, provably achieves…

The Euler-Poincar\'e (EP) equations describe the geodesic motion on the diffeomorphism group. For template matching (template deformation), the Euler-Lagrangian equation, arising from minimizing an energy function, falls into the…

Let $\mathrm{R}$ be a real closed field, $S \subset \mathrm{R}^n$ a closed and bounded semi-algebraic set, and $\mathbf{f}=(f_1,\ldots,f_p):S \rightarrow \mathrm{R}^p$ a continuous semi-algebraic map inducing a $p$-parameter semi-algebraic…

We present a sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data. Suppose a signal S is known to consist of N equispaced samples, of which only L<N are available. If the ratio p=L/N is not close to 1,…

In this short note, we build upon some recent results to present a precise expression for the asymptotic variance of the Euler-Poincar\'e characteristic for the excursion sets of Gaussian eigenfunctions on ${\cal S}^2$.

We prove a Euler-Poincar\'e reduction theorem for stochastic processes taking values in a Lie group and we show examples of its application to SO(3) and to the group of diffeomorphisms.

We study Euler-Poincare systems (i.e., the Lagrangian analogue of Lie-Poisson Hamiltonian systems) defined on semidirect product Lie algebras. We first give a derivation of the Euler-Poincare equations for a parameter dependent Lagrangian…

We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials…

In this paper, we present a deep learning-based numerical method for approximating high dimensional stochastic partial differential equations (SPDEs). At each time step, our method relies on a predictor-corrector procedure. More precisely,…

Let $V$ be a closed subscheme of a projective space $\mathbb{P}^n$. We give an algorithm to compute the Chern-Schwartz-MacPherson class, Euler characteristic and Segre class of $ V$. The algorithm can be implemented using either symbolic or…

We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…

We consider the problem of the approximation of the solution of a one-dimensional SDE with non-globally Lipschitz drift and diffusion coefficients behaving as $x^\alpha$, with $\alpha>1$. We propose an (semi-explicit) exponential-Euler…