In this thesis we study Sobolev gradient flows for Perona-Malik style energy functionals and generalizations thereof. We begin with first order isotropic flows which are shown to be regularizations of the heat equation. We show that these flows are well-posed in the forward and reverse directions which yields an effective linear sharpening algorithm. We furthermore establish a number of maximum principles for the forward flow and show that edges are preserved for a finite period of time. We then go on to study isotropic Sobolev gradient flows with respect to higher order Sobolev metrics. As the Sobolev order is increased, we observe an increasing reluctance to destroy fine details and texture. We then consider Sobolev gradient flows for non-linear anisotropic diffusion functionals of arbitrary order. We establish existence, uniqueness and continuous dependence on initial data for a broad class of such equations. The well-posedness of these new anisotropic gradient flows opens the door to a wide variety of sharpening and diffusion techniques which were previously impossible under L2 gradient descent. We show how one can easily use this framework to design an anisotropic sharpening algorithm which can sharpen image features while suppressing noise. We compare our sharpening algorithm to the well-known shock filter and show that Sobolev sharpening produces natural looking images without the "staircasing" artifacts that plague the shock filter. / Thesis (Master, Mathematics & Statistics) -- Queen's University, 2010-08-25 10:44:12.23

In this dissertation, Richardson extrapolation and other computational techniques are used to develop a series of high accuracy high efficiency solution techniques for solving partial differential equations (PDEs). A Richardson extrapolation-based sixth-order method with multiple coarse grid (MCG) updating strategy is developed for 2D and 3D steady-state equations on uniform grids. Richardson extrapolation is applied to explicitly obtain a sixth-order solution on the coarse grid from two fourth-order solutions with different related scale grids. The MCG updating strategy directly computes a sixth-order solution on the fine grid by using various combinations of multiple coarse grids. A multiscale multigrid (MSMG) method is used to solve the linear systems resulting from fourth-order compact (FOC) discretizations. Numerical investigations show that the proposed methods compute high accuracy solutions and have better computational efficiency and scalability than the existing Richardson extrapolation-based sixth order method with iterative operator based interpolation. Completed Richardson extrapolation is explored to compute sixth-order solutions on the entire fine grid. The correction between the fourth-order solution and the extrapolated sixth-order solution rather than the extrapolated sixth-order solution is involved in the interpolation process to compute sixth-order solutions for all fine grid points. The completed Richardson extrapolation does not involve significant computational cost, thus it can reach high accuracy and high efficiency goals at the same time. There are three different techniques worked with Richardson extrapolation for computing fine grid sixth-order solutions, which are the iterative operator based interpolation, the MCG updating strategy and the completed Richardson extrapolation. In order to compare the accuracy of these Richardson extrapolation-based sixth-order methods, truncation error analysis is conducted on solving a 2D Poisson equation. Numerical comparisons are also carried out to verify the theoretical analysis. Richardson extrapolation-based high accuracy high efficiency computation is extended to solve unsteady-state equations. A higher-order alternating direction implicit (ADI) method with completed Richardson extrapolation is developed for solving unsteady 2D convection-diffusion equations. The completed Richardson extrapolation is used to improve the accuracy of the solution obtained from a high-order ADI method in spatial and temporal domains simultaneously. Stability analysis is given to show the effects of Richardson extrapolation on stable numerical solutions from the underlying ADI method.

Population models are very often used and considered useful in the policy-making process and for planning purposes. In this research I have tried to illuminate the problem of analysing population evolution in space by using three models which cover a wide spectrum of complementary methodologies: a The Hotell.ing-Puu model b A multiregional demographic model c A synergetic model Hotelling's work and Puu's later generalization have produced theoretical continuous models treating population growth and dispersal in a combined logistic growth and diffusion equation. The multiregional model is a discrete model based on the Markovian assumption which simulates the population evolution disaggregated by age and region. It is further assumed that this population is governed by a given pattern of growth and interregional mobility. The synergetic model is also a discrete model based on the Markovian assumption incorporating a probabilistic framework with causal structure. The quantitative description of the population dynamics is treated in terms of trend parameters, which are correlated in turn with demo-economic factors. / <p>Diss. Umeå : Umeå universitet, 1988</p> / Digitalisering@umu

<p>We consider stochastic hybrid systems that stem from evolution equations with right-hand sides that stochastically switch between a given set of right-hand sides. To begin our study, we consider a linear ordinary differential equation whose right-hand side stochastically switches between a collection of different matrices. Despite its apparent simplicity, we prove that this system can exhibit surprising behavior.</p><p>Next, we construct mathematical machinery for analyzing general stochastic hybrid systems. This machinery combines techniques from various fields of mathematics to prove convergence to a steady state distribution and to analyze its structure.</p><p>Finally, we apply the tools from our general framework to partial differential equations with randomly switching boundary conditions. There, we see that these tools yield explicit formulae for statistics of the process and make seemingly intractable problems amenable to analysis.</p> / Dissertation

In today’s computer age, the numerical simulations are replacing the traditional laboratory experiments. Researchers around the world are using advanced computer software and multiprocessor computer technology to perform experiments, and analyse these simulation results to advance in their respective endeavours. With a wide variety of tools and technologies available, it could be a tedious and time taking task for a non-computer science researcher to choose appropriate methodologies for developing simulation software The research of this thesis addresses the use of Message Passing Interface (MPI) using object-oriented programming techniques and discusses the methodologies suitable to scientific computing, also, propose a customized software engineering development model.

We elaborate upon the Herty-Illner macroscopic traffic models which include special non-local forces. The first chapter presents these in relation to the traffic models of Aw-Rascle and Zhang, arguing that non-local forces are necessary for a realistic description of traffic. The second chapter considers travelling wave solutions for the Herty-Illner macroscopic models. The travelling wave ansatz for the braking scenario reveals a curiously implicit nonlinear functional differential equation, the jam equation, whose unknown is, at least to conventional tools, inextricably self-argumentative! Observing that analytic solution methods fail for the jam equation yet succeed for equations with similar coefficients raises a challenging problem of pure and applied mathematical interest. An unjam equation analogous to the jam equation explored by Illner and McGregor is derived. The third chapter outlines refinements for the Herty-Illner models. Numerics allow exploration of the refined model dynamics in a variety of realistic traffic situations, leading to a discussion of the broadened applicability conferred by the refinements: ultimately the prediction of stop-and-go waves. The conclusion asserts that all of the above contribute knowledge pertinent to traffic control for reduced congestion and ameliorated vehicular flow. / Graduate

There has been much work on electron emission. It has lead to the concept of the photon and new electron sources for imaging such as electron microscopes and the rst formulation of holographic reconstructions [1-6]. Analytical derivations are important to gain physical insight into the problem of developing better electron sources. However, to date, such formulations have su ered by a number of approximations that have masked important physics. In this thesis, a new approach is provided that solves the Schrodinger wave equation for photoemission from a single atom tungsten tip barrier or more generally, for photoemission from a Schottky triangular barrier potential, with or without image potential e ects. We describe the system, then introduce the mathematical derivation. We conclude with the applications of the theory.

There has been much work on electron emission. It has lead to the concept of the photon and new electron sources for imaging such as electron microscopes and the rst formulation of holographic reconstructions [1-6]. Analytical derivations are important to gain physical insight into the problem of developing better electron sources. However, to date, such formulations have su ered by a number of approximations that have masked important physics. In this thesis, a new approach is provided that solves the Schrodinger wave equation for photoemission from a single atom tungsten tip barrier or more generally, for photoemission from a Schottky triangular barrier potential, with or without image potential e ects. We describe the system, then introduce the mathematical derivation. We conclude with the applications of the theory.

In scientific computing, it is very common to visualize the approximate solution obtained by a numerical PDE solver by drawing surface or contour plots of all or some components of the associated approximate solutions. These plots are used to investigate the behavior of the solution and to display important properties or characteristics of the approximate solutions. In this thesis, we consider techniques for drawing such contour plots for the solution of two and three dimensional PDEs. We first present three fast contouring algorithms in two dimensions over an underlying unstructured mesh. Unlike standard contouring algorithms, our algorithms do not require a fine structured approximation. We assume that the underlying PDE solver generates approximations at some scattered data points in the domain of interest. We then generate a piecewise cubic polynomial interpolant (PCI) which approximates the solution of a PDE at off-mesh points based on the DEI (Differential Equation Interpolant) approach. The DEI approach assumes that accurate approximations to the solution and first-order derivatives exist at a set of discrete mesh points. The extra information required to uniquely define the associated piecewise polynomial is determined based on almost satisfying the PDE at a set of collocation points. In the process of generating contour plots, the PCI is used whenever we need an accurate approximation at a point inside the domain. The direct extension of the both DEI-based interpolant and the contouring algorithm to three dimensions is also investigated. The use of the DEI-based interpolant we introduce for visualization can also be used to develop effective Adaptive Mesh Refinement (AMR) techniques and global error estimates. In particular, we introduce and investigate four AMR techniques along with a hybrid mesh refinement technique. Our interest is in investigating how well such a `generic' mesh selection strategy, based on properties of the problem alone, can perform compared with a special-purpose strategy that is designed for a specific PDE method. We also introduce an \`{a} posteriori global error estimator by introducing the solution of a companion PDE defined in terms of the associated PCI.

In scientific computing, it is very common to visualize the approximate solution obtained by a numerical PDE solver by drawing surface or contour plots of all or some components of the associated approximate solutions. These plots are used to investigate the behavior of the solution and to display important properties or characteristics of the approximate solutions. In this thesis, we consider techniques for drawing such contour plots for the solution of two and three dimensional PDEs. We first present three fast contouring algorithms in two dimensions over an underlying unstructured mesh. Unlike standard contouring algorithms, our algorithms do not require a fine structured approximation. We assume that the underlying PDE solver generates approximations at some scattered data points in the domain of interest. We then generate a piecewise cubic polynomial interpolant (PCI) which approximates the solution of a PDE at off-mesh points based on the DEI (Differential Equation Interpolant) approach. The DEI approach assumes that accurate approximations to the solution and first-order derivatives exist at a set of discrete mesh points. The extra information required to uniquely define the associated piecewise polynomial is determined based on almost satisfying the PDE at a set of collocation points. In the process of generating contour plots, the PCI is used whenever we need an accurate approximation at a point inside the domain. The direct extension of the both DEI-based interpolant and the contouring algorithm to three dimensions is also investigated. The use of the DEI-based interpolant we introduce for visualization can also be used to develop effective Adaptive Mesh Refinement (AMR) techniques and global error estimates. In particular, we introduce and investigate four AMR techniques along with a hybrid mesh refinement technique. Our interest is in investigating how well such a `generic' mesh selection strategy, based on properties of the problem alone, can perform compared with a special-purpose strategy that is designed for a specific PDE method. We also introduce an \`{a} posteriori global error estimator by introducing the solution of a companion PDE defined in terms of the associated PCI.