Team galaad

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Other Grants and Activities
Dissemination
Bibliography
Inria / Raweb 2004
Project: galaad

Bibliography

Major publications by the team in recent years

[1]
L. Busé, M. Elkadi, B. Mourrain.
Resultant over the residual of a complete intersection, in: J. of Pure and Applied Algebra, 2001, vol. 164, p. 35-57.
[2]
L. Busé, M. Elkadi, B. Mourrain.
Using projection operators in computer aided geometric design, in: Topics in algebraic geometry and geometric modeling, Providence, RI, Contemp. Math., Amer. Math. Soc., 2003, vol. 334, p. 321–342.
[3]
M. Elkadi, B. Mourrain.
Algorithms for residues and Lojasiewicz exponents, in: J. of Pure and Applied Algebra, 2000, vol. 153, p. 27-44.
[4]
I. Emiris.
Algorithmes Algébriques et Géométriques, Ph. D. Thesis, Université de Nice – Sophia-Antipolis, École Doctorale des Sciences pour l'Ingénieur, January 2000.
[5]
I.Z. Emiris, A. Galligo, H. Lombardi.
Certified Approximate Univariate GCDs, in: J. Pure & Applied Algebra, Special Issue on Algorithms for Algebra, May 1997, vol. 117 & 118, p. 229–251.
[6]
I.Z. Emiris, B. Mourrain.
Matrices in Elimination Theory, in: J. Symbolic Computation, Special Issue on Elimination, 1999, vol. 28, p. 3–44.
[7]
A. Galligo.
Théorème de division et stabilité en géométrie analytique locale, in: Ann. Inst. Fourier, 1979, vol. 29, p. 107–184.
[8]
A. Galligo, S. Watt.
A Numerical Absolute Primality Test for Bivariate Polynomials, in: Proc. Annual ACM Intern. Symp. on Symbolic and Algebraic Computation, 1997, p. 217–224.
[9]
B. Mourrain.
Algorithmes et Applications en Géométrie Algébrique, Ph. D. Thesis, Univ. de Nice, September 1997.
[10]
B. Mourrain, V. Y. Pan.
Multivariate Polynomials, Duality and Structured Matrices, in: J. of Complexity, 2000, vol. 16, no 1, p. 110-180.

Publications of the year

Doctoral dissertations and Habilitation theses

[11]
G. Chèze.
Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynômes en deux variables, Ph. D. Thesis, Université de Nice Sophia-Antipolis, 2004.
[12]
J. Pavone.
Auto-intersection de surfaces pamatrées réelles, Ph. D. Thesis, Université de Nice Sophia-Antipolis, 2004.

Articles in refereed journals and book chapters

[13]
L. Busé.
Resultants of determinantal varieties, in: J. Pure Appl. Algebra, 2004, vol. 193, no 1-3, p. 71–97.
[14]
L. Busé, C. D'Andrea.
On the irreducibility of multivariate subresultants, in: C. R. Math. Acad. Sci. Paris, 2004, vol. 338, no 4, p. 287–290.
[15]
M. Elkadi, B. Mourrain.
Residue and implicitization problem for rational surfaces, in: Appl. Algebra Eng. Comm. Comput., 2004, vol. 14, no 5.
[16]
I. Z. Emiris, B. Mourrain, V. Y. Pan.
Guest editors of the special Issue Algebraic and numerical algorithms, in: Theoret. Comput. Sci., 2004, vol. 315, no 2-3, p. 307–308.
[17]
B. Mourrain, J.-P. Técourt, M. Teillaud.
On the computation of an arrangement of quadrics in 3D, in: Comput. Geom. Theory Appl., Special issue, 19th European Workshop on Computational Geometry, Bonn, 2004.

Publications in Conferences and Workshops

[18]
F. Aries, B. Mourrain, J.-P. Técourt.
Quadratically Parametrized Surfaces: Algorithms and Applications, in: Geometric Modeling and Computing: Seattle, Nashboro Press, 2004.
[19]
L. Busé, C. D'Andrea.
Inversion of parameterized hypersurfaces by means of subresultants, in: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, New York, ACM, 2004, p. 65–71 (electronic).
[20]
L. Busé, A. Galligo.
Using semi-implicit representation of algebraic surfaces, in: Proceedings of the Shape Modeling and Applications Conference, IEEE Computer Society, 2004, p. 342-345.
[21]
G. Chèze.
Absolute polynomial factorization in several variables and the knapsack problem, in: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, New York, ACM, 2004, p. 87–94 (electronic).
[22]
M. Elkadi, A. Galligo, T. H. .
Parameterized surfaces in Im7 $\#8473 ^3$ of bidegree (1, 2), in: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, New York, ACM, 2004, p. 141–148 (electronic).
[23]
I. Z. Emiris, A. Kakargias, S. Pion, M. Teillaud, E. P. Tsigaridas.
Towards an Open Curved Kernel, in: Proc. 20th Annu. ACM Sympos. Comput. Geom., 2004, p. 438-446.
[24]
G. Gatellier, A. Labrouzy, B. Mourrain, J.-P. Técourt.
Computing the topology of 3-dimensional algebraic curves, in: Computational Methods for Algebraic Spline Surfaces, Springer-Verlag, 2004, p. 27-44.
[25]
M. Giesbrecht, G. Labahn, W.-s. Lee.
Symbolic-numeric sparse interpolation of multivariate polynomials, RWCA'04 Proc. 9th Rhine Workshop on Computer Algebra, 2004, p. 127-139.
[26]
M. Giesbrecht, G. Labahn, W.-s. Lee.
Symbolic-Numeric sparse polynomial interpolation in Chebyshev basis and trigonometric interpolation, CASC'04 Proc. 7th Internat. Workshop on Computer Algebra in Scientific Comput., TUM Press, 2004, p. 195-205.
[27]
O. Ruatta.
A multivariate interpolation scheme, in: Proc. EACA, 2004, p. 261-265.
[28]
O. Ruatta, M. Sciabica, A. Szanto.
Over-constrained Weierstrass iteration and the nearest consistent system, in: Proc. EACA, 2004, p. 267-270.

Internal Reports

[29]
L. Alberti, G. Comte, B. Mourrain.
Meshing implicit algebraic surfaces: the smooth case, Technical Report, INRIA Sophia-Antipolis, 2004, no 5405,
http://www.inria.fr/rrrt/rr-5405.html.
[30]
L. Busé, M. Elkadi, I. Emiris, G. Gatellier, A. Labrouzy, B. Mourrain, O. Ruatta, J.-P. Técourt, T. Philippe.
Prototypes of resultant-based methods, Technical Report, European project GAIA II, 2004, no deliverable 3.1.3.
[31]
L. Busé, G. Gatellier, B. Mourrain, O. Ruatta, J.-P. Técourt.
Prototype package including the implementations for 3-dimensional objects according to the list of identified problems, Technical Report, European project ECG, 2004, no ECG-TR-302109-01.
[32]
E. Fogel, D. Halperin, R. Wein, S. Pion, M. Teillaud, I. Emiris, A. Kakargias, E. Tsigaridas, E. Berberich, A. Eigenwillig, M. Hemmer, L. Kettner, K. Mehlhorn, E. Schomer, N. Wolpert.
An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs (preliminary version), Technical Report, Tel-Aviv University, INRIA Sophia-Antipolis, MPI Saarbrücken, 2004, no ECG-TR-361200-01.
[33]
B. Mourrain, F. Rouillier, M.-F. Roy.
Bernstein's basis and real root isolation, Technical Report, INRIA Rocquencourt, 2004, no 5149,
http://www.inria.fr/rrrt/rr-5149.htmlno.
[34]
O. Ruatta, M. Sciabica, A. Szanto.
Over-constrained Weierstrass iteration and the nearest consistent system, Technical report, INRIA Sophia Antipolis, june 2004, no 5215,
http://www.inria.fr/rrrt/rr-5215.html.

Miscellaneous

[35]
L. Alberti.
Maillage de surfaces algébriques réelles singulières, 2004.
[36]
H. Khalil.
Résolution des systèmes polynomiaux par valeurs et vecteurs propres, 2004.

References in notes

[37]
H. Brönnimann, I. Emiris, V. Pan, S. Pion.
Sign Determination in Residue Number Systems, in: Theoretical Computer Science, Special Issue on Real Numbers and Computers, 1999, vol. 210, no 1, p. 173-197.
[38]
L. Busé, M. Elkadi, B. Mourrain.
Resultant over the residual of a complete intersection, in: Journal of Pure and Applied Algebra, 2001, vol. 164 (1-2), p. 35-57.
[39]
L. Busé.
Computing resultant matrices with Macaulay2 and Maple, Technical Report, INRIA Sophia-Antipolis, 2003, no 0280,
http://www.inria.fr/rrrt/rt-0280.html.
[40]
J.F. Canny, I.Z. Emiris.
A Subdivision-Based Algorithm for the Sparse Resultant, in: J. ACM, May 2000, vol. 47, no 3, p. 417–451.
[41]
J. Canny, P. Pedersen.
An Algorithm for the Newton Resultant, Technical report, Comp. Science Dept., Cornell University, 1993, no 1394.
[42]
M. Chardin.
Multivariate subresultants, in: J. Pure and Appl. Alg., 1995, vol. 101, p. 129-138.
[43]
O. Devillers, A. Fronville, B. Mourrain, M. Teillaud.
Algebraic methods and arithmetic filtering for exact predicates on circle arcs, in: Comput. Geom. Theory Appl., 2002, vol. 22, p. 119–142.
[44]
M. Elkadi, B. Mourrain.
A new algorithm for the geometric decomposition of a variety, in: Proc. Intern. Symp. on Symbolic and Algebraic Computation, S. Dooley (editor), ACM Press, New-York, 1999, p. 9-16,
ftp://ftp-sop.inria.fr/galaad/mourrain/9903-ElMo-issac.ps.gz.
[45]
A. Galligo, D. Rupprecht.
Irreducible decomposition of curves, in: J. of Symbolic Computation, 2002, vol. 33, no 5, p. 661–675.
[46]
J. Jouanolou.
Le Formalisme du résultant, in: Adv. in Math., 1991, vol. 90, no 2, p. 117-263.
[47]
F. Macaulay.
Some Formulae in Elimination, in: Proc. London Math. Soc., 1902, vol. 1, no 33, p. 3-27.
[48]
B. Mourrain, V. Y. Pan.
Multivariate Polynomials, Duality and Structured Matrices, in: J. of Complexity, 2000, vol. 16, no 1, p. 110-180.
[49]
B. Mourrain, O. Ruatta.
Relation between roots and coefficients, interpolation and application to system solving, in: Journal of Symbolic Computation, 2002, vol. 33, no 5, p. 679-699.
[50]
O. Ruatta.
A Multivariate Weierstrass Iterative Rootfinder, in: Proc. Intern. Symp. on Symbolic and Algebraic Computation, London, Ontario, B. Mourrain (editor), New-York, ACM Press., 2001, p. 276-283.
[51]
O. Ruatta.
Dualité des algèbres et problèmes d'effectivité en géométrie algébrique, Ph. D. Thesis, Université d'Aix-Marseille II, 2002.
[52]
D. Rupprecht.
Éléments de Géométrie Algébrique Approchée : Étude du PGCD et de la factorisation, Ph. D. Thesis, Université de Nice - Sophia Antipolis, Jan. 2000.
[53]
T. Sasaki.
Approximate multivariate polynomial factorization based on zero-sum relations, in: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001), B. Mourrain (editor), ACM, 2001, p. 284–291.
[54]
A. Sommese, J. Verschelde, C. Wampler.
Symmetric functions applied to decomposing solution sets of polynomial systems, in: SIAM J. Numer. Anal., 2002, vol. 40, no 6, p. 2026–2046.
[55]
M. van Hoeij.
Factoring polynomials and the knapsack problem, in: J. Number Theory, 2002, vol. 95, no 2, p. 167–189.
[56]
W. Wang, R. Krasauskas.
Interference analysis of conics and quadrics, in: Topics in algebraic geometry and geometric modeling, Providence, RI, Contemp. Math., Amer. Math. Soc., 2003, vol. 334, p. 25–36.

previous
next