Matrix Representations of Algebraic Varieties » książka
Matrix Representations of Algebraic Varieties
ISBN-13: 9786131598104 / Angielski / Miękka / 2018 / 112 str.
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 hypothes
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.
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
