Semigroups of Kernel Operators

Total Page:16

File Type:pdf, Size:1020Kb

Semigroups of Kernel Operators Semigroups of Kernel Operators Moritz Gerlach Dissertation zur Erlangung des Doktorgrades Dr. rer. nat. der Fakult¨atf¨ur Mathematik und Wirtschaftswissenschaften der Universit¨atUlm. Vorgelegt von Moritz Gerlach aus Limburg an der Lahn im Jahr 2014. Tag der Pr¨ufung: 28. Mai 2014 Gutachter: Prof. Dr. Wolfgang Arendt Prof. Dr. G¨unther Palm Prof. Dr. Rainer Nagel Amtierender Dekan: Prof. Dr. Dieter Rautenbach Contents Introduction 1 1 Preliminaries 7 2 Weakly continuous operators on the space of measures 13 2.1 Norming dual pairs . 14 2.2 The lattice of transition kernels . 15 2.3 The sublattice of weakly continuous operators . 20 3 Mean ergodic theorems on norming dual pairs 25 3.1 Average schemes . 27 3.2 An ergodic theorem on norming dual pairs . 31 3.3 An ergodic theorem on the space of measures . 36 3.4 Counterexamples . 43 4 Kernel and Harris operators 47 4.1 Definition and basic properties . 48 4.2 Characterization by star{order continuity . 53 4.3 Triviality of the peripheral point spectrum . 61 5 Stability of semigroups 71 5.1 Stability of semigroups of Harris operators . 72 5.2 Doob's theorem . 79 5.3 A Tauberian theorem for strong Feller semigroups . 81 Appendix 89 Bibliography 97 Index 103 Introduction Semigroups of operators describe the evolution of linear systems and processes. As an illustrating example, let us consider the heat equation 8 @ @2 < u(t; x) = u(t; x) t ≥ 0, x 2 R @t @2x : u(0; x) = u0(x) x 2 R: A solution u(t; x) of this equation describes the heat at a specific time t ≥ 0 at position x 2 R. Hence, this equation models the diffusion of heat on the real line, starting with initial distribution u0 at time t = 0. It is well-known that this equation has a unique bounded solution for every continuous and bounded initial value u0. This solution is given by 1 Z 1 (x − y)2 (T (t)u0)(x) = p exp − u0(y) dy: 4πt −∞ 4t The so defined operators T (t), which map an initial value u0 to the corresponding solution at time t ≥ 0, are linear and satisfy the semigroup law T (t)T (s) = T (t+s) for all t; s ≥ 0. The latter means that the state of the system at time t + s equals the state at time t when the system is considered to be initialized with T (s)u0 instead of u0. The family of operators (T (t))t≥0 is called the Gaussian Semigroup. One important property of this semigroup is that each operator T (t) maps positive functions to positive ones. That is to say that if the heat is everywhere larger or equal than zero, it remains so for all time. Such semigroups are called positive. Intuitively, this is a typical property of semigroups describing some kind of diffusion. Moreover, the operators of the Gaussian Semigroup have an additional special property. Each operator T (t) is a kernel operator, i.e. it is of the form Z T (t)f = ht( · ; y)f(y) dy 1 Introduction for some function ht. In general, one cannot describe the operators of a semigroup by an explicit formula as in the example above. If, for instance, one is interested in the diffusion of heat on a plate, it is hard to impossible to calculate the single operators T (t) in one way or another unless a very specific geometry of the plate is given. Instead, there are often abstract arguments at hand to ensure that a semigroup consists of kernel operators although one does not know the kernel functions ht explicitly. For example, one can show that basically all differential operators generate a semigroup of kernel operators, see [12]. In this thesis we study several aspects of semigroups of kernel operators. First, we provide abstract characterizations of kernel operators which we use in particular to identify kernel operators on spaces of measures. Secondly, we study the asymptotic behavior of such semigroups, namely convergence of the semigroups in mean and convergence of the semigroups itself. It is well-known that kernel operators can be described in the following way. A regular and order continuous operator is a kernel operator if and only if it belongs to the band generated by the finite rank operators. If the latter is used as definition, this generalizes the notion of a kernel operator to arbitrary Banach lattices. On the other hand, kernel operators can be characterized by a continuity condition. Bukhvalov showed in [16] that an operator on Lp is a kernel operator if and only if it maps order bounded norm convergent sequences to almost everywhere convergent ones. We provide a generalization of Bukhvalov's theorem for operators on Banach lattices and describe abstract kernel operators in terms of the so-called star{order continuity. This characterization is originally due to Grobler and van Eldik [35]. We give an alternative proof under different conditions on the spaces. The analysis of the asymptotic behavior of operator semigroups has a long history. Of particular interest is the characterization of stability, i.e. convergence to an equilibrium, by properties of the semigroup or its generator. Most results obtained in this area establish a connection between the asymptotic behavior and properties of the spectrum of the generator. Our approach is completely different and based on a technique developed by Greiner. He showed in [33] that a positive, contractive and irreducible strongly continuous semigroup on Lp converges to a projection onto its fixed space under the following two conditions: The peripheral point spectrum of its generator is f0g { in particular, the semigroup is assumed to admit a non-zero fixed point { and the semigroup contains two operators which are not disjoint. Due to a theorem of Axmann [14], the second condition holds automatically if the operators of the semigroup dominate kernel operators. Such operators are called Harris operators. Greiner proved in [33] that the first condition is satisfied for semigroups of kernel operators. Combining these result, Greiner 2 showed that a positive, contractive and irreducible strongly continuous semigroup on Lp converges to a projection onto its fixed space if it consists of kernel operators and admits a non-zero fixed point. This is an extraordinary theorem as it does not follow from one of the known spectral descriptions of stability. We generalize this theorem in several respects. First, we consider time-discrete semigroups in addition to strongly continuous ones and this not only on Lp but also on arbitrary Banach lattices. Secondly, we show that the peripheral point spectrum of the generator of a semigroup of Harris operators is trivial. As a consequence, we obtain a stability theorem for semigroups whose operators are merely assumed to dominate kernel operators. Moreover, we present applications of Greiner's technique to a different but related class of positive semigroups. In the study of Markov processes one is interested in certain operators on spaces of measures which describe the evolution of probability distributions and are in general not kernel operators. In such a process, a state x is not transported deterministically to a certain state y. Instead, the new state is chosen by chance. The measure k(x; · ), the so-called transition kernel, is the distribution of states one is moved to from state x in one time step. In general, a Markov process carries a probability measure µ over to Z T µ = k(x; · ) dµ(x): Ω This defines a linear operator T on the space of measures which is also called kernel operator in the probabilistic literature. To distinguish an operator of this form from kernel operators as mentioned before, we call them weakly continuous operators as they are precisely those operators which are continuous with respect to the weak topology induced by the bounded measurable functions. Here, we study probably for the first time order properties of weakly continu- ous operators. In doing so, we determine differences and similarities of weakly continuous operators and kernel operators. It turns out that the space of weakly continuous operators is a countably order complete sublattice of the bounded operators on the space of measures. However, in contrast to kernel operators which form a band, weakly continuous operators are not even an ideal. While it is nearly impossible to calculate the infimum of arbitrary regular operators in a practical way, the situation improves for weakly continuous operators. As for kernel operators, the computation of lattice operations of weakly continuous operators reduces to the corresponding lattice operations of their transition kernels. The infimum T1 ^T2 of two weakly continuous operators is again weakly continuous and given by the infimum of their transition kernels k1 and k2 defined pointwise as the infimum of the measures k1(x; · ) and k2(x; · ). 3 Introduction Therefore, it is now possible to impose conditions on the transition kernels to ensure that the corresponding operators are not disjoint. For example, it suffices to assume the measures k(x; · ) and k(y; · ) to be mutually absolutely continuous, which is a form of irreducibility. This enables us to apply Greiner's theorem in this context. By this method, we obtain a purely analytic proof of a version of Doob's theorem on stability of Markov processes and uniqueness of invariant measures. The same arguments also yield a version for time-discrete semigroups, i.e. for Markov chains. A necessary condition for stability is convergence of the semigroup in mean, a property called mean ergodicity. This is in general strictly weaker than convergence of the semigroup itself and can typically be checked easily by the well-known mean ergodic theorem.
Recommended publications
  • Kernel and Image
    Math 217 Worksheet 1 February: x3.1 Professor Karen E Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. T Definitions: Given a linear transformation V ! W between vector spaces, we have 1. The source or domain of T is V ; 2. The target of T is W ; 3. The image of T is the subset of the target f~y 2 W j ~y = T (~x) for some x 2 Vg: 4. The kernel of T is the subset of the source f~v 2 V such that T (~v) = ~0g. Put differently, the kernel is the pre-image of ~0. Advice to the new mathematicians from an old one: In encountering new definitions and concepts, n m please keep in mind concrete examples you already know|in this case, think about V as R and W as R the first time through. How does the notion of a linear transformation become more concrete in this special case? Think about modeling your future understanding on this case, but be aware that there are other important examples and there are important differences (a linear map is not \a matrix" unless *source and target* are both \coordinate spaces" of column vectors). The goal is to become comfortable with the abstract idea of a vector space which embodies many n features of R but encompasses many other kinds of set-ups. A. For each linear transformation below, determine the source, target, image and kernel. 2 3 x1 3 (a) T : R ! R such that T (4x25) = x1 + x2 + x3.
    [Show full text]
  • Math 120 Homework 3 Solutions
    Math 120 Homework 3 Solutions Xiaoyu He, with edits by Prof. Church April 21, 2018 [Note from Prof. Church: solutions to starred problems may not include all details or all portions of the question.] 1.3.1* Let σ be the permutation 1 7! 3; 2 7! 4; 3 7! 5; 4 7! 2; 5 7! 1 and let τ be the permutation 1 7! 5; 2 7! 3; 3 7! 2; 4 7! 4; 5 7! 1. Find the cycle decompositions of each of the following permutations: σ; τ; σ2; στ; τσ; τ 2σ. The cycle decompositions are: σ = (135)(24) τ = (15)(23)(4) σ2 = (153)(2)(4) στ = (1)(2534) τσ = (1243)(5) τ 2σ = (135)(24): 1.3.7* Write out the cycle decomposition of each element of order 2 in S4. Elements of order 2 are also called involutions. There are six formed from a single transposition, (12); (13); (14); (23); (24); (34), and three from pairs of transpositions: (12)(34); (13)(24); (14)(23). 3.1.6* Define ' : R× ! {±1g by letting '(x) be x divided by the absolute value of x. Describe the fibers of ' and prove that ' is a homomorphism. The fibers of ' are '−1(1) = (0; 1) = fall positive realsg and '−1(−1) = (−∞; 0) = fall negative realsg. 3.1.7* Define π : R2 ! R by π((x; y)) = x + y. Prove that π is a surjective homomorphism and describe the kernel and fibers of π geometrically. The map π is surjective because e.g. π((x; 0)) = x. The kernel of π is the line y = −x through the origin.
    [Show full text]
  • Discrete Topological Transformations for Image Processing Michel Couprie, Gilles Bertrand
    Discrete Topological Transformations for Image Processing Michel Couprie, Gilles Bertrand To cite this version: Michel Couprie, Gilles Bertrand. Discrete Topological Transformations for Image Processing. Brimkov, Valentin E. and Barneva, Reneta P. Digital Geometry Algorithms, 2, Springer, pp.73-107, 2012, Lecture Notes in Computational Vision and Biomechanics, 978-94-007-4174-4. 10.1007/978-94- 007-4174-4_3. hal-00727377 HAL Id: hal-00727377 https://hal-upec-upem.archives-ouvertes.fr/hal-00727377 Submitted on 3 Sep 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Chapter 3 Discrete Topological Transformations for Image Processing Michel Couprie and Gilles Bertrand Abstract Topology-based image processing operators usually aim at trans- forming an image while preserving its topological characteristics. This chap- ter reviews some approaches which lead to efficient and exact algorithms for topological transformations in 2D, 3D and grayscale images. Some transfor- mations which modify topology in a controlled manner are also described. Finally, based on the framework of critical kernels, we show how to design a topologically sound parallel thinning algorithm guided by a priority function. 3.1 Introduction Topology-preserving operators, such as homotopic thinning and skeletoniza- tion, are used in many applications of image analysis to transform an object while leaving unchanged its topological characteristics.
    [Show full text]
  • Kernel Methodsmethods Simple Idea of Data Fitting
    KernelKernel MethodsMethods Simple Idea of Data Fitting Given ( xi,y i) i=1,…,n xi is of dimension d Find the best linear function w (hyperplane) that fits the data Two scenarios y: real, regression y: {-1,1}, classification Two cases n>d, regression, least square n<d, ridge regression New sample: x, < x,w> : best fit (regression), best decision (classification) 2 Primary and Dual There are two ways to formulate the problem: Primary Dual Both provide deep insight into the problem Primary is more traditional Dual leads to newer techniques in SVM and kernel methods 3 Regression 2 w = arg min ∑(yi − wo − ∑ xij w j ) W i j w = arg min (y − Xw )T (y − Xw ) W d(y − Xw )T (y − Xw ) = 0 dw ⇒ XT (y − Xw ) = 0 w = [w , w ,L, w ]T , ⇒ T T o 1 d X Xw = X y L T x = ,1[ x1, , xd ] , T −1 T ⇒ w = (X X) X y y = [y , y ,L, y ]T ) 1 2 n T −1 T xT y =< x (, X X) X y > 1 xT X = 2 M xT 4 n n×xd Graphical Interpretation ) y = Xw = Hy = X(XT X)−1 XT y = X(XT X)−1 XT y d X= n FICA Income X is a n (sample size) by d (dimension of data) matrix w combines the columns of X to best approximate y Combine features (FICA, income, etc.) to decisions (loan) H projects y onto the space spanned by columns of X Simplify the decisions to fit the features 5 Problem #1 n=d, exact solution n>d, least square, (most likely scenarios) When n < d, there are not enough constraints to determine coefficients w uniquely d X= n W 6 Problem #2 If different attributes are highly correlated (income and FICA) The columns become dependent Coefficients
    [Show full text]
  • Minimally Separating Sets, Mediatrices, and Brillouin Spaces
    MINIMALLY SEPARATING SETS, MEDIATRICES, AND BRILLOUIN SPACES J.J.P. VEERMAN AND JAMES BERNHARD Abstract. Brillouin zones and their boundaries were studied in [16] because they play an important role in focal decomposition as first defined by Peixoto in [9] and in physics ([1] and [3]). In so-called Brillouin spaces, the boundaries of the Brillouin zones have certain regularity properties which imply that they consist of pieces of mediatrices (or equidistant sets). The purpose of this note is two-fold. First, we give some simple conditions on a metric space which are sufficient for it to be a Brillouin space. These con- ditions show, for example, that all compact, connected Riemannian manifolds with their usual distance functions are Brillouin spaces. Second, we exhibit a restriction on the Z2-homology of mediatrices in such manifolds in terms of the Z2-homology of the manifolds themselves, based on the fact that they are Bril- louin spaces. (This will used to obtain a classification up to homeomorphim of surface mediatrices in [15]). This note begins with some preliminaries in Section 1, where we define the relevant concepts and provide some background and motivation for the questions being considered here. In Section 2, we list a simple set of conditions on a metric space and prove that these conditions suffice for it to be a Brillouin space. In Section 3, we give some examples and mention a result for use in a later paper. We then investigate in Section 4 the homological restrictions placed on a mediatrix by the topology of the surrounding Brillouin space.
    [Show full text]
  • Abelian Categories
    Abelian Categories Lemma. In an Ab-enriched category with zero object every finite product is coproduct and conversely. π1 Proof. Suppose A × B //A; B is a product. Define ι1 : A ! A × B and π2 ι2 : B ! A × B by π1ι1 = id; π2ι1 = 0; π1ι2 = 0; π2ι2 = id: It follows that ι1π1+ι2π2 = id (both sides are equal upon applying π1 and π2). To show that ι1; ι2 are a coproduct suppose given ' : A ! C; : B ! C. It φ : A × B ! C has the properties φι1 = ' and φι2 = then we must have φ = φid = φ(ι1π1 + ι2π2) = ϕπ1 + π2: Conversely, the formula ϕπ1 + π2 yields the desired map on A × B. An additive category is an Ab-enriched category with a zero object and finite products (or coproducts). In such a category, a kernel of a morphism f : A ! B is an equalizer k in the diagram k f ker(f) / A / B: 0 Dually, a cokernel of f is a coequalizer c in the diagram f c A / B / coker(f): 0 An Abelian category is an additive category such that 1. every map has a kernel and a cokernel, 2. every mono is a kernel, and every epi is a cokernel. In fact, it then follows immediatly that a mono is the kernel of its cokernel, while an epi is the cokernel of its kernel. 1 Proof of last statement. Suppose f : B ! C is epi and the cokernel of some g : A ! B. Write k : ker(f) ! B for the kernel of f. Since f ◦ g = 0 the map g¯ indicated in the diagram exists.
    [Show full text]
  • 23. Kernel, Rank, Range
    23. Kernel, Rank, Range We now study linear transformations in more detail. First, we establish some important vocabulary. The range of a linear transformation f : V ! W is the set of vectors the linear transformation maps to. This set is also often called the image of f, written ran(f) = Im(f) = L(V ) = fL(v)jv 2 V g ⊂ W: The domain of a linear transformation is often called the pre-image of f. We can also talk about the pre-image of any subset of vectors U 2 W : L−1(U) = fv 2 V jL(v) 2 Ug ⊂ V: A linear transformation f is one-to-one if for any x 6= y 2 V , f(x) 6= f(y). In other words, different vector in V always map to different vectors in W . One-to-one transformations are also known as injective transformations. Notice that injectivity is a condition on the pre-image of f. A linear transformation f is onto if for every w 2 W , there exists an x 2 V such that f(x) = w. In other words, every vector in W is the image of some vector in V . An onto transformation is also known as an surjective transformation. Notice that surjectivity is a condition on the image of f. 1 Suppose L : V ! W is not injective. Then we can find v1 6= v2 such that Lv1 = Lv2. Then v1 − v2 6= 0, but L(v1 − v2) = 0: Definition Let L : V ! W be a linear transformation. The set of all vectors v such that Lv = 0W is called the kernel of L: ker L = fv 2 V jLv = 0g: 1 The notions of one-to-one and onto can be generalized to arbitrary functions on sets.
    [Show full text]
  • Tauberian Theorems and Spectral Theory in Topological Vector Spaces
    Glasgow Math. J. 55 (2013) 511–532. C Glasgow Mathematical Journal Trust 2013. doi:10.1017/S0017089512000699. TAUBERIAN THEOREMS AND SPECTRAL THEORY IN TOPOLOGICAL VECTOR SPACES RICHARD J. DE BEER Internal Box 209, School of Computer, Statistics & Mathematical Sciences North-West University (Potchefstroom Campus) Pvt. Bag X6001, Potchefstroom 2520, South Africa e-mail: [email protected] (Received 1 February 2012; revised 9 August 2012; accepted 28 November 2012; first published online 25 February 2013) Abstract. We investigate the spectral theory of integrable actions of a locally compact abelian group on a locally convex vector space. We start with an analysis of various spectral subspaces induced by the action of the group. This is applied to analyse the spectral theory of operators on the space, generated by measures on the group. We apply these results to derive general Tauberian theorems that apply to arbitrary locally compact abelian groups acting on a large class of locally convex vector spaces, which includes Frechet´ spaces. We show how these theorems simplify the derivation of Mean Ergodic theorems. 2010 Mathematics Subject Classification. 37A30, 40E05, 43A45 1. Introduction. The aim of this paper is to develop enough spectral theory of integrable group actions on locally convex vector spaces to prove Tauberian theorems, which are applicable to ergodic theory. The Tauberian theorems proved in Section 5 apply to the situation where a general locally compact abelian group acts on certain types of barrelled spaces, and in particular all Frechet´ spaces. This generalises the Tauberian theorem shown in [4], which applies only to the action of the integers on a Banach space.
    [Show full text]
  • Positive Semigroups of Kernel Operators
    Positivity 12 (2008), 25–44 c 2007 Birkh¨auser Verlag Basel/Switzerland ! 1385-1292/010025-20, published online October 29, 2007 DOI 10.1007/s11117-007-2137-z Positivity Positive Semigroups of Kernel Operators Wolfgang Arendt Dedicated to the memory of H.H. Schaefer Abstract. Extending results of Davies and of Keicher on !p we show that the peripheral point spectrum of the generator of a positive bounded C0-semigroup of kernel operators on Lp is reduced to 0. It is shown that this implies con- vergence to an equilibrium if the semigroup is also irreducible and the fixed space non-trivial. The results are applied to elliptic operators. Mathematics Subject Classification (2000). 47D06, 47B33, 35K05. Keywords. Positive semigroups, Kernel operators, asymptotic behaviour, trivial peripheral spectrum. 0. Introduction Irreducibility is a fundamental notion in Perron-Frobenius Theory. It had been introduced in a direct way by Perron and Frobenius for matrices, but it was H. H. Schaefer who gave the definition via closed ideals. This turned out to be most fruit- ful and led to a wealth of deep and important results. For applications Ouhabaz’ very simple criterion for irreduciblity of semigroups defined by forms (see [Ouh05, Sec. 4.2] or [Are06]) is most useful. It shows that for practically all boundary con- ditions, a second order differential operator in divergence form generates a positive 2 N irreducible C0-semigroup on L (Ω) where Ωis an open, connected subset of R . The main question in Perron-Frobenius Theory, is to determine the asymp- totic behaviour of the semigroup. If the semigroup is bounded (in fact Abel bounded suffices), and if the fixed space is non-zero, then irreducibility is equiv- alent to convergence of the Ces`aro means to a strictly positive rank-one opera- tor, i.e.
    [Show full text]
  • The Kernel of a Linear Transformation Is a Vector Subspace
    The kernel of a linear transformation is a vector subspace. Given two vector spaces V and W and a linear transformation L : V ! W we define a set: Ker(L) = f~v 2 V j L(~v) = ~0g = L−1(f~0g) which we call the kernel of L. (some people call this the nullspace of L). Theorem As defined above, the set Ker(L) is a subspace of V , in particular it is a vector space. Proof Sketch We check the three conditions 1 Because we know L(~0) = ~0 we know ~0 2 Ker(L). 2 Let ~v1; ~v2 2 Ker(L) then we know L(~v1 + ~v2) = L(~v1) + L(~v2) = ~0 + ~0 = ~0 and so ~v1 + ~v2 2 Ker(L). 3 Let ~v 2 Ker(L) and a 2 R then L(a~v) = aL(~v) = a~0 = ~0 and so a~v 2 Ker(L). Math 3410 (University of Lethbridge) Spring 2018 1 / 7 Example - Kernels Matricies Describe and find a basis for the kernel, of the linear transformation, L, associated to 01 2 31 A = @3 2 1A 1 1 1 The kernel is precisely the set of vectors (x; y; z) such that L((x; y; z)) = (0; 0; 0), so 01 2 31 0x1 001 @3 2 1A @yA = @0A 1 1 1 z 0 but this is precisely the solutions to the system of equations given by A! So we find a basis by solving the system! Theorem If A is any matrix, then Ker(A), or equivalently Ker(L), where L is the associated linear transformation, is precisely the solutions ~x to the system A~x = ~0 This is immediate from the definition given our understanding of how to associate a system of equations to M~x = ~0: Math 3410 (University of Lethbridge) Spring 2018 2 / 7 The Kernel and Injectivity Recall that a function L : V ! W is injective if 8~v1; ~v2 2 V ; ((L(~v1) = L(~v2)) ) (~v1 = ~v2)) Theorem A linear transformation L : V ! W is injective if and only if Ker(L) = f~0g.
    [Show full text]
  • Quasi-Arithmetic Filters for Topology Optimization
    Quasi-Arithmetic Filters for Topology Optimization Linus Hägg Licentiate thesis, 2016 Department of Computing Science This work is protected by the Swedish Copyright Legislation (Act 1960:729) ISBN: 978-91-7601-409-7 ISSN: 0348-0542 UMINF 16.04 Electronic version available at http://umu.diva-portal.org Printed by: Print & Media, Umeå University, 2016 Umeå, Sweden 2016 Acknowledgments I am grateful to my scientific advisors Martin Berggren and Eddie Wadbro for introducing me to the fascinating subject of topology optimization, for sharing their knowledge in countless discussions, and for helping me improve my scientific skills. Their patience in reading and commenting on the drafts of this thesis is deeply appreciated. I look forward to continue with our work. Without the loving support of my family this thesis would never have been finished. Especially, I am thankful to my wife Lovisa for constantly encouraging me, and covering for me at home when needed. I would also like to thank my colleges at the Department of Computing Science, UMIT research lab, and at SP Technical Research Institute of Sweden for providing a most pleasant working environment. Finally, I acknowledge financial support from the Swedish Research Council (grant number 621-3706), and the Swedish strategic research programme eSSENCE. Linus Hägg Skellefteå 2016 iii Abstract Topology optimization is a framework for finding the optimal layout of material within a given region of space. In material distribution topology optimization, a material indicator function determines the material state at each point within the design domain. It is well known that naive formulations of continuous material distribution topology optimization problems often lack solutions.
    [Show full text]
  • How I Think About Math Part I: Linear Algebra
    Algebra davidad Relations Labels Composing Joining Inverting Commuting How I Think About Math Linearity Fields Part I: Linear Algebra “Linear” defined Vectors Matrices Tensors Subspaces David Dalrymple Image & Coimage [email protected] Kernel & Cokernel Decomposition Singular Value Decomposition Fundamental Theorem of Linear Algebra March 6, 2014 CP decomposition Algebra Chapter 1: Relations davidad 1 Relations Relations Labels Labels Composing Joining Composing Inverting Commuting Joining Linearity Inverting Fields Commuting “Linear” defined Vectors 2 Linearity Matrices Tensors Fields Subspaces “Linear” defined Image & Coimage Kernel & Cokernel Vectors Decomposition Matrices Singular Value Decomposition Tensors Fundamental Theorem of Linear Algebra 3 Subspaces CP decomposition Image & Coimage Kernel & Cokernel 4 Decomposition Singular Value Decomposition Fundamental Theorem of Linear Algebra CP decomposition Algebra A simple relation davidad Relations Labels Composing Relations are a generalization of functions; they’re actually more like constraints. Joining Inverting Here’s an example: Commuting Linearity Fields · “Linear” defined x 2 y Vectors Matrices Tensors Subspaces Image & Coimage Kernel & Cokernel Decomposition Singular Value Decomposition Fundamental Theorem of Linear Algebra CP decomposition Algebra A simple relation davidad Relations Labels Composing Relations are a generalization of functions; they’re actually more like constraints. Joining Inverting Here’s an example: Commuting Linearity Fields · “Linear” defined x 2 y Vectors
    [Show full text]