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 8 of 8 for “"Polynomial Algebra"”.

  1. Hybrid Symbolic-Numeric Computing in Linear and Polynomial Algebra

    … methods for solving problems in linear and polynomial algebra. We mainly address the approximate GCD problem for polynomials, and problems related to parametric and polynomial matrices. For symbolic methods, our main concern is their complexity and for the numerical methods we are more …

    uwo Repository record for Hybrid Symbolic-Numeric Computing in Linear and Polynomial Algebra (opens in a new tab)

  2. Deformation complexes of algebraic operads and their applications

    … diagrams U: V -> W, where V, W are Cobar(C)-algebras, and U is an infinity-morphism. We then investigate the deformation complexes of Cyl(C) and Cobar(C). Our main result is that the restriction maps between between the deformation complexes Der'(Cyl(C)) and Der'(Cobar(C)) are homotopic …

    temple Repository record for Deformation complexes of algebraic operads and their applications (opens in a new tab)

  3. APPROXIMATE GROBNER BASES A BACKWARDS APPROACH

    … the Grobner basis of an approximate polynomial system. The Grobner basis of a polynomial system is arguably the most fundamental object of exact computation polynomial algebra, as it answers many of the important questions of commutative algebra, such as ideal membership and …

    uwo Repository record for APPROXIMATE GROBNER BASES A BACKWARDS APPROACH (opens in a new tab)

  4. Efficient Algorithms and Parallel Implementations for Power Series Multiplication

    … in C++ and integrated in the BPAS (Basic Polynomial Algebra Subprograms) library. To parallelize the implementations, we use a thread pool with a work-stealing scheduler using modern C++ multithreading techniques. The performance results, comparing the execution times of various algorithms …

    uwo Repository record for Efficient Algorithms and Parallel Implementations for Power Series Multiplication (opens in a new tab)

  5. Torsors over Simplicial Schemes

    … space BGL_n of the general linear group is a polynomial algebra over the motivic cohomology of k; we give a proof that takes advantage of this theory of torsors over simplicial schemes. Finally, using the work of Vistoli, we prove that, working over the complex numbers, the map from the Chow …

    uwo Repository record for Torsors over Simplicial Schemes (opens in a new tab)

  6. The overconvergent de Rham-Witt complex

    … which is finite, tale over a localization of a polynomial algebra. For these particular affines, we decompose ... into an integral part and a fractional part and then show that the integral part is isomorphic to the Monsky-Washnitzer complex and that the fractional part is acyclic. We deduce our …

    mit Repository record for The overconvergent de Rham-Witt complex (opens in a new tab)

  7. Algorithms and Orders for Finding Noncummutative Gröbner Bases

    … for computing Gröbner bases in noncommutative algebras is considered. Gröbner bases are an important tool that make many problems in polynomial algebra computationally tractable. However, the computation of Gröbner bases is expensive, and in noncommutative algebras is not guaranteed to …

    vt Repository record for Algorithms and Orders for Finding Noncummutative Gröbner Bases (opens in a new tab)

  8. The Algebra of Systems Biology

    … and software available. This work focuses on how algebra can contribute to answer questions arising from systems biology.

    vt Repository record for The Algebra of Systems Biology (opens in a new tab)