Sökning: "computational algebraic geometry"
Visar resultat 1 - 5 av 16 avhandlingar innehållade orden computational algebraic geometry.
1. Topics in Computational Algebraic Geometry and Deformation Quantization
Sammanfattning : This thesis consists of two parts, a first part on computations in algebraic geometry, and a second part on deformation quantization. More specifically, it is a collection of four papers. In the papers I, II and III, we present algorithms and an implementation for the computation of degrees of characteristic classes in algebraic geometry. LÄS MER
2. Topological and geometrical methods in data analysis
Sammanfattning : This thesis concerns two related data analysis pipelines, using topological and geometrical methods respectively, to extract relevant information. The first pipeline, referred to as the topological data analysis (TDA) pipeline, constructs a filtered simplicial complex on a given data set in order to describe its shape. LÄS MER
3. Admissible transformations and the group classification of Schrödinger equations
Sammanfattning : We study admissible transformations and solve group classification problems for various classes of linear and nonlinear Schrödinger equations with an arbitrary number n of space variables.The aim of the thesis is twofold. LÄS MER
4. Geometric Decompositions and Networks - Approximation Bounds and Algorithms
Sammanfattning : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. LÄS MER
5. Constructive Newton–Puiseux Theorem, Sheaf Model of the Separable Closure and Dynamic Evaluation
Sammanfattning : Computing the Puiseux expansions of a plane algebraic curve defined by an affine equation over an algebraically closed field is a an important algorithm in algebraic geometry. This is the so-called Newton–Puiseux Theorem. The termination of this algorithm, however, is usually justified by non-constructive means. LÄS MER
