<p>Traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving traffic problems is therefore of great interest for traffic planners allover the world. </p><p>This thesis concerns solving the fixed demand traffic assignment problem (TAP) on a number of different transportation test networks. TAP is solved using the Frank-Wolfe algorithm and the shortest path problems that arise as subproblems to the Frank-Wolfe algorithm are solved using the network simplex algorithm. We evaluate how a number of existing pricing strategies to the network simplex algorithm performs with TAP. We also construct a new efficient pricing strategy, the Bucket Pricing Strategy, inspired by the heap implementation of Dijkstra's method for shortest path problems. This pricing strategy is, together with the actual use of the network simplex algorithm, the main result of the thesis and the pricing strategy is designed to take advantage of the special structure of TAP. In addition to performing tests on the conventional Frank-Wolfe algorithm, we also test how the different pricing strategies perform on Frank-Wolfe algorithms using conjugate and bi-conjugate search directions. </p><p>These test results show that the updating shortest path calculations obtained by using the network simplex outperforms the non-updating Frank-Wolfe algorithms. Comparisons with Bar-Gera's OBA show that our implementation, especially together with the bucket pricing strategy, also outperforms this algorithm for relative gaps down to 10E-6.</p>

In this thesis study, a least-squares finite element method (LSFEM) based conjugate heat transfer solver was developed. In the mentioned solver, fluid flow and heat transfer computations were performed separately. This means that the calculated velocity values in the flow calculation part were exported to the heat transfer part to be used in the convective part of the energy equation. Incompressible Navier-Stokes equations were used in the flow simulations. In conjugate heat transfer computations, it is required to calculate the heat transfer in both flow field and solid region. In this study, conjugate behavior was accomplished in a fully coupled manner, i.e., energy equation for fluid and solid regions was solved simultaneously and no boundary conditions were defined on the fluid-solid interface. To assure that the developed solver works properly, lid driven cavity flow, backward facing step flow and thermally driven cavity flow problems were simulated in three dimensions and the findings compared well with the available data from the literature. Couette flow and thermally driven cavity flow with conjugate heat transfer in two dimensions were modeled to further validate the solver. Finally, a microchannel conjugate heat transfer problem was simulated. In the flow solution part of the microchannel problem, conservation of mass was not achieved. This problem was expected since the LSFEM has problems related to mass conservation especially in high aspect ratio channels. In order to overcome the mentioned problem, weight of continuity equation was increased by multiplying it with a constant. Weighting worked for the microchannel problem and the mass conservation issue was resolved. Obtained results for microchannel heat transfer problem were in good agreement in general with the previous experimental and numerical works. In the first computations with the solver / quadrilateral and triangular elements for two dimensional problems, hexagonal and tetrahedron elements for three dimensional problems were tried. However, since only the quadrilateral and hexagonal elements gave satisfactory results, they were used in all the above mentioned simulations.

The present study considers the numerical simulation of the different flow characteristics involved in the conjugate heat transfer analysis of an internally cooled gas turbine blade. Conjugate simulations require full coupling of convective heat transfer in fluid regions to the heat diffusion in solid regions. Therefore, accurate prediction of heat transfer quantities on both external and internal surfaces has the uppermost importance and highly connected with the performance of the employed turbulence models. The complex flow on both surfaces of the internally cooled turbine blades is caused from the boundary layer laminar-to-turbulence transition, shock wave interaction with boundary layer, high streamline curvature and sequential flow separation. In order to discover the performances of different turbulence models on these flow types, analyses have been conducted on five different experimental studies each concerned with different flow and heat transfer characteristics. Each experimental study has been examined with four different turbulence models available in the commercial software (ANSYS FLUENT13.0) to decide most suitable RANS-based turbulence model. The Realizable k-&epsilon / model, Shear Stress Transport k-&omega / model, Reynolds Stress Model and V2-f model, which became increasingly popular during the last few years, have been used at the numerical simulations. According to conducted analyses, despite a few unreasonable predictions, in the majority of the numerical simulations, V2-f model outperforms other first-order turbulence models (Realizable k-&epsilon / and Shear Stress Transport k-&omega / ) in terms of accuracy and Reynolds Stress Model in terms of convergence.

In this thesis, optimization approaches for intensity-modulated radiation therapy are developed and evaluated with focus on numerical efficiency and treatment delivery aspects. The first two papers deal with strategies for solving fluence map optimization problems efficiently while avoiding solutions with jagged fluence profiles. The last two papers concern optimization of step-and-shoot parameters with emphasis on generating treatment plans that can be delivered efficiently and accurately. In the first paper, the problem dimension of a fluence map optimization problem is reduced through a spectral decomposition of the Hessian of the objective function. The weights of the eigenvectors corresponding to the p largest eigenvalues are introduced as optimization variables, and the impact on the solution of varying p is studied. Including only a few eigenvector weights results in faster initial decrease of the objective value, but with an inferior solution, compared to optimization of the bixel weights. An approach combining eigenvector weights and bixel weights produces improved solutions, but at the expense of the pre-computational time for the spectral decomposition. So-called iterative regularization is performed on fluence map optimization problems in the second paper. The idea is to find regular solutions by utilizing an optimization method that is able to find near-optimal solutions with non-jagged fluence profiles in few iterations. The suitability of a quasi-Newton sequential quadratic programming method is demonstrated by comparing the treatment quality of deliverable step-and-shoot plans, generated through leaf sequencing with a fixed number of segments, for different number of bixel-weight iterations. A conclusion is that over-optimization of the fluence map optimization problem prior to leaf sequencing should be avoided. An approach for dynamically generating multileaf collimator segments using a column generation approach combined with optimization of segment shapes and weights is presented in the third paper. Numerical results demonstrate that the adjustment of leaf positions improves the plan quality and that satisfactory treatment plans are found with few segments. The method provides a tool for exploring the trade-off between plan quality and treatment complexity by generating a sequence of deliverable plans of increasing quality. The final paper is devoted to understanding the ability of the column generation approach in the third paper to find near-optimal solutions with very few columns compared to the problem dimension. The impact of different restrictions on the generated columns is studied, both in terms of numerical behaviour and convergence properties. A bound on the two-norm of the columns results in the conjugate-gradient method. Numerical results indicate that the appealing properties of the conjugate-gradient method on ill-conditioned problems are inherited in the column generation approach of the third paper. / QC 20100709

This thesis contributes to the field of Gaussian Graphical Models by exploring either numerically or theoretically various topics of Bayesian Methods in Gaussian Graphical Models and by providing a number of interesting results, the further exploration of which would be promising, pointing to numerous future research directions. Gaussian Graphical Models are statistical methods for the investigation and representation of interdependencies between components of continuous random vectors. This thesis aims to investigate some issues related to the application of Bayesian methods for Gaussian Graphical Models. We adopt the popular $G$-Wishart conjugate prior $W_G(\delta,D)$ for the precision matrix. We propose an efficient sampling method for the $G$-Wishart distribution based on the Metropolis Hastings algorithm and show its validity through a number of numerical experiments. We show that this method can be easily used to estimate the Deviance Information Criterion, providing a computationally inexpensive approach for model selection. In addition, we look at the marginal likelihood of a graphical model given a set of data. This is proportional to the ratio of the posterior over the prior normalizing constant. We explore methods for the estimation of this ratio, focusing primarily on applying the Monte Carlo simulation method of path sampling. We also explore numerically the effect of the completion of the incomplete matrix $D^{\mathcal{V}}$, hyperparameter of the $G$-Wishart distribution, for the estimation of the normalizing constant. We also derive a series of exact and approximate expressions for the Bayes Factor between two graphs that differ by one edge. A new theoretical result regarding the limit of the normalizing constant multiplied by the hyperparameter $\delta$ is given and its implications to the validity of an improper prior and of the subsequent Bayes Factor are discussed.

There is a growing demand for the high quality TV programs such as High Definition TV (HDTV). The CATV network is often a suitable solution to address this demand using a CATV modem delivering high data rate digital signals in a cost effective manner, thereby, utilizing a complex digital modulation scheme is inevitable. Exploiting complex modulation schemes, entails a more sophisticated modulator and distribution system with much tighter tolerances. However, there are always distortions introduced to the modulated signal in the modulator degrading signal quality.<p> In this research, the effect of distortions introduced by the RF band pass filter in the modulator will be considered which cause degradations on the quality of the output Quadrature Amplitude Modulated (QAM) signal. Since the RF filter's amplitude/group delay distortions are not symmetrical in the frequency domain, once translated into the base band they have a complex effect on the QAM signal. Using Matlab, the degradation effects of these distortions on the QAM signal such as Bit Error Rate (BER) is investigated.<p> In order to compensate for the effects of the RF filter distortions, two different methods are proposed. In the first method, a complex base band compensation filter is placed after the pulse shaping filter (SRRC). The coefficients of this complex filter are determined using an optimization algorithm developed during this research. The second approach, uses a pre-equalizer in the form of a Feed Forward FIR structure placed before the pulse shaping filter (SRRC). The coefficients of this pre-equalizer are determined using the equalization algorithm employed in a test receiver, with its tap weights generating the inverse response of the RF filter. The compensation of RF filter distortions in base band, in turn, improves the QAM signal parameters such as Modulation Error Ratio (MER). Finally, the MER of the modulated QAM signal before and after the base band compensation is compared between the two methods, showing a significant enhancement in the RF modulator performance.

Traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving traffic problems is therefore of great interest for traffic planners allover the world. This thesis concerns solving the fixed demand traffic assignment problem (TAP) on a number of different transportation test networks. TAP is solved using the Frank-Wolfe algorithm and the shortest path problems that arise as subproblems to the Frank-Wolfe algorithm are solved using the network simplex algorithm. We evaluate how a number of existing pricing strategies to the network simplex algorithm performs with TAP. We also construct a new efficient pricing strategy, the Bucket Pricing Strategy, inspired by the heap implementation of Dijkstra's method for shortest path problems. This pricing strategy is, together with the actual use of the network simplex algorithm, the main result of the thesis and the pricing strategy is designed to take advantage of the special structure of TAP. In addition to performing tests on the conventional Frank-Wolfe algorithm, we also test how the different pricing strategies perform on Frank-Wolfe algorithms using conjugate and bi-conjugate search directions. These test results show that the updating shortest path calculations obtained by using the network simplex outperforms the non-updating Frank-Wolfe algorithms. Comparisons with Bar-Gera's OBA show that our implementation, especially together with the bucket pricing strategy, also outperforms this algorithm for relative gaps down to 10E-6.

This thesis contributes to the field of Gaussian Graphical Models by exploring either numerically or theoretically various topics of Bayesian Methods in Gaussian Graphical Models and by providing a number of interesting results, the further exploration of which would be promising, pointing to numerous future research directions. Gaussian Graphical Models are statistical methods for the investigation and representation of interdependencies between components of continuous random vectors. This thesis aims to investigate some issues related to the application of Bayesian methods for Gaussian Graphical Models. We adopt the popular $G$-Wishart conjugate prior $W_G(\delta,D)$ for the precision matrix. We propose an efficient sampling method for the $G$-Wishart distribution based on the Metropolis Hastings algorithm and show its validity through a number of numerical experiments. We show that this method can be easily used to estimate the Deviance Information Criterion, providing a computationally inexpensive approach for model selection. In addition, we look at the marginal likelihood of a graphical model given a set of data. This is proportional to the ratio of the posterior over the prior normalizing constant. We explore methods for the estimation of this ratio, focusing primarily on applying the Monte Carlo simulation method of path sampling. We also explore numerically the effect of the completion of the incomplete matrix $D^{\mathcal{V}}$, hyperparameter of the $G$-Wishart distribution, for the estimation of the normalizing constant. We also derive a series of exact and approximate expressions for the Bayes Factor between two graphs that differ by one edge. A new theoretical result regarding the limit of the normalizing constant multiplied by the hyperparameter $\delta$ is given and its implications to the validity of an improper prior and of the subsequent Bayes Factor are discussed.

This thesis concerns the development of novel feasible direction type algorithms for constrained nonlinear optimization. The new algorithms are based upon enhancements of the search direction determination and the line search steps. The Frank-Wolfe method is popular for solving certain structured linearly constrained nonlinear problems, although its rate of convergence is often poor. We develop improved Frank--Wolfe type algorithms based on conjugate directions. In the conjugate direction Frank-Wolfe method a line search is performed along a direction which is conjugate to the previous one with respect to the Hessian matrix of the objective. A further refinement of this method is derived by applying conjugation with respect to the last two directions, instead of only the last one. The new methods are applied to the single-class user traffic equilibrium problem, the multi-class user traffic equilibrium problem under social marginal cost pricing, and the stochastic transportation problem. In a limited set of computational tests the algorithms turn out to be quite efficient. Additionally, a feasible direction method with multi-dimensional search for the stochastic transportation problem is developed. We also derive a novel sequential linear programming algorithm for general constrained nonlinear optimization problems, with the intention of being able to attack problems with large numbers of variables and constraints. The algorithm is based on inner approximations of both the primal and the dual spaces, which yields a method combining column and constraint generation in the primal space. / The articles are note published due to copyright rextrictions.

This master thesis was provided by Scania AB. The objective of this thesis was to modify an application in the free Computational Fluid Dynamics software OpenFOAM to be able to handle spray and wall film modeling of a Urea Water Solution together with Conjugate Heat Transfer. The basic purpose is to widen the knowledge of the vaporization process of a Urea Water Solution in the exhaust gas after treatment system for a diesel engine by using OpenFOAM. First, urea has been modeled as a very viscous liquid at low temperature to mimic the solidication process of urea. Second, the development of the new application has been done. At last, test simulations of a simple test case are performed with the new application. The results are then compared with simplied hand calculations to verify a correct behavior of certain exposed source terms. The new application is working properly for the test case but to ensure the reliability, the results need to be compared with another Computational Fluid Dynamics software or more preferable, real experiments. For more advanced geometries, the continued development presented last in this thesis is highly recommended to follow.