| 11. |
- Ericsson, Niklas, 1968
(author)
-
A Framework for Approximation of the Stokes Equations in an Axisymmetric Domain
- 2021
-
In: Computational Methods in Applied Mathematics. - : Walter de Gruyter GmbH. - 1609-4840 .- 1609-9389. ; 21:4
-
Journal article (peer-reviewed)abstract
- We develop a framework for solving the stationary, incompressible Stokes equations in an axisymmetric domain. By means of Fourier expansion with respect to the angular variable, the three-dimensional Stokes problem is reduced to an equivalent, countable family of decoupled two-dimensional problems. By using decomposition of three-dimensional Sobolev norms, we derive natural variational spaces for the two-dimensional problems, and show that the variational formulations are well-posed. We analyze the error due to Fourier truncation and conclude that, for data that are sufficiently regular, it suffices to solve a small number of two-dimensional problems. © 2021 Ericsson, published by De Gruyter 2021.
|
|
| 12. |
- Malik, Adam, 1991
(author)
-
Mathematical Modelling of Cell Migration and Polarization
- 2020
-
Doctoral thesis (other academic/artistic)abstract
- Cell migration plays a fundamental role in both development and disease. It is a complex process during which cells interact with one another and with their local environment. Mathematical modelling offers tools to investigate such processes and can give insights into the underlying biological details, and can also guide new experiments. The first two papers of this thesis are concerned with modelling durotaxis, which is the phenomena where cells migrate preferentially up a stiffness gradient. Two distinct mechanisms which potentially drive durotaxis are investigated. One is based on the hypothesis that adhesion sites of migrating cells become reinforced and have a longer lifespan on stiffer substrates. The second mechanism is based on cells being able to generate traction forces, the magnitude of which depend on the stiffness of the substrate. We find that both mechanisms can indeed give rise to biased migration up a stiffness gradient. Our results encourages new experiments which could determine the importance of the two mechanisms in durotaxis. The third paper is devoted to a population-level model of cancer cells in the brain of mice. The model incorporates diffusion tensor imaging data, which is used to guide the migration of the cells. Model simulations are compared to experimental data, and highlights the model’s difficulty in producing irregular growth patterns observed in the experiments. As a consequence, the findings encourage further model development. The fourth paper is concerned with modelling cell polarization, in the absence of environmental cues, referred to as spontaneous symmetry breaking. Polarization is an important part of cell migration, but also plays a role during division and differentiation. The model takes the form of a reaction diffusion system in 3D and describes the spatio-temporal evolution of three forms of Cdc42 in the cell. The model is able to produce biologically relevant patterns, and numerical simulations show how model parameters influence key features such as pattern formation and time to polarization.
|
|
| 13. |
|
|
| 14. |
- Wang, Siyang, et al.
(author)
-
CONVERGENCE OF FINITE DIFFERENCE METHODS FOR THE WAVE EQUATION IN TWO SPACE DIMENSIONS
- 2018
-
In: Mathematics of Computation. - : American Mathematical Society (AMS). - 0025-5718 .- 1088-6842. ; 87:314, s. 2737-2763
-
Journal article (peer-reviewed)abstract
- When using a finite difference method to solve an initial-boundary-value problem, the truncation error is often of lower order at a few grid points near boundaries than in the interior. Normal mode analysis is a powerful tool to analyze the effect of the large truncation error near boundaries on the overall convergence rate, and has been used in many research works for different equations. However, existing work only concerns problems in one space dimension. In this paper, we extend the analysis to problems in two space dimensions. The two dimensional analysis is based on a diagonalization procedure that decomposes a two dimensional problem to many one dimensional problems of the same type. We present a general framework of analyzing convergence for such one dimensional problems, and explain how to obtain the result for the corresponding two dimensional problem. In particular, we consider two kinds of truncation errors in two space dimensions: the truncation error along an entire boundary, and the truncation error localized at a few grid points close to a corner of the computational domain. The accuracy analysis is in a general framework, here applied to the second order wave equation. Numerical experiments corroborate our accuracy analysis.
|
|
| 15. |
- Zhao, D., et al.
(author)
-
Low Phase-Rank Approximation
- 2022
-
In: Linear Algebra and Its Applications. - : Elsevier BV. - 0024-3795. ; 639, s. 177-204
-
Journal article (peer-reviewed)abstract
- In this paper, we propose and solve low phase-rank approximation problems, which serve as a counterpart to the well-known low-rank approximation problem and the Schmidt-Mirsky theorem. It is well known that a nonzero complex number can be specified by its gain and phase, and while it is generally accepted that the gains of a matrix may be defined by its singular values, there is no widely accepted definition for its phases. In this work, we consider sectorial matrices, whose numerical ranges do not contain the origin, and adopt the canonical angles of such matrices as their phases. Similarly to the rank of a matrix being defined as the number of its nonzero singular values, we define the phase-rank of a sectorial matrix as the number of its nonzero phases. While a low-rank approximation problem is associated with the matrix arithmetic mean, it turns out that a natural parallel for the low phase-rank approximation problem is to use the matrix geometric mean to measure the approximation error. Importantly, we derive a majorization inequality between the phases of the geometric mean and the arithmetic mean of the phases, similarly to the Ky-Fan inequality for eigenvalues of Hermitian matrices. A characterization of the solutions to the proposed problem, with the same flavor as the Schmidt-Mirsky theorem, is then obtained in the case where both the objective matrix and the approximant are restricted to be positive-imaginary. In addition, we provide an alternative formulation of the low phase-rank approximation problem using geodesic distances between sectorial matrices. The two formulations give rise to the exact same set of solutions when the involved matrices are additionally assumed to be unitary. © 2022 Elsevier Inc.
|
|
| 16. |
- Andersson, Fredrik K., et al.
(author)
-
The mathematics of internet search engines
- 2008
-
In: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications. - : Springer. - 0167-8019 .- 1572-9036. ; 104:2, s. 211-242
-
Journal article (peer-reviewed)abstract
- This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.
|
|
| 17. |
- Laksman, Efraim, 1983, et al.
(author)
-
The stochastic opportunistic replacement problem, part III: improved bounding procedures
- 2020
-
In: Annals of Operations Research. - : Springer Science and Business Media LLC. - 1572-9338 .- 0254-5330. ; 292:2, s. 711-733
-
Journal article (peer-reviewed)abstract
- We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy.
|
|
| 18. |
- Casarino, V., et al.
(author)
-
On the variation operator for the Ornstein-Uhlenbeck semigroup in dimension one
- 2024
-
In: Annali Di Matematica Pura Ed Applicata. - 0373-3114 .- 1618-1891. ; 203:1, s. 205-219
-
Journal article (peer-reviewed)abstract
- Consider the variation seminorm of the Ornstein-Uhlenbeck semigroup Ht in dimension one, taken with respect to t. We show that this seminorm defines an operator of weak type (1, 1) for the relevant Gaussian measure. The analogous Lp estimates for 1 < p < 8 were already known.
|
|
| 19. |
- Lundengård, Karl, 1987-
(author)
-
Generalized Vandermonde matrices and determinants in electromagnetic compatibility
- 2017
-
Licentiate thesis (other academic/artistic)abstract
- Matrices whose rows (or columns) consists of monomials of sequential powers are called Vandermonde matrices and can be used to describe several useful concepts and have properties that can be helpful for solving many kinds of problems. In this thesis we will discuss this matrix and some of its properties as well as a generalization of it and how it can be applied to curve fitting discharge current for the purpose of ensuring electromagnetic compatibility.In the first chapter the basic theory for later chapters is introduced. This includes the Vandermonde matrix and some of its properties, history, applications and generalizations, interpolation and regression problems, optimal experiment design and modelling of electrostatic discharge currents with the purpose to ensure electromagnetic compatibility.The second chapter focuses on finding the extreme points for the determinant for the Vandermonde matrix on various surfaces including spheres, ellipsoids, cylinders and tori. The extreme points are analysed in three dimensions or more.The third chapter discusses fitting a particular model called the p-peaked Analytically Extended Function (AEF) to data taken either from a standard for electromagnetic compatibility or experimental measurements. More specifically the AEF will be fitted to discharge currents from the IEC 62305-1 and IEC 61000-4-2 standards for lightning protection and electrostatic discharge immunity as well as some experimentally measured data of similar phenomena.
|
|
| 20. |
- Dhamal, Swapnil Vilas, 1988, et al.
(author)
-
Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy
- 2018
-
In: AAAI 2018 - Proceedings of the 32nd AAAI Conference on Artificial Intelligence. ; , s. 997-1006
-
Conference paper (peer-reviewed)abstract
- We consider a two-player resource allocation polytope game, in which the strategy of a player is restricted by the strategy of the other player, with common coupled constraints. With respect to such a game, we formally introduce the notions of independent optimal strategy profile, which is the profile when players play optimally in the absence of the other player; and common contiguous set, which is the set of top nodes in the preference orderings of both the players that are exhaustively invested on in the independent optimal strategy profile. We show that for the game to have a unique PSNE, it is a necessary and sufficient condition that the independent optimal strategies of the players do not conflict, and either the common contiguous set consists of at most one node or all the nodes in the common contiguous set are invested on by only one player in the independent optimal strategy profile. We further derive a socially optimal strategy profile, and show that the price of anarchy cannot be bound by a common universal constant. We hence present an efficient algorithm to compute the price of anarchy and the price of stability, given an instance of the game. Under reasonable conditions, we show that the price of stability is 1. We encounter a paradox in this game that higher budgets may lead to worse outcomes.
|
|
