Let {f1, f2,..., ft} ⊂ Q[z1,..., zN] be a set of homogeneous polyno-mials. Let Z denote the complex, projective, algebraic set determined by the homogeneous ideal I = (f1, f2,..., ft) ⊂ C[z1,..., zN]. Numer-ical continuation-based methods can be used to produce arbitrary pre-cision numerical approximations of generic points on each irreducible component of Z. Consider the prime decompositio
We describe three ways to generalise Lenstra's algebraic integer recovery method. One direction adap...
Homotopies for polynomial systems provide computational evidence for a challenging instance of a con...
This paper addresses the question of retrieving the triple (X,P,E) from the algebraic geometry code ...
In numerical algebraic geometry, a witness point set W is a key object for performing nu-merical com...
Many applications modeled by polynomial systems have positive dimensional solution components (e.g.,...
The set of common roots of a finite set I (it is an ideal) of homogeneous polyno-mials is known as p...
The thesis considers two distinct strategies for algebraic computation with polynomials in high dime...
Polynomial systems arise in many applications: robotics, kinematics, chemical kinetics, computer v...
Abstract. Numerical algebraic geometry uses numerical data to de-scribe algebraic varieties. It is b...
Abstract This paper illustrates how methods such as homotopy continuation and monodromy, when combin...
Many applications modeled by polynomial systems have positive dimensional solution components (e.g.,...
This thesis studies various aspects of differential algebra, from fundamental concepts to practical ...
多項式の組f(x), cg(x)in mathbb{Z}[x]が互いに素であるか判定する.In this paper, we propose how to find out whether univa...
Geometric computation in computer aided geometric design and solid modeling calls for solving non-li...
Summary. This article describes a method to compute successive convex approxi-mations of the convex ...
We describe three ways to generalise Lenstra's algebraic integer recovery method. One direction adap...
Homotopies for polynomial systems provide computational evidence for a challenging instance of a con...
This paper addresses the question of retrieving the triple (X,P,E) from the algebraic geometry code ...
In numerical algebraic geometry, a witness point set W is a key object for performing nu-merical com...
Many applications modeled by polynomial systems have positive dimensional solution components (e.g.,...
The set of common roots of a finite set I (it is an ideal) of homogeneous polyno-mials is known as p...
The thesis considers two distinct strategies for algebraic computation with polynomials in high dime...
Polynomial systems arise in many applications: robotics, kinematics, chemical kinetics, computer v...
Abstract. Numerical algebraic geometry uses numerical data to de-scribe algebraic varieties. It is b...
Abstract This paper illustrates how methods such as homotopy continuation and monodromy, when combin...
Many applications modeled by polynomial systems have positive dimensional solution components (e.g.,...
This thesis studies various aspects of differential algebra, from fundamental concepts to practical ...
多項式の組f(x), cg(x)in mathbb{Z}[x]が互いに素であるか判定する.In this paper, we propose how to find out whether univa...
Geometric computation in computer aided geometric design and solid modeling calls for solving non-li...
Summary. This article describes a method to compute successive convex approxi-mations of the convex ...
We describe three ways to generalise Lenstra's algebraic integer recovery method. One direction adap...
Homotopies for polynomial systems provide computational evidence for a challenging instance of a con...
This paper addresses the question of retrieving the triple (X,P,E) from the algebraic geometry code ...