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 17 of 17 for “"roots of polynomials"”.
-
Roots of polynomials and their connections
In the study of mathematics, one of the most useful, relevant topics explored in secondary mathematics remains the zeros of polynomials. This paper will present various ways to explore this topic while preserving the fundamental concept as a whole. In addition, this paper will reveal some distinct …
-
Iterative methods for roots of polynomials
… years. In chapter two, we give a brief survey of some zero finding methods. These include Bairstow's method, Bernoulli's method, Graeffe's root-squaring method, Müller's method, the Newton-Raphson method and the Jenkins-Traub and Laguerre methods. In chapter three, we look at the Laguerre …
-
A parallel algorithm for simple roots of polynomials
A method for finding simple roots of arbitrary polynomials based on divided differences is discussed. Theoretical background is presented for the case of simple roots. Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the …
-
Upper bounds on the values of the positive roots of polynomials
… new results on computing bounds on the values of the positive roots of polynomials. Bounding the roots of polynomials is an important sub-problem in many disciplines of scientific computing. Many numerical methods for finding roots of polynomials begin with an estimate of an upper bound on the …
-
Exact polynomial system solving for robust geometric computation
I describe an exact method for computing roots of a system of multivariate polynomials with rational coefficients, called the rational univariate reduction. This method enables performance of exact algebraic computation of coordinates of the roots of polynomials. In computational geometry, curves, …
-
Newton Polygons on p-adic Number Fields
This thesis offers a clear introduction to p-adic number fields, and the method of Newton polygons to approximate the size of roots of polynomials in the completion of the algebraic closure of p-adic number fields. Ostrowski's theorem is also proved herein. The thesis is intended to serve as an …
-
Understanding complex numbers and identifying complex roots graphically
This master’s report seeks to increase knowledge of complex numbers and how to identify complex roots graphically. The reader will obtain a greater understanding of the history of complex numbers, the definition of a complex number and a few of the field properties of complex numbers. Readers will …
-
Quantitative Aspects of Sums of Squares and Sparse Polynomial Systems
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are familiar with the notion of degree, but there are other ways to consider a polynomial: How many variables does it have? How many terms does it have? Considering the sparsity of a polynomial means we …
-
A Glance at Tropical Operations and Tropical Linear Algebra
… and linear algebra over the real numbers such as polynomials, roots of polynomials, lines, matrices and matrix operations, determinants, eigen values and eigen vectors would appear in tropical mathematics. It uses numerous computed examples to illustrate these concepts and explores the …
-
Generating Surfaces of Variable Eccentricity Within a Ray Tracer
… paper will discuss a method for finding real roots of polynomials [allowing us to create these surfaces]. First, we will give the reader a basic comprehension of the workings of a ray tracer, a general understanding of three dimensional polynomial surfaces, how this newly implemented root …
-
Heights and infinite algebraic extensions of the rationals
This dissertation contains a number of results on properties of infinite algebraic extensions of the rational field, all of which have a view toward the study of heights in diophantine geometry. We investigate whether subextensions of extensions generated by roots of polynomials of a given degree …
-
Implementation of a digital control system analysis program using the z-transform
… complex and includes a wide range of tools to aid the engineer. For discrete systems the z-transform is one such tool. This paper discusses the development and application of a computer program which utilizes the z-transform in the analysis of univariate, linear, time-invariant …
-
Multiplicative distance functions
… generalize Mahler’s measure to create the class of multiplicative distance functions on C[x]. These functions are uniquely determined by their action on the roots of polynomials. We find a simple asymptotic condition that determines which functions on C are induced by multiplicative distance …
-
Ultrametric Fewnomial Theory
… a non-archimedean absolute value. The main topic of this dissertation is to study roots of polynomials over such fields. If we have a univariate polynomial with coefficients in an ultrametric field and non-vanishing discriminant, then there is a bijection between the set of roots of the polynomial …
-
Complex Varieties as Minima
We will explore various numeric methods of finding roots of an analytic function over some open set of the complex plane. We will discuss a method of visually observing the roots, a gradient descent method for finding the roots of an analytic function, a gradient descent method for solving systems …
-
Mathematical Modeling and Computational Studies for Cell Signaling
… to mammals play a pivotal role in many aspects of cellular functions. The mating decision in yeast is a switch-like or bistability response that allows cells to filter out weak pheromone signals or avoiding improper mating when a mate is sufficiently close. In many cases, scaffold proteins are …
-
The structure of spaces of valuations and the local uniformization problem
The problem of resolution of singularities is a major problem in algebraic geometry. Local uniformization can be seen as its local version. For varieties over fields of characteristic zero, local uniformization was proved by Zariski in 1940 and resolution of singularities was proved by Hironaka in …