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 20 of 1566 for “"polynomial"”.
-
The roots of polynomial equations
Not available
-
Orthosymmetric Maps And Polynomial Valuations
… a characterization of orthogonally additive polynomials on vector lattices as orthosymmetric multilinear maps. Our proof avoids partitionaly orthosymmetric maps and results that represent orthogonally additive polynomials as linear maps on a power. We also prove band characterizations for …
-
On residues of polynomial sequences
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-27T22:00:43Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Wittrig_Aaron.tex: 67295 bytes, checksum: fce3243cf10a10cc946856c8090cce40 (MD5) Wittrig_Aaron.pdf: 5557790 bytes, …
-
Polynomial ideals in algebraic complexity
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
-
Polynomial Identities on Algebras with Actions
… a Lie-Jordan-grading. Lastly, we call certain H-polynomials in the free associative H-algebra essential, and show that, if an (associative) H-algebra A satisfies an essential H-identity of degree d, then A satisfies an ordinary identity of bounded degree. Furthermore, in the case when H is …
-
The Multivariable Alexander Polynomial on Tangles
The multivariable Alexander polynomial (MVA) is a classical invariant of knots and links. We give an extension to regular virtual knots which has simple versions of many of the relations known to hold for the classical invariant. By following the previous proofs that the MVA is of finite type we …
-
Polynomial-Based Methods for Time-Integration
… framework that is based on interpolating polynomials, and the second extends exponential integration to the spectral deferred correction framework. Both parts discuss time integration methods that can be derived without solving nonlinear order conditions. In part I, we introduce a …
-
Measures Of Concordance Of Polynomial Type
A measure of concordance, $\kappa$, is of polynomial type if and only if $\kappa (tA+(1-t)B)$ is a polynomial in $t$ where $A$ and $B$ are 2-copulas. The degree of such a type of measure of concordance is simply the highest degree of the polynomial associated with $\kappa$. In previous work [2], …
-
Algorithmic enhancements to polynomial matrix factorisations
… decomposition (EVD) to parahermitian Laurent polynomial matrices - named the polynomial matrix EVD (PEVD) - has proven to be a useful tool for the decomposition of spacetime covariance matrices and their associated cross-spectral density matrices. Existing PEVD methods typically operate in the …
-
Polynomial Optimization and the Moment Problem
… We are interested in the moment problem with polynomial data and its relation to real algebra and real algebraic geometry. In this direction, we consider two different variants of moment problem. The first variant is the global polynomial optimization problem, i.e., finding the minimum of a …
-
New Techniques for Polynomial System Solving
Since any encryption map may be viewed as a polynomial map between finite dimensional vector spaces over finite fields, the security of a cryptosystem can be examined by studying the difficulty of solving large systems of multivariate polynomial equations. Therefore, algebraic attacks lead to the …
-
Polynomial Surface Models for Computer Vision
Finally, we present several extensions to our approach to make more accurate models and expand the set of potential applications, and we discuss a number of related problems yet to be solved.
-
Polynomial Preconditioning for Conjugate Gradient Methods
… is needed. In this thesis we examine the use of polynomial preconditioning in CG methods for both hermitian positive definite and indefinite matrices. Such preconditioners are easy to employ and well-suited to vector and/or parallel architectures.
-
Almost Primes Generated by a Polynomial
Made available in DSpace on 2014-12-05T21:50:25Z (GMT). No. of bitstreams: 1 6402927.pdf: 1055669 bytes, checksum: 34402c3cb83b70229758c77540bf0b8d (MD5) Previous issue date: 1963
-
Polynomial-time Martin-Lof type theory
Fragments of extensional Martin-Lof type theory without universes, $ML\sb0,$ are introduced that conservatively extend S. A. Cook and A. Urquhart's $IPV\sp\omega.$ A model for these restricted theories is obtained by interpretation in Feferman's theory APP of operators, a natural model of which is …
-
Chaos control using local polynomial approximation
… of chaos control was [CCdF99], in which a polynomial model is used. This dissertation proposes using local Taylor polynomial models as a basis for chaos control.
-
Polynomial policies in supply chain networks
… stages in time. We investigate the class of polynomial policies, where the control policy is directly parametrized polynomially in the observed uncertainties of previous stages. We use sum-of-square relaxations to reformulate the problem into a single semidefinite optimization problem for a …
-
Polynomial decomposition algorithms in signal processing
Polynomial decomposition has attracted considerable attention in computational mathematics. In general, the field identifies polynomials f(x) and g(x) such that their composition f(g(x)) equals or approximates a given polynomial h(x). Despite potentially promising applications, polynomial …
-
On The Parallelization Of Integer Polynomial Multiplication
… and reducing overheads in the implementations. Polynomial multiplication is at the core of many algorithms in symbolic computation such as real root isolation which will be our main application for now. In this thesis, we first investigate the multiplication of dense univariate polynomials with …
Page 1 of 79