Despite considerable uncertainties regarding the exact contribution of anthropogenic climate change to disaster risk, rising losses from extreme events have highlighted the need to comprehensively address climate-related risk. This requires linking climate adaptation to disaster risk management (DRM), leading to what has been broadly referred to as climate risk management (CRM). While this concept has received attention in debate, important gaps remain in terms of operationalizing it with applicable methods and tools for specific risks and decision-contexts. By developing and applying a methodological approach to CRM in the decision context of sovereign risk (flooding) in Austria we test the usefulness of CRM, and based on these insights, inform applications in other decision contexts. Our methodological approach builds on multiple lines of evidence and methods. These comprise of a broad stakeholder engagement process, empirical analysis of public budgets, and risk-focused economic modelling. We find that a CRM framework is able to inform instrumental as well as reflexive and participatory debate in practice. Due to the complex interaction of social-ecological systems with climate risks, and taking into account the likelihood of future contingent climate-related fiscal liabilities increasing substantially as a result of socioeconomic developments and climate change, we identify the need for advanced learning processes and iterative updates of CRM management plans. We suggest that strategies comprising a portfolio of policy measures to reduce and manage climate-related risks are particularly effective if they tailor individual instruments to the specific requirements of different risk layers. (authors' abstract)

This thesis studies the so-called “criticality problem”, an important generalised eigenvalue problem arising in neutron transport theory. The smallest positive real eigenvalue of the problem contains valuable information about the status of the fission chain reaction in the nuclear reactor (i.e. the criticality of the reactor), and thus plays an important role in the design and safety of nuclear power stations. Because of the practical importance, efficient numerical methods to solve the criticality problem are needed, and these are the focus of this thesis. In the theory we consider the time-independent neutron transport equation in the monoenergetic homogeneous case with isotropic scattering and vacuum boundary conditions. This is an unsymmetric integro-differential equation in 5 independent variables, modelling transport, scattering, and fission, where the dependent variable is the neutron angular flux. We show that, before discretisation, the nonsymmetric eigenproblem for the angular flux is equivalent to a related eigenproblem for the scalar flux, involving a symmetric positive definite weakly singular integral operator(in space only). Furthermore, we prove the existence of a simple smallest positive real eigenvalue with a corresponding eigenfunction that is strictly positive in the interior of the reactor. We discuss approaches to discretise the problem and present discretisations that preserve the underlying symmetry in the finite dimensional form. The thesis then describes methods for computing the criticality in nuclear reactors, i.e. the smallest positive real eigenvalue, which are applicable for quite general geometries and physics. In engineering practice the criticality problem is often solved iteratively, using some variant of the inverse power method. Because of the high dimension, matrix representations for the operators are often not available and the inner solves needed for the eigenvalue iteration are implemented by matrix-free inneriterations. This leads to inexact iterative methods for criticality computations, for which there appears to be no rigorous convergence theory. The fact that, under appropriate assumptions, the integro-differential eigenvalue problem possesses an underlying symmetry (in a space of reduced dimension) allows us to perform a systematic convergence analysis for inexact inverse iteration and related methods. In particular, this theory provides rather precise criteria on how accurate the inner solves need to be in order for the whole iterative method to converge. The theory is illustrated with numerical examples on several test problems of physical relevance, using GMRES as the inner solver. We also illustrate the use of Monte Carlo methods for the solution of neutron transport source problems as well as for the criticality problem. Links between the steps in the Monte Carlo process and the underlying mathematics are emphasised and numerical examples are given. Finally, we introduce an iterative scheme (the so-called “method of perturbation”) that is based on computing the difference between the solution of the problem of interest and the known solution of a base problem. This situation is very common in the design stages for nuclear reactors when different materials are tested, or the material properties change due to the burn-up of fissile material. We explore the relation ofthe method of perturbation to some variants of inverse iteration, which allows us to give convergence results for the method of perturbation. The theory shows that the method is guaranteed to converge if the perturbations are not too large and the inner problems are solved with sufficiently small tolerances. This helps to explain the divergence of the method of perturbation in some situations which we give numerical examples of. We also identify situations, and present examples, in which the method of perturbation achieves the same convergence rate as standard shifted inverse iteration. Throughout the thesis further numerical results are provided to support the theory.

The flow of blood in the human body is a very important component in un-derstanding a number of different ailments such as atherosclerosis and a falseaneurysm. In this thesis, we have utilized Poiseuille’s solution to Navier-Stokesequations with a Newtonian, incompressible fluid flowing laminar with zero ac-celeration in a pipe with non-flexible walls in order to study blood flow in anarterial tree. In order to study and simulate a larger arterial tree we have uti-lized a primitive building block, a bifurcation with one inlet and two outlets,joined together forming a tree. By prescribing an inlet flow and the pressureat every outlet at the bottom of the tree we have shown that we may solvethe system by fixed-point iteration, the Matlab functionfsolve, and Newton’smethod. This way of using primitive building blocks offers a flexible way to doanalysis as it makes it possible to easily change the shape of the tree as well asadding new building blocks such as a block that represents arteriosclerosis.

This research is examining one of the most dominant managerial methods used in development in the video game industry, Agile development. More particularly, the thesis examines a certain attribute of Agile development, that of iteration. The thesis will set to examine how iteration affects several layers of development during the production of a video game and whether it can be replaced by other managerial technics.As a result, the purpose of this thesis is to raise a different viewpoint against the Agile’s iteration. Furthermore, this thesis aims to contribute to the academic research by concentrating on the video game industry, an industry that is often neglected by the academia.The theoretical framework and literature review concentrate on concepts of Agile development, overworking, development cycle in video games, definitions of project success and project failures and creative process in video game development.The thesis deploys qualitative methodology to address and research its data. The collected data belongs to two categories, data stemming from interviews conducted by the thesis’s author and data stemming from journalistic magazines.The results of both type of data are compared and act supplementary to each other, then they are analyzed to answer the research questions asked by this thesis. The results showcase that iteration has negative effects to video game developers in both a macroscale (company’s resources, annual revenue) and in a microscale (overworking, health issues) level. The results also highlight that Agile is an all-time favorite development methodology of developers in the video game industry.In conclusion, the thesis supports the notion that iteration should be suppressed and proposes a number of solutions for that matter. The suggestions are essentially encouragement towards developers: to seek higher interactivity with customers throughout the duration of all the development stages of a video game, to show more trust to established gameplay mechanics and to place more reliance on a franchise’s profit power and benefits. These measures can be used in a preventive manner in order to limit the appearance of iteration and as a result, to limit its’ negative effects.

<p>In this paper I give a description and derivation of Dirichlet's problem, a boundary value problem, for p-harmonic functions on graphs and study an iterative method for solving it.The method's convergence is proved and some preliminary results about its speed of convergence are presented.There is an implementation accompanying this thesis and a short description of the implementation is included. The implementation will be made available on the internet at http://www.mai.liu.se/~anbjo/pharmgraph/ for as long as possible.</p>

We study the preconditioning of symmetric indefinite linear systems of equations that arise in interior point solution of linear optimization problems. The preconditioning method that we study exploits the block structure of the augmented matrix to design a similar block structure preconditioner to improve the spectral properties of the resulting preconditioned matrix so as to improve the convergence rate of the iterative solution of the system. We also propose a two-phase algorithm that takes advantage of the spectral properties of the transformed matrix to solve for the Newton directions in the interior-point method. Numerical experiments have been performed on some LP test problems in the NETLIB suite to demonstrate the potential of the preconditioning method discussed. / Singapore-MIT Alliance (SMA)

No description available.

In this paper I give a description and derivation of Dirichlet's problem, a boundary value problem, for p-harmonic functions on graphs and study an iterative method for solving it.The method's convergence is proved and some preliminary results about its speed of convergence are presented.There is an implementation accompanying this thesis and a short description of the implementation is included. The implementation will be made available on the internet at http://www.mai.liu.se/~anbjo/pharmgraph/ for as long as possible.

Fractal geometry is a new branch of mathematics. This report presents the tools, methods and theory required to describe this geometry. The power of Iterated Function Systems (IFS) is introduced and applied to produce fractal images or approximate complex estructures found in nature. The focus of this thesis is on how fractal geometry can be used in applications to computer graphics or to model natural objects.

We consider the problem of finding a common fixed point of an infinite family ${T_n}$ of nonlinear self-mappings of a closed convex subset $C$ of a real Hilbert space $H$. Namely, we want to find a point $x$ with the property (assuming such common fixed points exist): [ xin igcap_{n=1}^infty ext{Fix}(T_n). ] We will use the Krasnoselskii-Mann (KM) Type inertial iterative algorithms of the form $$ x_{n+1} = ((1-alpha_n)I+alpha_nT_n)y_n,quad y_n = x_n + eta_n(x_n-x_{n-1}).eqno(*)$$ We discuss the convergence properties of the sequence ${x_n}$ generated by this algorithm (*). In particular, we prove that ${x_n}$ converges weakly to a common fixed point of the family ${T_n}$ under certain conditions imposed on the sequences ${alpha_n}$ and ${eta_n}$.