Pierre Verlinden
Katholieke Universiteit Leuven
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Pierre Verlinden.
SIAM Journal on Numerical Analysis | 1994
Jan Verschelde; Pierre Verlinden; 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
Numerische Mathematik | 1992
Pierre Verlinden; Ronald Cools
\mathbb{C}_0^n ,\mathbb{C}_0 = \mathbb{C} \backslash \{ 0\}
Journal of Computational and Applied Mathematics | 1997
Pierre Verlinden
, of a polynomial system with a sparse monomial structure. First an algorithm is described for computing the BKK bound. Following the lines of Bernshtei˘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 Bezout number. Applications illustrate the effectiveness of the new approach.
Numerische Mathematik | 1993
Pierre Verlinden; Anny Haegemans
SummaryThe structure of cubature formulae of degree 4k+1 whose number of nodes is equal to Möllers lower bound is investigated for integrals with circular symmetry. A simple criterion is derived for the existence of such formulae. It shows that fork=1 Möllers lower bound can always be attained with Radons formulae. It also allows to prove that for several integrals with circular symmetry and several values ofk>1, Möllers lower bound cannot be attained.The structure of cubature formulae of degree 4k+1 whose number of nodes is equal to Mollers lower bound is investigated for integrals with circular symmetry. A simple criterion is derived for the ...
Computing | 1988
Pierre Verlinden; Ronald Cools; Dirk Roose; Anny Haegemans
An asymptotic error expansion for Gauss-Legendre quadrature is derived for an integrand with an endpoint singularity. It permits convergence acceleration by extrapolation.
Mathematics of Computation | 1994
Pierre Verlinden; Ronald Cools
SummaryA common strategy in the numerical integration over ann-dimensional hypercube or simplex, is to consider a regular subdivision of the integration domain intomn subdomains and to approximate the integral over each subdomain by means of a cubature formula. An asymptotic error expansion whenm → ∞ is derived in case of an integrand with homogeneous boundary singularities. The error expansion also copes with the use of different cubature formulas for the boundary subdomains and for the interior subdomains.
Numerical Algorithms | 1997
Pierre Verlinden; D.M Potts; J.N Lyness
AbstractCubature formulae of degree 11 with minimal numbers of knots for the integral
Numerical Algorithms | 1992
Pierre Verlinden; Anny Haegemans
Numerical Algorithms | 1999
Pierre Verlinden
\int\limits_{ - 1}^1 { \int\limits_{ - 1}^1 {(1 - x^2 )^\alpha } } (1 - y^2 )^\alpha f(x,y) dxdy \alpha > - 1
Journal of Computational and Applied Mathematics | 2001
Peter Kravanja; Pierre Verlinden