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 7 of 7 for “"Polynomial Systems of Equations"”.

  1. POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations

    … for finding all the isolated solutions to polynomial systems of equations. After many years of development, homotopy path trackers based on probability-one homotopy methods are reliable and fast. Now, theoretical advances reducing the number of homotopy paths that must be tracked, and in …

    vt Repository record for POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations (opens in a new tab)

  2. Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis

    … contains algorithms for solving linear and polynomial systems of equations over GF(2). The objective is to provide fast and exact tools for algebraic cryptanalysis and other applications. Accordingly, it is divided into two parts. The first part deals with polynomial systems. Chapter 2 …

    maryland Repository record for Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis (opens in a new tab)

  3. Αριθμητική επίλυση μη γραμμικών παραμετρικών εξισώσεων και ολική βελτιστοποίηση με διαστηματική ανάλυση

    In this dissertation the problem of finding reliably and with certainty all the zeros a parameterized equation f(x,fp1) = 0, of a continuously differentiate function f is considered, where [p] is an interval vector describing all the parameters of the Equation, which are formed with interval …

    greece Repository record for Αριθμητική επίλυση μη γραμμικών παραμετρικών εξισώσεων και ολική βελτιστοποίηση με διαστηματική ανάλυση (opens in a new tab)

  4. Hyper-gates Framework for Straight-line Programs and Their Applications in Nonlinear Algebra

    … they are branchless and do not consist of any conditionals, avoiding thread divergence, high memory consumption, and incorrect solutions due to guessing caused by branching on hardware. SLPs can enable an algorithm to be mapped as a predictable data-flow circuit, enabling massive …

    gatech Repository record for Hyper-gates Framework for Straight-line Programs and Their Applications in Nonlinear Algebra (opens in a new tab)

  5. Applications of monodromy in solving polynomial systems

    Polynomial systems of equations that occur in applications frequently have a special structure. Part of that structure can be captured by an associated Galois/monodromy group. This makes numerical homotopy continuation methods that exploit this monodromy action an attractive choice for solving …

    gatech Repository record for Applications of monodromy in solving polynomial systems (opens in a new tab)

  6. Αναλλοίωτες μετρικές Einstein σε πολλαπλότητες Stiefel και συμπαγείς ομάδες Lie

    … g) is called Einstein if the Ricci tensor \Ric_g of the metric g satisfies the equation \Ric _g=\lambda g, for some real number \lambda. For the case of a Riemannian homogeneous space M=G/H, g), where G is a Lie group and H a closed subgroup of G, the metric g is called G-invariant if for all …

    greece Repository record for Αναλλοίωτες μετρικές Einstein σε πολλαπλότητες Stiefel και συμπαγείς ομάδες Lie (opens in a new tab)