Ronald Cools

Ronald Cools

Auto-generated profile, based on publicly available information

Ronald Cools

KU Leuven

Research Focus & Metrics

Academic Career Length

41Years (1986-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 January 2006 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
DNDirk Nuyens
Dirk Nuyens
RCRonald Cools
Ronald Cools
We reformulate the original component-by-component algorithm for rank- 1 1 lattices in a matrix-vector notation so as to highlight its structural properties. For function spaces similar to a weighted Korobov space, we derive a technique which has construction cost O ( s n log ⁡ ( n ) ) O(s n \log (n)) , in contrast with the original algorithm which has construction cost O ( s n 2 ) O(s n^2) . Herein s s is the number of dimensions and n n the number of points (taken prime). In contrast to other approaches to speed up construction, our fast algorithm computes exactly the same quantity as the original algorithm. The presented algorithm can also be used to construct randomly shifted lattice rules in weighted Sobolev spaces.

1 June 2003 in Journal of Complexity
Verified
Journal Article
Closed access
RCRonald Cools
Ronald Cools

1 January 1997 in Acta Numerica
Verified
Journal Article
Closed access
PDF file
RCRonald Cools
Ronald Cools
In this paper we present a general, theoretical foundation for the construction of cubature formulae to approximate multivariate integrals. The focus is on cubature formulae that are exact for certain vector spaces of polynomials. Our main quality criteria are the algebraic and trigonometric degrees. The constructions using ideal theory and invariant theory are outlined. The known lower bounds for the number of points are surveyed and characterizations of minimal cubature formulae are given. We include references to all known minimal cubature formulae. Finally, some methods to construct cubature formulae illustrate the previously introduced concepts and theorems.

1 November 1993 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
RCRonald Cools
Ronald Cools
PRPhilip Rabinowitz
Philip Rabinowitz

1 June 1994 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
JVJan Verschelde
Jan Verschelde
PVPierre Verlinden
Pierre Verlinden
RCRonald Cools
Ronald Cools
This paper is concerned with the problem of finding all isolated solutions of a polynomial system. The BKK bound, defined as the mixed volume of the Newton polytopes of the polynomials in the system, is a sharp upper bound for the number of isolated solutions in $\mathbb{C}_0^n ,\mathbb{C}_0 = \mathbb{C} \backslash \{ 0\} $, of a polynomial system with a sparse monomial structure. First an algorithm is described for computing the BKK bound. Following the lines of Bernshte[Formula: see text]n’s proof, the algorithmic construction of the cheater’s homotopy or the coefficient homotopy is obtained. The mixed homotopy methods can be combined with the random product start systems based on a generalized Bézout number. Applications illustrate the effectiveness of the new approach.

1 January 2006 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
RCRonald Cools
Ronald Cools
FKFrances Y. Kuo
Frances Y. Kuo
DNDirk Nuyens
Dirk Nuyens
Lattice rules are a family of equal‐weight cubature formulae for approximating high‐dimensional integrals. By now it is well established that good generating vectors for lattice rules having n points can be constructed component‐by‐component for integrands belonging to certain weighted function spaces, and that they can achieve the optimal rate of convergence. Although the lattice rules constructed this way are extensible in dimension, they are not extensible in n; thus when n is changed the generating vector needs to be constructed anew. In this paper we introduce a new algorithm for constructing good generating vectors for embedded lattice rules which can be used for a range of n while still being extensible in dimension. By using an adaptation of the fast component‐by‐component construction algorithm (which makes use of fast Fourier transforms), we are able to obtain good generating vectors for thousands of dimensions and millions of points, under both product weight and order‐dependent weight settings, at the cost of $\calO(d n (\log (n))^2)$ operations. With a sufficiently large number of points and good overall quality, these embedded lattice rules can be used for practical purposes in the same way as a low‐discrepancy sequence. We show for a range of weight settings in an unanchored Sobolev space that our embedded lattice rules achieve the same (optimal) rate of convergence $\calO(n^{-1+\delta})$, $\delta>0$, as those constructed for a fixed number of points, and that the implied constant gains only a factor of 1.30 to 1.55.