192
click to vote
MOC
9 years 10 months ago
2016 
We present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach builds upon a method proposed by Ferragut ...
115
click to vote
MOC
9 years 10 months ago
2016
Abstract. The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial ...
MOC
9 years 10 months ago
2016
We study analytical properties of the Toro-Titarev solver for generalized Riemann problems (GRPs), which is the heart of the flux computation in ADER generalized Godunov schemes. ...
110
click to vote
MOC
9 years 10 months ago
2016 
We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of 1 minimization with linear constraints, and quantify the asymptotic linear convergence r...
102
click to vote
MOC
9 years 10 months ago
2016 
Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in [T−a, T+a]. We also prove a bound for the multiplicity...
|
Information Technology