相关论文: Rigorous numerics for critical orbits in the quadr…
We consider a mathematical model of the breakout game where $\mathbb{R}^2$ is covered by unit square bricks everywhere except in one place. We introduce elementary blocks (particular sets of bricks) in order to describe a family of periodic…
We consider piecewise quadratic perturbations of centers of piecewise quadratic systems in two zones determined by a straight line through the origin. By means of expansions of the displacement map, we are able to find isolated zeros of it,…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
A field-theoretic description of the critical behavior of weakly disordered systems with a $p$-component order parameter is given. For systems of an arbitrary dimension in the range from three to four, a renormalization group analysis of…
In this article we consider the behavior in the vicinity of infinity of the class of all planar quadratic differential systems. This family depends on twelve parameters but due to action of the affine group and re-scaling of time the family…
We study the stratum in the set of all quadratic differential systems $\dot{x}=P_2(x,y), \dot{y}=Q_2(x,y)$ with a center, known as the codimension-four case $Q_4$. It has a center and a node and a rational first integral. The limit cycles…
The construction of confidence intervals for the mean of a bounded random variable is a classical problem in statistics with numerous applications in machine learning and virtually all scientific fields. In particular, obtaining the…
In this article we establish central limit theorems for multilevel Polyak-Ruppert averaged stochastic approximation schemes. We work under very mild technical assumptions and consider the slow regime in wich typical errors decay like…
In this paper, we solve a maximization problem where the objective function is quadratic and convex or concave and the constraints set is the reachable value set of a convergent discrete-time affine system. Moreover, we assume that the…
Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…
Subspace methods are commonly used for finding approximate eigenvalues and singular values of large-scale matrices. Once a subspace is found, the Rayleigh-Ritz method (for symmetric eigenvalue problems) and Petrov-Galerkin projection (for…
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
Glass networks model systems of variables that interact via sharp switching. A body of theory has been developed over several decades that, in principle, allows rigorous proof of dynamical properties in high dimensions that is not normally…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
We give the first example of a transitive quadratic map whose real and complex geometric pressure functions have a high-order phase transition. In fact, near the phase transition these functions behave as $x \mapsto \exp (- 1 / x^2)$ near…
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
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…
A numerical procedure and its MAPLE implementation capable of rigorously, albeit in a brute-force manner, proving specific strict one-variable inequalities in specific finite intervals is described. The procedure is useful, for instance, to…
We describe an analytical method for computing the orbital parameters of a planet from the periodogram of a radial velocity signal. The method is very efficient and provides a good approximation of the orbital parameters. The accuracy is…
We present a method to efficiently compute the eigenfunctions of classically chaotic systems. The key point is the definition of a modified Gram-Schmidt procedure which selects the most suitable elements from a basis set of scar functions…