Sökning: "numerical algebraic geometry"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden numerical algebraic geometry.

  1. 1. Topics in Computational Algebraic Geometry and Deformation Quantization

    Författare :Christine Jost; Sandra Di Rocco; Boris Shapiro; Gregory G. Smith; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Segre classes; Chern-Schwartz-MacPherson classes; topological Euler characteristic; computational algebraic geometry; numerical algebraic geometry; numerical homotopy methods; deformation quantization; polyvector fields; Fedosov quantization; Grothendieck-Teichmüller group; Mathematics; matematik;

    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

  3. 2. Topological and geometrical methods in data analysis

    Författare :Oliver Gäfvert; Sandra di Rocco; Henry Schenck; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; multiparameter persistent homology; computational algebraic geometry; algorithms; complexity; Mathematics; Matematik;

    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

  4. 3. Geometric Decompositions and Networks - Approximation Bounds and Algorithms

    Författare :Joachim Gudmundsson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer technology; Systems engineering; kontroll; system; Delaunay triangulation; Computational geometry; TSP with neighborhoods; geometric spanners; covering polygons; Computer science; numerical analysis; systems; control; numerisk analys; Datalogi; algebraisk topologi; algebraic topology; Geometry; Data- och systemvetenskap; Geometri;

    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. 4. Topics in computation, numerical methods and algebraic  geometry

    Författare :David Eklund; Sandra di Rocco; Wolfram Decker; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; Algebra och geometri;

    Sammanfattning : This thesis concerns computation and algebraic geometry. On the computational side we have focused on numerical homotopy methods. These procedures may be used to numerically solve systems of polynomial equations. The thesis contains four papers. LÄS MER

  7. 5. Geometric Models of Similarity

    Författare :Mikael Johannesson; Kognitionsvetenskap; []
    Nyckelord :HUMANIORA; HUMANITIES; symmetry; similarity; separable dimensions; prominence; multidimensional scaling; Minkowski metric; machine learning; integral dimensions; familiarity; geometric models; distance metric; asymmetry; conceptual spaces; Computer science; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Geometry; algebraic topology; Geometri; algebraisk topologi;

    Sammanfattning : This dissertation examines and discusses some phenomena related to the geometric representation of similarity. It takes its inspiration from the existing body of empirical research within the fields of perceptual and cognitive psychology, but also connects to certain areas of machine learning. LÄS MER