Related papers: Symbolic Computations of First Integrals for Polyn…
In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of…
In arXiv:2305.03945 [math.NA], a first-order optimization algorithm has been introduced to solve time-implicit schemes of reaction-diffusion equations. In this research, we conduct theoretical studies on this first-order algorithm equipped…
We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
We present an algorithm which allows to solve analytically linear systems of differential equations which factorize to first order. The solution is given in terms of iterated integrals over an alphabet where its structure is implied by the…
We prove a sufficient condition for the existence of explicit first integrals for vector fields which admit an integrating factor. This theorem recovers and extends previous results in the literature on the integrability of vector fields…
In this paper we present the solver DuQuad specialized for solving general convex quadratic problems arising in many engineering applications. When it is difficult to project on the primal feasible set, we use the (augmented) Lagrangian…
In this work we show how auxiliary variables can be used to give an efficient method involving symbolic manipulation and Picard iteration for approximating solutions of certain Volterra integral equations.
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…
The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski's algorithm for computing the Galois group of a linear differential…
In this work we develop an algorithmic procedure for associating a function defined on the Riemann surface of the $\log$ to given asymptotic data from a function at an essential singularity. We do this by means of rational approximations…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We consider a discrete equation, defined on the two-dimensional square lattice, which is linearizable, namely, of the Burgers type and depends on a parameter $\alpha$. For any natural number $N$ we choose $\alpha$ so that the equation…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…
In this article we bound the number of remarkable values of a polynomial vector field. The proof is short and based on Jouanolou's theorem about rational first integrals of planar polynomial derivations. Our bound is given in term of the…
This paper provides a probabilistic approach to solve linear equations involving Caputo and Riemann-Liouville type derivatives. Using the probabilistic interpretation of these operators as the generators of interrupted Feller processes, we…
Diffusive representations of fractional differential and integral operators can provide a convenient means to construct efficient numerical algorithms for their approximate evaluation. In the current literature, many different variants of…
We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…