Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 98 for “"simplices"”.

  1. Sections of simplices and cylinders

    We investigate sections of simplices and generalized cylinders. We are interested in the volume of sections of these bodies with affine subspaces and give formulas and estimates for these volumes. For the regular n-simplex we state a general formula to compute the volume of the intersection with …

    cau-kiel Repository record for Sections of simplices and cylinders (opens in a new tab)

  2. Multidimensional Adaptive Quadrature Over Simplices

    … adaptive quadrature routines defined over simplices (MAQS). MAQS pro- vides an approximation to the integral of a function defined over the unit hypercube and provides an error estimate that is used to drive a global subdivision strategy. The quadrature estimate is based on Lagrangian …

    vt Repository record for Multidimensional Adaptive Quadrature Over Simplices (opens in a new tab)

  3. Concerning Triangulations of Products of Simplices

    … of triangulations of cartesian products of simplices, particularly in relation to their relevance in toric algebra and to their underlying product structure. The first chapter reports joint work with Samu Potka. The object of study is a class of homogeneous toric ideals called cut ideals of …

    qucosa-diss

  4. Minimal Volume K-Point Lattice D-Simplices

    … show that there can only be one such class of simplices with this property. Interestingly, this statement is not true for d = 2, and counterexamples are provided within.

    uiuc Repository record for Minimal Volume K-Point Lattice D-Simplices (opens in a new tab)

  5. Factoring over probability simplices : from theory to applications

    Non-negative matrix factorization (NMF) is a fundamental technique in modern data analysis. Its distinguishing characteristic—requiring non-negative factors—ensures that it models only additive components, producing interpretable parts-based representations. When augmented with sum-to-one …

    ubc Repository record for Factoring over probability simplices : from theory to applications (opens in a new tab) Download PDF for Factoring over probability simplices : from theory to applications (opens in a new tab)

  6. Origenes und die "Simplices". Theologie vor den Herausforderungen einfachen Glaubens

    … Gesamtwerk immer wieder mit den so genannten simplices auseinander, der Masse der einfachen und ungebildeten Christen, die seiner Theologie, insbesondere seiner Schriftauslegung, nicht folgen können oder wollen. Die Forschung der beiden letzten Jahrhunderte zeichnet in der Regel ein Bild …

    wurz-thes Repository record for Origenes und die "Simplices". Theologie vor den Herausforderungen einfachen Glaubens (opens in a new tab)

  7. Tight Polyhedral Representations of Discrete Sets Using Projections, Simplices, and Base-2 Expansions

    This research effort focuses on the acquisition of polyhedral outer-approximations to the convex hull of feasible solutions for mixed-integer linear and mixed-integer nonlinear programs. The goal is to produce desirable formulations that have superior size and/or relaxation strength. These two …

    clemson Repository record for Tight Polyhedral Representations of Discrete Sets Using Projections, Simplices, and Base-2 Expansions (opens in a new tab)

  8. Nonconvex optimization algorithm with a new Bi-criteria selection of potential simplices using an estimate of Lipschitz constant /

    … is proposed, which is based on Disimpl (DIviding SIMPLices) algorithms. The novelty of the proposed algorithm is that a single estimate of the Lipschitz constant is used instead of a set to select potential simplices for division. Experimental analysis is conducted and the competitiveness of the …

    vilnius Repository record for Nonconvex optimization algorithm with a new Bi-criteria selection of potential simplices using an estimate of Lipschitz constant / (opens in a new tab)

  9. Provably Stable Discontinuous Spectral-Element Methods with the Summation-by-Parts Property: Unified Matrix Analysis and Efficient Tensor-Product Formulations on Curved Simplices

    Discontinuous spectral-element methods (DSEMs) provide a flexible high-order spatial discretization approach for time-dependent conservation laws, but are traditionally regarded as lacking robustness relative to conventional second-order numerical methods for such partial differential equations. …

    toronto-retro Repository record for Provably Stable Discontinuous Spectral-Element Methods with the Summation-by-Parts Property: Unified Matrix Analysis and Efficient Tensor-Product Formulations on Curved Simplices (opens in a new tab)

  10. Constructing Regular Triangulation via Local Transformations: Theoretical and Practical Advances

    … structures via operations that act on some simplices of a geometric structure. Such a transformation is termed local transformation as an operation utilizes only information local to some neighboring simplices but nothing about attributes or configurations global in nature to the structure. …

    nus Repository record for Constructing Regular Triangulation via Local Transformations: Theoretical and Practical Advances (opens in a new tab) Download file for Constructing Regular Triangulation via Local Transformations: Theoretical and Practical Advances (opens in a new tab)

  11. Vector difference calculus.

    … formalism is developed in which geometrical simplices can be used as a basis for vector as well as scalar quantities. The space of p-forms at a point in the theory of differential forms is replaced by the lattice vertex and the p-dimensional geometrical simplices which contain it. These …

    nodak Repository record for Vector difference calculus. (opens in a new tab)

  12. Classifying simplicial dissections of convex polyhedra with symmetry

    … is a decomposition into a finite number of 3-simplices such that any two intersect in a common face or are disjoint. A simplicial dissection is a decomposition into a finite number of 3-simplices such that no two share an interior point. We present an algorithm to classify the simplicial …

    colostate Repository record for Classifying simplicial dissections of convex polyhedra with symmetry (opens in a new tab)

  13. Pedestrian pose estimation using near set theory

    … concept of optical vortex nerve. Energy, area, 0-simplices (vertices), 1-simplices (edges) and 2-simplices (triangles) are some of the key features observed in this thesis. Finally, I explored pedestrian pose estimation as an application for applying all the concepts developed in this document in …

    manitoba Repository record for Pedestrian pose estimation using near set theory (opens in a new tab)

  14. Diamond-based models for scientific visualization

    … simplex bisection operator, which bisects simplices (e.g. line segments, triangles, tetrahedra) along the midpoint of a predetermined edge. Regular simplex bisection produces adaptive simplicial meshes of high geometric quality, while simplifying the extraction of crack-free, or conforming, …

    maryland Repository record for Diamond-based models for scientific visualization (opens in a new tab)

  15. Temporal multiple moving objects recognition using shape-based descriptor matching

    … constructing vortex nerves using vertex termed 0-simplices, edges termed 1-simplices, and triangles termed 2-simplices in the foregrounds, we can derive shape-based spatial-temporal descriptor sets for each moving object. Moreover, I then employed the shape descriptor sets for shape matching to …

    manitoba Repository record for Temporal multiple moving objects recognition using shape-based descriptor matching (opens in a new tab)

  16. Mobius Structures, Einstein Metrics, and Discrete Conformal Variations on Piecewise Flat Two and Three Dimensional Manifolds

    Spherical, Euclidean, and hyperbolic simplices can be characterized by the dihedral angles on their codimension-two faces. These characterizations analyze the Gram matrix, a matrix with entries given by cosines of dihedral angles. Hyperideal hyperbolic simplices are non-compact generalizations of …

    arizona-thes Repository record for Mobius Structures, Einstein Metrics, and Discrete Conformal Variations on Piecewise Flat Two and Three Dimensional Manifolds (opens in a new tab)

  17. Neiškiliojo optimizavimo algoritmas su nauju bikriteriniu potencialiųjų simpleksų išrinkimu naudojant Lipšico konstantos įvertį /

    … is proposed, which is based on Disimpl (DIviding SIMPLices) algorithms. The novelty of the proposed algorithm is that a single estimate of the Lipschitz constant is used instead of a set to select potential simplices for division. Experimental analysis is conducted and the competitiveness of the …

    vilnius Repository record for Neiškiliojo optimizavimo algoritmas su nauju bikriteriniu potencialiųjų simpleksų išrinkimu naudojant Lipšico konstantos įvertį / (opens in a new tab)

  18. Homological Illusions of Persistence and Stability

    … the persistence pairing from an ordering of the simplices in a triangulation and takes worst-case time cubic in the number of simplices. We describe how to maintain the pairing in linear time per transposition of consecutive simplices. A side effect of the update algorithm is an elementary proof …

    duke Repository record for Homological Illusions of Persistence and Stability (opens in a new tab)

  19. Sullivan’s theory of minimal models

    … forms in the barycentric coordinates of the simplices of K which agree as differential forms on common faces. The associated de Rham cohomology algebra is isomorphic to the simplicial cohomology of K with Q-coefficients by integration of forms over simplices. Given a 1-connected DGA, A, the …

    ubc Repository record for Sullivan’s theory of minimal models (opens in a new tab) Download PDF for Sullivan’s theory of minimal models (opens in a new tab)

Page 1 of 5