| 1. |
- Gerlee, Philip, 1980, et al.
(författare)
-
Scientific Models : Red Atoms, White Lies and Black Boxes in a Yellow Book
- 2016
-
Bok (övrigt vetenskapligt/konstnärligt)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.
|
|
| 2. |
- Gerlee, Philip, 1980, et al.
(författare)
-
Scientific Models
- 2016
-
Bok (övrigt vetenskapligt/konstnärligt)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.
|
|
| 3. |
|
|
| 4. |
- Xia, Jiacheng, 1991
(författare)
-
Vector-valued Eisenstein series of congruence types and their products
- 2019
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)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.
|
|
| 5. |
- Strömberg, Ann-Brith, 1961, et al.
(författare)
-
Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
- 2020
-
Ingår i: Numerical Nonsmooth Optimization: State of the Art Algorithms. - Cham : Springer International Publishing. ; , s. 499-547, s. 499-547
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)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.
|
|
| 6. |
- Gäfvert, Oliver, 1991-
(författare)
-
Topological and geometrical methods in data analysis
- 2021
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)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).
|
|
| 7. |
- Lingefjärd, Thomas, 1952
(författare)
-
Rebirth of Euclidean Geometry?
- 2011
-
Ingår i: L. Bu & R. Schoen (Eds.) Model-centered mathematics learning using GeoGebra. - Rotterdam : Sense Publishers. - 9789460916168 ; , s. 205-216
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 8. |
- Lingefjärd, Thomas, 1952
(författare)
-
What justifies as a solution in a mathematics classroom
- 2011
-
Ingår i: Emanuelsson, J., Fainsilber, L., Häggström, J., Kullberg, A., Lindström, B. & Löwing, M. (Eds.) Voices on learning and instruction in mathematics. - Göteborg : NCM. - 9789185143207 ; , s. 257-274
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 9. |
- Lundengård, Karl, 1987-
(författare)
-
Generalized Vandermonde matrices and determinants in electromagnetic compatibility
- 2017
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)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.
|
|
| 10. |
|
|
