Sökning: "Natural Sciences Mathematics Geometry"
Visar resultat 6 - 10 av 243 avhandlingar innehållade orden Natural Sciences Mathematics Geometry.
6. Positive vector bundles in complex and convex geometry
Sammanfattning : This thesis concerns various aspects of the geometry of holomorphic vector bundles and their analytical theory which all, vaguely speaking, are related to the notion of positive curvature in general, and L^2-methods for the dbar-equation in particular. The thesis contains four papers. LÄS MER
7. Geometry and Critical Configurations of Multiple Views
Sammanfattning : This thesis is concerned with one of the core problems in computer vision, namely to reconstruct a real world scene from several images of it. The interplay between the geometry of the scene, the cameras and the images is analyzed. LÄS MER
8. Waring-type problems for polynomials : Algebra meets Geometry
Sammanfattning : In the present thesis we analyze different types of additive decompositions of homogeneous polynomials. These problems are usually called Waring-type problems and their story go back to the mid-19th century and, recently, they received the attention of a large community of mathematicians and engineers due to several applications. LÄS MER
9. Theoretical and computational advances in small-angle x-ray scattering tensor tomography
Sammanfattning : The relationships between microscopic and macroscopic structures is a central topic of materials physics. Small-angle x-ray scattering (SAXS) is a powerful experimental technique for probing and mapping variations in electron density, given by the reciprocal space map, down to the nanometer scale in two dimensions. LÄS MER
10. 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