Sökning: "Polynomial operator"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden Polynomial operator.

  1. 1. The Symmetric Meixner-Pollaczek polynomials

    Författare :Tsehaye Araaya; Sten Kaijser; Svante Janson; Hjalmar Rosengren; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical analysis; Meixner-Pollaczek polynomial; Orthogonal polynomial; Polynomial operator; Inner product; Umbral calculus; Sheffer polynomial; Convolution type polynomial; Connection and linearization problem; 33C45; 05A40; 33D45; Matematisk analys; Mathematical analysis; Analys; matematik; Mathematics;

    Sammanfattning : 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. LÄS MER

  2. 2. On eigenvalues of the Schrödinger operator with a complex-valued polynomial potential

    Författare :Per Alexandersson; Boris Shapiro; Ilpo Laine; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; schroedinger; even spectral determinant polynomial potential eigenvalue; Mathematical analysis; Analys; Mathematics; matematik;

    Sammanfattning : In this thesis, we generalize a recent result of A. Eremenko and A. Gabrielov on irreducibility of the spectral discriminant for the Schroedinger equation with quartic potentials. LÄS MER

  3. 3. On Vertex Operator Algebras of Affine Type at Admissible Levels

    Författare :Thomas Edlund; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Vertex operator algebras; Kac-Moody algebras; Ore localization; Admissible levels; Singular vectors; Intertwining operators;

    Sammanfattning : The main purpose of this thesis is the study of the structure and representation theory of simple vertex operator algebras (VOAs) of affine type at admissible levels. To do this, it is crucial to obtain knowledge of the singular vectors which generate the maximal submodules, with respect to which these VOAs appear as irreducible quotients, and therefore a substantial part of the text is devoted to this matter. LÄS MER

  4. 4. Uncertainty Quantification and Numerical Methods for Conservation Laws

    Författare :Per Pettersson; Jan Nordström; Gianluca Iaccarino; Gunilla Kreiss; Rémi Abgrall; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; uncertainty quantification; polynomial chaos; stochastic Galerkin methods; conservation laws; hyperbolic problems; finite difference methods; finite volume methods; Beräkningsvetenskap med inriktning mot numerisk analys; Scientific Computing with specialization in Numerical Analysis;

    Sammanfattning : Conservation laws with uncertain initial and boundary conditions are approximated using a generalized polynomial chaos expansion approach where the solution is represented as a generalized Fourier series of stochastic basis functions, e.g. orthogonal polynomials or wavelets. LÄS MER

  5. 5. Optimization Models and Methods for Telecommunication Networks using OSPF

    Författare :Peter Broström; Michal Pióro; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Telecommunication; OSPF; LP-duality; Polynomial methods; MATHEMATICS; MATEMATIK;

    Sammanfattning : The routing in OSPF Telecommunication networks is determined by computing shortest paths with respect to link weights set by the network operator. All shortest paths to a destination are used by the routers when traffic is routed, and the routers split the traffic evenly when alternative shortest paths exist. LÄS MER