Related papers: Recent advances in rigorous computation of Poincar…
We investigate the use of conformal maps for the acceleration of convergence of the trapezoidal rule and Sinc numerical methods. The conformal map is a polynomial adjustment to the $\sinh$ map, and allows the treatment of a finite number of…
Last two decades, the problem of robotic mapping has made a lot of progress in the research community. However, since the data provided by the sensor still contains noise, how to obtain an accurate map is still an open problem. In this…
In this article a new upper bounds for the multiple trigonometrical integrals are found. The method of the work based on a new method of estimation for the areas of algebraic surfaces.
Invariant manifolds of unstable periodic orbits organize the dynamics of chaotic orbits in phase space. They provide insight into the mechanisms of transport and chaotic advection and have important applications in physical situations…
Piecewise smooth maps are known to exhibit a wide range of dynamical features including numerous types of periodic orbits. Predicting regions in parameter space where such periodic orbits might occur and determining their stability is…
We study the problem of computing the upper bound of the discrete Fr\'{e}chet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn \emph{et al}. If shortcuts are allowed, we…
This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…
In this paper I survey some recent results on finite determination, convergence, and approximation of formal mappings between real submanifolds in complex spaces. A number of conjectures are also given.
This paper is devoted to Poincar\'e's work in probability. Though the subject does not represent a large part of the mathematician's achievements, it provides significant insight into the evolution of Poincar\'e's thought on several…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
Poincar\'e maps play a fundamental role in nonlinear dynamics and chaos theory, offering a means to reduce the dimensionality of continuous dynamical systems by tracking the intersections of trajectories with lower-dimensional section…
Poincar{\'e} inequalities are ubiquitous in probability and analysis and have various applications in statistics (concentration of measure, rate of convergence of Markov chains). The Poincar{\'e} constant, for which the inequality is tight,…
We propose a computer-assisted approach to studying the effective continuum behavior of spatially discrete evolution equations. The advantage of the approach is that the "coarse model" (the continuum, effective equation) need not be…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
We propose a new method for obtaining Poincare-type inequalities on arbitrary convex bodies in R^n. Our technique involves a dual version of Bochner's formula and a certain moment map, and it also applies to some non-convex sets. In…
In this article, we consider scenarios in which traditional estimates for the active subspace method based on probabilistic Poincar\'e inequalities are not valid due to unbounded Poincar\'e constants. Consequently, we propose a framework…
Complex interval arithmetic is a powerful tool for the analysis of computational errors. The naturally arising rectangular, polar, and circular (together called primitive) interval types are not closed under simple arithmetic operations,…
Modern sampling methods create ensembles of district maps that score well on discrete compactness scores, whereas the Polsby-Popper and other shape-based scores remain highly relevant for building fair maps and litigating unfair ones. The…
Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…
The work is devoted to the construction of a new interval arithmetic which would combine algorithmic efficiency and high quality estimation of the ranges of expressions.