Nous utilisons des cookies pour améliorer votre expérience. Pour nous conformer à la nouvelle directive sur la vie privée, nous devons demander votre consentement à l’utilisation de ces cookies. En savoir plus.
Matrix Representations of Algebraic Varieties
Univ Europeenne - EAN : 9786131598104
Édition papier
EAN : 9786131598104
Paru le : 20 oct. 2011
39,00 €
36,97 €
Disponible
Pour connaître votre prix et commander, identifiez-vous
Notre engagement qualité
-
Livraison gratuite
en France sans minimum
de commande -
Manquants maintenus
en commande
automatiquement -
Un interlocuteur
unique pour toutes
vos commandes -
Toutes les licences
numériques du marché
au tarif éditeur -
Assistance téléphonique
personalisée sur le
numérique -
Service client
Du Lundi au vendredi
de 9h à 18h
- EAN13 : 9786131598104
- Réf. éditeur : 5392101
- Editeur : Univ Europeenne
- Date Parution : 20 oct. 2011
- Disponibilite : Disponible
- Barème de remise : NS
- Nombre de pages : 108
- Format : H:220 mm L:150 mm
- Poids : 177gr
- Interdit de retour : Retour interdit
- Résumé : In this book, we introduce and study a new implicit representation of rational curves of arbitrary dimensions and propose an implicit representation of rational hypersurfaces. Then, we illustrate the advantages of this matrix representation by addressing several important problems of Computer Aided Geometric Design (CAGD): The curve/curve, curve/surface and surface/surface intersection problems, the point-on-curve and inversion problems, the computation of singularities of rational curves. We also develop some symbolic/numeric algorithms to manipulate these new representations for example: the algorithm for extracting the regular part of a non square pencil of univariate polynomial matrices and bivariate polynomial matrices. In the appendix of this book we present an implementation of these methods in the computer algebra systems Mathemagix and Maple. In the last chapter, we describe an algorithm which, given a set of univariate polynomials $f_1,...,f_s$ returns a set of polynomials $u_1,...,u_s$ with prescribed degree-bounds such that the degree of $\gcd(f_1+u_1,...,f_s+u_s)$ is bounded below by a given degree assuming some genericity hypothesis.
- Biographie : I am a lecturer in the Department of Mathematics, Hanoi National University of Education, Vietnam. My research interests are algebra computer and computational Geometry. I received a BS and an MS in Math from Hanoi National University of Education in 2001 and 2005, respectively, and a PhD in applied Math from the University of Nice, France in 2011.
