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 2 of 2 for “"Approximate GCD"”.

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

    … 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 concerned about their stability. The thesis …

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

  2. ERES Methodology and Approximate Algebraic Computations

    The area of approximate algebraic computations is a fast growing area in modern computer algebra which has attracted many researchers in recent years. Amongst the various algebraic computations, the computation of the Greatest Common Divisor (GCD) and the Least Common Multiple (LCM) of a set of …

    city-london Repository record for ERES Methodology and Approximate Algebraic Computations (opens in a new tab)