Search for dissertations about: "Polynomial methods"

Showing result 1 - 5 of 104 swedish dissertations containing the words Polynomial methods.

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

    University dissertation from Uppsala : Acta Universitatis Upsaliensis

    Author : Per Pettersson; Jan Nordström; Gianluca Iaccarino; Gunilla Kreiss; Rémi Abgrall; [2013]
    Keywords : 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;

    Abstract : 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. READ MORE

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

    University dissertation from Uppsala : Acta Universitatis Upsaliensis

    Author : Per Pettersson; Jan Nordström; Gianluca Iaccarino; Gunilla Kreiss; Rémi Abgrall; [2013]
    Keywords : 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;

    Abstract : 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. READ MORE

  3. 3. Constructing Algorithms for Constraint Satisfaction and Related Problems Methods and Applications

    University dissertation from Institutionen för datavetenskap

    Author : Ola Angelsmark; Peter Jonsson; Brahim Hnich; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Abstract : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. READ MORE

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

    University dissertation from Matematiska institutionen

    Author : Peter Broström; Michal Pióro; [2006]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Telecommunication; OSPF; LP-duality; Polynomial methods; MATHEMATICS; MATEMATIK;

    Abstract : 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. READ MORE

  5. 5. Initialization Methods for System Identification

    University dissertation from Linköping : Linköping University Electronic Press

    Author : Christian Lyzell; Lennart Ljung; Martin Enqvist; Magnus Jansson; [2009]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; System identification; Initialization methods; Regressor selection; Identifiability; TECHNOLOGY Information technology Automatic control; TEKNIKVETENSKAP Informationsteknik Reglerteknik;

    Abstract : In the system identification community a popular framework for the problem of estimating a parametrized model structure given a sequence of input and output pairs is given by the prediction-error method. This method tries to find the parameters which maximize the prediction capability of the corresponding model via the minimization of some chosen cost function that depends on the prediction error. READ MORE