(Enter summary)
Abstract: The need to combine symbolic and numeric computations is ubiquitous is many problems such as the forward and inverse kinematics of robots, motion planning, the analysis of the geometric structure of molecules, computational geometry, geometric and solid modelling, graphics, computer-aided design, computer vision, signal processing... Starting with an exact or approximate description of the equations, we will eventually have to compute a numerical approximation of the solutions. This leads to... (Update)
Context of citations to this paper: More
.... polynomial de ning A) Experimentations with polynomials of degree up to 10 shows the power and practical impact of such methods [69]. It is a challenging and open problem to generalize these techniques to the multivariate cases. A step in this direction has been done in...
Cited by: More
On Circular Cylinders by Four or Five Points in Space - Devillers, Mourrain.. (2001)
(Correct)
Effective Computational Geometry for Curves and Surfaces: An.. - Mourrain
(Correct)
Similar documents (at the sentence level):
5.6%: A Framework for Symbolic and Numeric Computations - Mourrain, Prieto (2000)
(Correct)
Active bibliography (related documents): More All
1.7: Matrices in Elimination Theory - Emiris, Mourrain (1998)
(Correct)
1.7: Some Applications of Bezoutians in Effective Algebraic Geometry - Elkadi, Mourrain (1998)
(Correct)
1.6: An Environment for Symbolic and Numeric Computation - Reis, Mourrain, Rouillier.. (2002)
(Correct)
Similar documents based on text: More All
0.2: Relation Between Roots And Coefficients, Interpolation And.. - Mourrain, Ruatta (2001)
(Correct)
0.1: Solving Polynomial Systems By Matrix Computations - Mourrain (1997)
(Correct)
0.1: Workshop on Symbolic-Numeric Algebra for Polynomials SNAP 96.. - Emiris, al. (1996)
(Correct)
Related documents from co-citation: More All
2: Matrices in elimination theory
- Emiris, Mourrain - 1997
2: A reordered Schur factorization method for zero-dimensional polynomial systems w..
- Corless, Gianni et al. - 1997
2: Solving projective complete intersection faster
- Mourrain, Trbuchet - 2000
BibTeX entry: (Update)
B. Mourrain and H. Prieto, A framework for symbolic and numeric computations, Rapport de Recherche 4013, INRIA, 2000. http://citeseer.ist.psu.edu/article/mourrain00framework.html More
@techreport{ mourrain00framework,
author = "B. Mourrain and H. Prieto",
title = "A framework for symbolic and numeric computations",
number = "4013",
institution = "INRIA",
year = "2000",
url = "citeseer.ist.psu.edu/article/mourrain00framework.html" }
Citations (may not include all citations):
744
Matrix computations (context) - Golub, Van Loan - 1996
650
Three-Dimensional Computer Vision: a Geometric Viewpoint (context) - Faugeras - 1993
624
The Algebraic Eigenvalue Problem (context) - Wilkinson - 1965
525
Iterative methods for sparse linear systems (context) - Saad - 1996
290
The Complexity of Robot Motion Planning (context) - Canny - 1988
104
and Algorithms: An Introduction to Computational Algebraic G.. (context) - Cox, Little et al. - 1992
72
the combinatorial and algebraic complexity of quantier elimi..
- Basu, Pollack et al. - 1994
52
Algorithms for intersecting parametric and algebraic curves ..
- Manocha, Demmel - 1995
48
GNU Multiple Precision Arithmetic Library (context) - Granlund - 1996
48
The number of roots of a system of equations (context) - Bernstein - 1975
43
Newton polyhedra and the genus of complete intersections (context) - Khovanskii - 1978
31
An eOEcient algorithm for the sparse mixed resultant (context) - Canny, Emiris - 1993
30
Matrices in Elimination Theory
- Emiris, Mourrain - 1999
30
Solving systems of polynomial inequalities in subexponential.. (context) - Grigoryev, Vorobjov - 1988
27
the computational complexity and geometry of the rst order t.. (context) - Renegar - 1992
25
duality and structured matrices (context) - Mourrain, Pan - 2000
24
Computing isolated polynomial roots by matrix methods (context) - Mourrain - 1998
21
Improved algorithms for sign determination and existential q..
- Canny - 1993
21
STL tutorial and reference guide : C++ programming with the .. (context) - Musser, Saini - 1996
21
the applications of multi-equational resultants (context) - Bajaj, Garrity et al. - 1988
21
A perspective of modern methods in computer-aided drug desig.. (context) - Balbes, Mascarella et al. - 1994
19
Generative Programming And Active Libraries (context) - Czarnecki, Eisenecker et al. - 1998
19
Eigenproblems are at the heart of polynomial system solving (context) - Stetter - 1996
18
Numerical computation of polynomial zeros by means of aberth.. (context) - Bini - 1997
18
Enumeration problems in Geometry (context) - Mourrain - 1996
18
Stewart platforms without computer
- Ronga, Vust - 1992
16
Controlled iterative methods for solving polynomial systems
- Bondyfalat, Mourrain et al. - 1998
15
Algebraic approach of residues and applications
- Cardinal, Mourrain - 1995
14
The Stewart-Gough platform of general geometry can have 40 r.. (context) - Dietmaier - 1998
14
Solving projective complete intersection faster
- Mourrain, Tr - 2000
14
Residue Currents and Bezout Identities (context) - Berenstein, Gay et al. - 1993
14
Advanced lectures in Mathematics (context) - Kunz, hler - 1986
14
Bounds for traces in complete intersections and degrees in t.. (context) - Sabia, Solerno - 1995
12
Funktsional'nyi Analiz i Ego Prilozheniya (context) - Kushnirenko, the et al. - 1976
12
a theory of syzygetic relations of two rational integral fun.. (context) - Sylvester
12
SuperLU Users' Guide
- Demmel, Gilbert et al. - 1997
11
Vol 1 : Fundamental Algorithms (context) - Bini, Pan et al. - 1994
11
On two iterative methods for approximating the roots of a po.. (context) - Cardinal - 1995
11
A new criterion for normal form algorithms
- Mourrain - 1999
11
generic positions of a parallel robot
- Mourrain - 1993
10
Complexity of Quantier Elimination in the Theory of Algebrai.. (context) - Chistov, Grigoryev - 1984
10
of Pure and Applied Algebra (context) - Elkadi, Mourrain et al. - 2000
9
Algebraic Methods and Arithmetic Filtering for Exact Predica.. (context) - Fronville, Devillers et al. - 2000
9
Geometric and Solid Modeling (context) - Hooemann - 1989
9
Generalized Stewart Platform: How to compute with rigid moti.. (context) - Lazard - 1993
9
volume 133 of Graduate Texts in Math (context) - Harris, course - 1992
8
Kronecker symbol and Eisenbud-Levin formula (context) - Becker, Cardinal et al. - 1996
7
Computer algebra methods for studying and computing molecula..
- Emiris, Mourrain - 1999
6
Active Libaries: Rethinking the roles of compilers and libra.. (context) - Veldhuizen, Cannon - 1998
6
Some applications of bezoutians in eoeective algebraic geome.. (context) - Elkadi, Mourrain - 1998
5
Solving polynomial systems for the the kinematic analysis of.. (context) - Raghavan, Roth - 1995
5
National Institute of Standards and Technology (context) - Jack, Andrew et al. - 1996
4
Approche eoeective des r#sidus alg#briques (context) - Elkadi, Mourrain - 1996
4
Polynomial test suite (context) - Bini, Mourrain - 1998
4
Multdimensional analogues of newtons formulas for systems of.. (context) - Aizenberg, Kytmanov - 1939
4
Polynomial system solving; the case of a 6-atom molecule (context) - Emiris, Mourrain - 1996
3
standard template library (context) - Robson, STL - 1998
3
Vers une nouvelle approche du calcul scientique en c (context) - Reis - 1998
3
Principles of numerical polynomial algebra (context) - Stetter - 1996
3
Challenges of symbolic computation: May favorite open proble.. (context) - Kaltofen
3
UMFPACK Unsymmetric-pattern Multifrontal Package (context) - Timothy, Davis - 1998
3
GNU Multiple Precision Floating-Point Reliable Library (context) - Zimmermann - 1999
3
Roldan Pozo and Andrew Lumsdaine Karin (context) - Pozo, Karin et al. - 1996
3
ber Spurfunktionen bei vollst#ndigen Durschnitten (context) - Scheja, Storch - 1975
3
rale des #quations Alg#briques (context) - zout, orie
2
thodes matricielles pour les syst#mes d'#quations polynomial.. (context) - Ruatta - 1999
2
The alp reference manual (context) - Mourrain, Prieto - 2000
2
ratifs pour la r#solution de syst#mes polynomiaux (context) - Cardinal, gorithmes - 1993
2
Sur la complexit# du th#or#me des z#ros (context) - Fitchas, Giusti et al. - 1993
2
Eoeective Bezout identities in Q[z 1 ; : : : ; z n (context) - Berenstein, Yger - 1991
Documents on the same site (http://www-sop.inria.fr/galaad/stages/arch.html): More
Generalized Eigenvector Problem and Its Applications - Ong (2001)
(Correct)
Matrix Perturbation Theory in Distance Geometry - Nikitopoulos (1999)
(Correct)
Experimenting with the Curved Kernel - Kakargias (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC