| 1. |
- Xia, Jiacheng, 1991
(author)
-
Vector-valued Eisenstein series of congruence types and their products
- 2019
-
Licentiate thesis (other academic/artistic)abstract
- Historically, Kohnen and Zagier connected modular forms with period polynomials, and as a consequence of this association concluded that the products of at most two Eisenstein series span all spaces of classical modular forms of level 1. Later Borisov and Gunnells among other authors extended the result to higher levels. We consider this problem for vector-valued modular forms, establish the framework of congruence types and obtain the structure of the space of vector-valued Eisenstein series using tools from representation theory. Based on this development and historic results, we show that the space of vector-valued modular forms of certain weights and any congruence type can be spanned by the invariant vectors of that type tensor at most two Eisenstein series.
|
|
| 2. |
- Strömberg, Ann-Brith, 1961, et al.
(author)
-
Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
- 2020
-
In: Numerical Nonsmooth Optimization: State of the Art Algorithms. - Cham : Springer International Publishing. ; , s. 499-547, s. 499-547
-
Book chapter (other academic/artistic)abstract
- This chapter presents several solution methodologies for mixed-integer linear optimization, stated as mixed-binary optimization problems, by means of Lagrangian duals, subgradient optimization, cutting-planes, and recovery of primal solutions. It covers Lagrangian duality theory for mixed-binary linear optimization, a problem framework for which ultimate success—in most cases—is hard to accomplish, since strong duality cannot be inferred. First, a simple conditional subgradient optimization method for solving the dual problem is presented. Then, we show how ergodic sequences of Lagrangian subproblem solutions can be computed and used to recover mixed-binary primal solutions. We establish that the ergodic sequences accumulate at solutions to a convexified version of the original mixed-binary optimization problem. We also present a cutting-plane approach to the Lagrangian dual, which amounts to solving the convexified problem by Dantzig–Wolfe decomposition, as well as a two-phase method that benefits from the advantages of both subgradient optimization and Dantzig–Wolfe decomposition. Finally, we describe how the Lagrangian dual approach can be used to find near optimal solutions to mixed-binary optimization problems by utilizing the ergodic sequences in a Lagrangian heuristic, to construct a core problem, as well as to guide the branching in a branch-and-bound method. The chapter is concluded with a section comprising notes, references, historical downturns, and reading tips.
|
|
| 3. |
- Fotedar, Sunney, 1989
(author)
-
Mathematical Multi-Objective Optimization of the Tactical Allocation of Machining Resources in Functional Workshops
- 2023
-
Doctoral thesis (other academic/artistic)abstract
- In the aerospace industry, efficient management of machining capacity is crucial to meet the required service levels to customers and to maintain control of the tied-up working capital. We introduce new multi-item , multi-level capacitated resource allocation models with a medium--to--long--term planning horizon. The model refers to functional workshops where costly and/or time- and resource-demanding preparations (or qualifications) are required each time a product needs to be (re)allocated to a machining resource. Our goal is to identify possible product routings through the factory which minimize the maximum excess resource loading above a given loading threshold while incurring as low qualification costs as possible and minimizing the inventory. In Paper I , we propose a new bi-objective mixed-integer (linear) optimization model for the Tactical Resource Allocation Problem (TRAP). We highlight some of the mathematical properties of the TRAP which are utilized to enhance the solution process. In Paper II , we address the uncertainty in the coefficients of one of the objective functions considered in the bi-objective TRAP. We propose a new bi-objective robust efficiency concept and highlight its benefits over existing robust efficiency concepts. In Paper III , we extend the TRAP with an inventory of semi-finished as well as finished parts, resulting in a tri-objective mixed-integer (linear) programming model. We create a criterion space partitioning approach that enables solving sub-problems simultaneously. In Paper IV , using our knowledge from our previous work we embarked upon a task to generalize our findings to develop an approach for any discrete tri-objective optimization problem. The focus is on identifying a representative set of non-dominated points with a pre-defined desired coverage gap .
|
|
| 4. |
- Kurujyibwami, Celestin
(author)
-
Admissible transformations and the group classification of Schrödinger equations
- 2017
-
Doctoral thesis (other academic/artistic)abstract
- We study admissible transformations and solve group classification problems for various classes of linear and nonlinear Schrödinger equations with an arbitrary number n of space variables.The aim of the thesis is twofold. The first is the construction of the new theory of uniform seminormalized classes of differential equations and its application to solving group classification problems for these classes. Point transformations connecting two equations (source and target) from the class under study may have special properties of semi-normalization. This makes the group classification of that class using the algebraic method more involved. To extend this method we introduce the new notion of uniformly semi-normalized classes. Various types of uniform semi-normalization are studied: with respect to the corresponding equivalence group, with respect to a proper subgroup of the equivalence group as well as the corresponding types of weak uniform semi-normalization. An important kind of uniform semi-normalization is given by classes of homogeneous linear differential equations, which we call uniform semi-normalization with respect to linear superposition of solutions.The class of linear Schrödinger equations with complex potentials is of this type and its group classification can be effectively carried out within the framework of the uniform semi-normalization. Computing the equivalence groupoid and the equivalence group of this class, we show that it is uniformly seminormalized with respect to linear superposition of solutions. This allow us to apply the version of the algebraic method for uniformly semi-normalized classes and to reduce the group classification of this class to the classification of appropriate subalgebras of its equivalence algebra. To single out the classification cases, integers that are invariant under equivalence transformations are introduced. The complete group classification of linear Schrödinger equations is carried out for the cases n = 1 and n = 2.The second aim is to study group classification problem for classes of generalized nonlinear Schrödinger equations which are not uniformly semi-normalized. We find their equivalence groupoids and their equivalence groups and then conclude whether these classes are normalized or not. The most appealing classes are the class of nonlinear Schrödinger equations with potentials and modular nonlinearities and the class of generalized Schrödinger equations with complex-valued and, in general, coefficients of Laplacian term. Both these classes are not normalized. The first is partitioned into an infinite number of disjoint normalized subclasses of three kinds: logarithmic nonlinearity, power nonlinearity and general modular nonlinearity. The properties of the Lie invariance algebras of equations from each subclass are studied for arbitrary space dimension n, and the complete group classification is carried out for each subclass in dimension (1+2). The second class is successively reduced into subclasses until we reach the subclass of (1+1)-dimensional linear Schrödinger equations with variable mass, which also turns out to be non-normalized. We prove that this class is mapped by a family of point transformations to the class of (1+1)-dimensional linear Schrödinger equations with unique constant mass.
|
|
| 5. |
- 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.
|
|
| 6. |
- 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.
|
|
| 7. |
- Gerlee, Philip, 1980, et al.
(author)
-
Scientific Models : Red Atoms, White Lies and Black Boxes in a Yellow Book
- 2016
-
Book (other academic/artistic)abstract
- A zebrafish, the hull of a miniature ship, a mathematical equation and a food chain - what do these things have in common? They are examples of models used by scientists to isolate and study particular aspects of the world around us. This book begins by introducing the concept of a scientific model from an intuitive perspective, drawing parallels to mental models and artistic representations. It then recounts the history of modelling from the 16th century up until the present day. The iterative process of model building is described and discussed in the context of complex models with high predictive accuracy versus simpler models that provide more of a conceptual understanding. To illustrate the diversity of opinions within the scientific community, we also present the results of an interview study, in which ten scientists from different disciplines describe their views on modelling and how models feature in their work. Lastly, it includes a number of worked examples that span different modelling approaches and techniques. It provides a comprehensive introduction to scientific models and shows how models are constructed and used in modern science. It also addresses the approach to, and the culture surrounding modelling in different scientific disciplines. It serves as an inspiration for model building and also facilitates interdisciplinary collaborations by showing how models are used in different scientific fields. The book is aimed primarily at students in the sciences and engineering, as well as students at teacher training colleges but will also appeal to interested readers wanting to get an overview of scientific modelling in general and different modelling approaches in particular.
|
|
| 8. |
- Gerlee, Philip, 1980, et al.
(author)
-
Scientific Models
- 2016
-
Book (other academic/artistic)abstract
- A zebrafish, the hull of a miniature ship, a mathematical equation and a food chain - what do these things have in common? They are examples of models used by scientists to isolate and study particular aspects of the world around us. This book begins by introducing the concept of a scientific model from an intuitive perspective, drawing parallels to mental models and artistic representations. It then recounts the history of modelling from the 16th century up until the present day. The iterative process of model building is described and discussed in the context of complex models with high predictive accuracy versus simpler models that provide more of a conceptual understanding. To illustrate the diversity of opinions within the scientific community, we also present the results of an interview study, in which ten scientists from different disciplines describe their views on modelling and how models feature in their work. Lastly, it includes a number of worked examples that span different modelling approaches and techniques. It provides a comprehensive introduction to scientific models and shows how models are constructed and used in modern science. It also addresses the approach to, and the culture surrounding modelling in different scientific disciplines. It serves as an inspiration for model building and also facilitates interdisciplinary collaborations by showing how models are used in different scientific fields. The book is aimed primarily at students in the sciences and engineering, as well as students at teacher training colleges but will also appeal to interested readers wanting to get an overview of scientific modelling in general and different modelling approaches in particular.
|
|
| 9. |
- Thörnblad, Karin, 1971, et al.
(author)
-
Scheduling optimization of a real flexible job shop including side constraints regarding maintenance, fixtures, and night shifts
- 2013
-
Other publication (other academic/artistic)abstract
- We present a generic iterative scheduling procedure for the scheduling of a real flexible job shop, the so-called multitask cell at GKN Aerospace Engine Systems in Sweden. A time-indexed formulation of the problem is presented including side constraints regarding preventive maintenance, fixture availability, and unmanned night shifts. This paper continues the work in [35], with an improvement of the iterative solution procedure and the inclusion of constraints regarding night shifts during which only unmanned processing is allowed. The resulting schedules are compared with schedules constructed using two priority dispatching rules. Computational results show that the gain of including the night shifts constraints is significant and that the methodology developed is able to produce near-optimal schedules for industrial data instances for the coming shift within an acceptable practical time frame.
|
|
| 10. |
- Gäfvert, Oliver, 1991-
(author)
-
Topological and geometrical methods in data analysis
- 2021
-
Doctoral thesis (other academic/artistic)abstract
- This thesis concerns two related data analysis pipelines, using topological and geometrical methods respectively, to extract relevant information. The first pipeline, referred to as the topological data analysis (TDA) pipeline, constructs a filtered simplicial complex on a given data set in order to describe its shape. The shape is described using a persistence module, which characterizes the topological features of the filtration, and the final step of the pipeline extracts algebraic invariants from this object. The second pipeline, referred to as the geometric data analysis (GDA) pipeline, associates an algebraic variety to a given data set and aims to describe the structure of this variety. Its structure is described using homology, an invariant which for most algebraic varieties can only be computed numerically using sampling methods.In Paper A we consider invariants on multi-parameter persistence modules. We explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to the interleaving distance and so called simple noise systems. For one parameter, we recover the standard barcode information. For more than one parameter we prove that the constructed invariants are in general NP-hard to calculate. A consequence is that computing the feature counting function, proposed by Scolamiero et. al. (2016), is NP-hard.In Paper B we introduce an efficient algorithm to compute a minimal presentation of a multi-parameter persistent homology module, given a chain complex of free modules as input. Our approach extends previous work on this problem in the 2-parameter case, and draws on ideas underlying the F4 and F5 algorithms for Gröbner basis computation. In the r-parameter case, our algorithm computes a presentation for the homology of C ->F A ->G B, with modules of rank l,n,m respectively, in O(r2nr+1 + nrm + nr-1m2 + rn2 l) arithmetic operations. We implement this approach in our new software Muphasa, written in C++. In preliminary computational experiments on synthetic TDA examples, we compare our approach to a version of a classical approach based on Schreyer's algorithm, and find that ours is substantially faster and more memory efficient. In the course of developing our algorithm for computing presentations, we also introduce algorithms for the closely related problems of computing Gröbner bases for the image and kernel of the morphism G. This algorithm runs in time O(nrm + nr-1m2) and memory O(n2 + mn + nr + K), where K is the size of the output.Paper C analyzes the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in RN. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDD) of a certain variety called the hypothesis variety as the number of points in the configuration increases. Finally, we establish a connection to complexity of architectures of polynomial neural networks. For the problem of fitting an (N-1)-sphere to a configuration of m points in RN, we give a closed formula for the algebraic complexity of the hypothesis variety as m grows for the case of N=1. For the case N>1 we conjecture a generalization of this formula supported by numerical experiments.In Paper D we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing bottlenecks of the variety. Using geometric information such as the bottlenecks and the local reach we also provide bounds on the density of the sample needed in order to guarantee that the homology of the variety can be recovered from the sample. An implementation of the algorithm is provided together with numerical experiments and a computational comparison to the algorithm by Dufresne et. al. (2019).
|
|
