Search for dissertations about: "polynomial"
Showing result 1 - 5 of 329 swedish dissertations containing the word polynomial.
-
1. The Theory of Polynomial Functors
Abstract : Polynomial functors were introduced by Professors Eilenberg and Mac Lane in 1954, who used them to study certain homology rings. Strict polynomial functors were invented by Professors Friedlander and Suslin in 1997, in order to develop the theory of group schemes. READ MORE
-
2. The Symmetric Meixner-Pollaczek polynomials
Abstract : The Symmetric Meixner-Pollaczek polynomials are considered. We denote these polynomials in this thesis by pn(λ)(x) instead of the standard notation pn(λ) (x/2, π/2), where λ > 0. READ MORE
-
3. Polynomial Hulls and Envelopes of Holomorphy
Abstract : The notion of polynomial hulls of compact subsets of complex Euclidean space plays a crucial role for approximation of holomorphic functions by polynomials - a topic which has many applications. Despite an abstract characterization of polynomial hulls in terms of currents, given by Duval and Sibony, it is often very difficult even for special classes of sets to decide whether the polynomial hull is trivial (i. READ MORE
-
4. Causal MMSE Filters for Personal Audio : A Polynomial Matrix Approach
Abstract : This thesis is devoted to the study of synthesis of causal filters for generating personal sound zones. Personal sound zones, personal audio or personal sound is the theory and practice of steering sound in such a way that it is amplified in one region and suppressed in another. READ MORE
-
5. Perturbed Renewal Equations with Non-Polynomial Perturbations
Abstract : This thesis deals with a model of nonlinearly perturbed continuous-time renewal equation with nonpolynomial perturbations. The characteristics, namely the defect and moments, of the distribution function generating the renewal equation are assumed to have expansions with respect to a non-polynomial asymptotic scale: $\{\varphi_{\nn} (\varepsilon) =\varepsilon^{\nn \cdot \w}, \nn \in \mathbf{N}_0^k\}$ as $\varepsilon \to 0$, where $\mathbf{N}_0$ is the set of non-negative integers, $\mathbf{N}_0^k \equiv \mathbf{N}_0 \times \cdots \times \mathbf{N}_0, 1\leq k . READ MORE