Sökning: "Polynomial methods"

Visar resultat 1 - 5 av 123 avhandlingar innehållade orden Polynomial methods.

1. 1. 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

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

   Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

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

4. 3. 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

5. 4. Initialization Methods for System Identification

   Författare :Christian Lyzell; Lennart Ljung; Martin Enqvist; Magnus Jansson; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; System identification; Initialization methods; Regressor selection; Identifiability; Automatic control; Reglerteknik;

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

7. 5. Methods for Optimal Model Fitting and Sensor Calibration

   Författare :Erik Ask; Matematik LTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Model Fitting; Sensor Networks; Computer Vision; Polynomial Equations; Action Matrix Methods;

   Sammanfattning : The problem of fitting models to measured data has been studied extensively, not least in the field of computer vision. A central problem in this field is the difficulty in reliably find corresponding structures and points in different images, resulting in outlier data. LÄS MER