Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The fW-mean filter framework for topology optimization and analysis of Friedrichs systems
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2020 (English)Doctoral thesis, comprehensive summary (Other academic)Alternative title
Ett ramverk för medelvärdesfilter inom topologioptimering samt analys av Friedrichssystem (Swedish)
Abstract [en]

Part I. Topology optimization is the most general form of design optimization in which the optimal layout of material within a given region of space is to be determined. Filters are essential components of many successful density based topology optimization approaches. The generalized fW-mean filter framework developed in this thesis provides a unified platform for construction, analysis, and implementation of filters. Extending existing algorithms, we demonstrate that under special albeit relevant conditions, the computational complexity of evaluating generalized fW-mean filters and their derivatives is linear in the number of design degrees of freedom. We prove that generalized fW-mean filters guarantee existence of solutions to the penalized minimum compliance problem, the archetypical problem in density based topology optimization. In this problem, the layout of linearly elastic material that minimizes the compliance given static supports and loads is to be determined. We formalize the connection between mathematical morphology and the notion of minimum length scale of a layout of material and thereby provide a theoretical foundation for imposing and assessing minimum length scales in density based topology optimization. Elaborating on the fact that some sequences of generalized fW-mean filters provide differentiable approximations of morphological operators, we devise a method capable of imposing different minimum length scales on the two material phases in minimum compliance problems.

 

Part II. The notion of Friedrichs systems, also known as symmetric positive systems, encompasses many linear models of physical phenomena. The prototype model is Maxwell's equations, which describe the evolution of the electromagnetic field in the presence of electrical charges and currents. In this thesis, we develop well-posed variational formulations of boundary and initial–boundary value problems of Friedrichs systems on bounded domains. In particular, we consider an inhomogeneous initial–boundary value problem that models lossless propagation of acoustic disturbances in a stagnant fluid. Galbrun's equation is a linear second order vector differential equation in the so-called Lagrangian displacement, which was derived to model lossless propagation of acoustic disturbances in the presence of a background flow. Our analysis of Galbrun's equation is centered on the observation that solutions to Galbrun's equation may be formally constructed from solutions to linearized Euler's equations. More precisely, the Lagrangian displacement is constructed as the solution to a transport-type equation driven by the Eulerian velocity perturbation. We present partial results on the well-posedness of Galbrun's equation in the particular case that the background flow is everywhere tangential to the domain boundary by demonstrating mild well-posedness of an initial–boundary value problem for linearized Euler's equations and that our construction of the Lagrangian displacement is well-defined. Moreover, we demonstrate that sufficiently regular solutions to Galbrun's equation satisfy an energy estimate.

Place, publisher, year, edition, pages
Umeå: Umeå universitet, Institutionen för datavetenskap , 2020. , p. 49
Series
Report / UMINF, ISSN 0348-0542 ; 20.09
Keywords [en]
topology optimization, filters, mathematical morphology, size control, minimum compliance problem, Friedrichs systems, well-posedness, variational formulations, linearized Euler’s equations, Galbrun’s equation, acoustics
National Category
Computational Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-175319ISBN: 978-91-7855-368-6 (electronic)ISBN: 978-91-7855-367-9 (print)OAI: oai:DiVA.org:umu-175319DiVA, id: diva2:1470588
Public defence
2020-10-22, Ma121, MIT-huset, Umeå universitet, Umeå, 14:00 (English)
Opponent
Supervisors
Available from: 2020-10-01 Created: 2020-09-25 Last updated: 2020-09-29Bibliographically approved
List of papers
1. On quasi-arithmetic mean based filters and their fast evaluation for large-scale topology optimization
Open this publication in new window or tab >>On quasi-arithmetic mean based filters and their fast evaluation for large-scale topology optimization
2015 (English)In: Structural and multidisciplinary optimization (Print), ISSN 1615-147X, E-ISSN 1615-1488, Vol. 52, no 5, p. 879-888Article in journal (Refereed) Published
Abstract [en]

In material distribution topology optimization, restriction methods are routinely applied to obtain well-posed optimization problems and to achieve mesh-independence of the resulting designs. One of the most popular restriction methods is to use a filtering procedure. In this paper, we present a framework where the filtering process is viewed as a quasi-arithmetic mean (or generalized f-mean) over a neighborhood with the possible addition of an extra "projection step". This framework includes the vast majority of available filters for topology optimization. The covered filtering procedures comprise three steps: (i) element-wise application of a function, (ii) computation of local averages, and (iii) element-wise application of another function. We present fast algorithms that apply this type of filters over polytope-shaped neighborhoods on regular meshes in two and three spatial dimensions. These algorithms have a computational cost that grows linearly with the number of elements and can be bounded irrespective of the filter radius.

Place, publisher, year, edition, pages
Springer, 2015
Keywords
Topology optimization, Regularization, Filters, Fast algorithm, Large-scale problems
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-114034 (URN)10.1007/s00158-015-1273-5 (DOI)000366590800003 ()2-s2.0-84949623277 (Scopus ID)
Available from: 2016-01-11 Created: 2016-01-11 Last updated: 2023-03-24Bibliographically approved
2. Nonlinear filters in topology optimization: existence of solutions and efficient implementation for minimum compliance problems
Open this publication in new window or tab >>Nonlinear filters in topology optimization: existence of solutions and efficient implementation for minimum compliance problems
2017 (English)In: Structural and multidisciplinary optimization (Print), ISSN 1615-147X, E-ISSN 1615-1488, Vol. 55, no 3, p. 1017-1028Article in journal (Refereed) Published
Abstract [en]

Material distribution topology optimization problems are generally ill-posed if no restriction or regularization method is used. To deal with these issues, filtering procedures are routinely applied. In a recent paper, we presented a framework that encompasses the vast majority of currently available density filters. In this paper, we show that these nonlinear filters ensure existence of solutions to a continuous version of the minimum compliance problem. In addition, we provide a detailed description on how to efficiently compute sensitivities for the case when multiple of these nonlinear filters are applied in sequence. Finally, we present large-scale numerical experiments illustrating some characteristics of these cascaded nonlinear filters.

Keywords
Topology optimization, Regularization, Nonlinear filters, Existence of solutions, Large-scale problems
National Category
Computational Mathematics
Identifiers
urn:nbn:se:umu:diva-133354 (URN)10.1007/s00158-016-1553-8 (DOI)000398114200019 ()2-s2.0-84982099481 (Scopus ID)
Funder
Swedish Foundation for Strategic Research , AM13-0029Swedish Research Council, 621-3706
Available from: 2017-04-06 Created: 2017-04-06 Last updated: 2023-03-23Bibliographically approved
3. On minimum length scale control in density based topology optimization
Open this publication in new window or tab >>On minimum length scale control in density based topology optimization
2018 (English)In: Structural and multidisciplinary optimization (Print), ISSN 1615-147X, E-ISSN 1615-1488, Vol. 58, no 3, p. 1015-1032Article in journal (Refereed) Published
Abstract [en]

The archetypical topology optimization problem concerns designing the layout of material within a given region of space so that some performance measure is extremized. To improve manufacturability and reduce manufacturing costs, restrictions on the possible layouts may be imposed. Among such restrictions, constraining the minimum length scales of different regions of the design has a significant place. Within the density filter based topology optimization framework the most commonly used definition is that a region has a minimum length scale not less than D if any point within that region lies within a sphere with diameter D > 0 that is completely contained in the region. In this paper, we propose a variant of this minimum length scale definition for subsets of a convex (possibly bounded) domain We show that sets with positive minimum length scale are characterized as being morphologically open. As a corollary, we find that sets where both the interior and the exterior have positive minimum length scales are characterized as being simultaneously morphologically open and (essentially) morphologically closed. For binary designs in the discretized setting, the latter translates to that the opening of the design should equal the closing of the design. To demonstrate the capability of the developed theory, we devise a method that heuristically promotes designs that are binary and have positive minimum length scales (possibly measured in different norms) on both phases for minimum compliance problems. The obtained designs are almost binary and possess minimum length scales on both phases.

Place, publisher, year, edition, pages
Springer, 2018
Keywords
topology optimization, nonlinear filters, size control, mathematical morphology
National Category
Computer Sciences Computational Mathematics
Identifiers
urn:nbn:se:umu:diva-151378 (URN)10.1007/s00158-018-1944-0 (DOI)000441847800010 ()2-s2.0-85044351004 (Scopus ID)
Funder
Swedish Foundation for Strategic Research , AM13-0029Swedish Research Council, 621-3706
Available from: 2018-09-06 Created: 2018-09-06 Last updated: 2023-03-24Bibliographically approved
4. Topology optimization of compact wideband coaxial-to-waveguide transitions with minimum-size control
Open this publication in new window or tab >>Topology optimization of compact wideband coaxial-to-waveguide transitions with minimum-size control
2018 (English)In: Structural and multidisciplinary optimization (Print), ISSN 1615-147X, E-ISSN 1615-1488, Vol. 57, no 4, p. 1765-1777Article in journal (Refereed) Published
Abstract [en]

This paper presents a density-based topology optimization approach to design compact wideband coaxial-to-waveguide transitions. The underlying optimization problem shows a strong self penalization towards binary solutions, which entails mesh-dependent designs that generally exhibit poor performance. To address the self penalization issue, we develop a filtering approach that consists of two phases. The first phase aims to relax the self penalization by using a sequence of linear filters. The second phase relies on nonlinear filters and aims to obtain binary solutions and to impose minimum-size control on the final design. We present results for optimizing compact transitions between a 50-Ohm coaxial cable and a standard WR90 waveguide operating in the X-band (8-12 GHz).

Place, publisher, year, edition, pages
New York: Springer, 2018
Keywords
Maxwell's equations, sensitivity analysis, optimization, waveguide
National Category
Communication Systems Computer Sciences
Identifiers
urn:nbn:se:umu:diva-146663 (URN)10.1007/s00158-017-1844-8 (DOI)000430101600022 ()2-s2.0-85033708474 (Scopus ID)
Available from: 2018-04-16 Created: 2018-04-16 Last updated: 2023-03-24Bibliographically approved
5. Well-posed variational formulations of Friedrichs-type systems
Open this publication in new window or tab >>Well-posed variational formulations of Friedrichs-type systems
2021 (English)In: Journal of Differential Equations, ISSN 0022-0396, E-ISSN 1090-2732, Vol. 292, p. 90-131Article in journal (Refereed) Published
Abstract [en]

All finite element methods, as well as much of the Hilbert-space theory for partial differential equations, rely on variational formulations, that is, problems of the type: find u∈V such that a(v,u)=l(v) for each v∈L, where V,L are Sobolev spaces. However, for systems of Friedrichs type, there is a sharp disparity between established well-posedness theories, which are not variational, and the very successful discontinuous Galerkin methods that have been developed for such systems, which are variational. In an attempt to override this dichotomy, we present, through three specific examples of increasing complexity, well-posed variational formulations of boundary and initial–boundary-value problems of Friedrichs type. The variational forms we introduce are generalizations of those used for discontinuous Galerkin methods, in the sense that inhomogeneous boundary and initial conditions are enforced weakly through integrals in the variational forms. In the variational forms we introduce, the solution space is defined as a subspace V of the graph space associated with the differential operator in question, whereas the test function space L is a tuple of L2 spaces that separately enforce the equation, boundary conditions of characteristic type, and initial conditions.

Place, publisher, year, edition, pages
Elsevier, 2021
National Category
Mathematics
Identifiers
urn:nbn:se:umu:diva-175317 (URN)10.1016/j.jde.2021.05.002 (DOI)000656995900003 ()2-s2.0-85105569339 (Scopus ID)
Funder
Swedish Research Council, 2018-03546
Note

Previously included in thesis in manuscript form.

Available from: 2020-09-25 Created: 2020-09-25 Last updated: 2023-09-05Bibliographically approved
6. On the well-posedness of Galbrun's equation
Open this publication in new window or tab >>On the well-posedness of Galbrun's equation
2021 (English)In: Journal des Mathématiques Pures et Appliquées, ISSN 0021-7824, E-ISSN 1776-3371, Vol. 150, p. 112-133Article in journal (Refereed) Published
Abstract [en]

Galbrun's equation, which is a second order partial differential equation describing the evolution of a so-called Lagrangian displacement vector field, can be used to study acoustics in background flows as well as perturbations of astrophysical flows. Our starting point for deriving Galbrun's equation is linearized Euler's equations, which is a first order system of partial differential equations that describe the evolution of the so-called Eulerian flow perturbations. Given a solution to linearized Euler's equations, we introduce the Lagrangian displacement as the solution to a linear first order partial differential equation, where the Eulerian perturbation of the fluid velocity acts as a source term. Our Lagrangian displacement solves Galbrun's equation, provided it is regular enough and that the so-called no-resonance assumption holds. In the case that the background flow is steady and tangential to the domain boundary, we prove existence, uniqueness, and continuous dependence on data of solutions to an initial–boundary-value problem for linearized Euler's equations. For such background flows, we demonstrate that the Lagrangian displacement is well-defined, that the initial datum of the Lagrangian displacement can be chosen in order to fulfill the no-resonance assumption, and derive a classical energy estimate for (sufficiently regular solutions to) Galbrun's equation. Due to the presence of zeroth order terms of indefinite signs in the equations, the energy estimate allows solutions that grow exponentially with time.

Abstract [fr]

L'équation de Galbrun, est une équation aux dérivées partielles du second ordre qui décrit l'évolution d'un champ de vecteurs déplacements, dit Lagrangien. Elle peut être utilisée pour étudier l'acoustique des écoulements à grande échelle, ainsi que les perturbations des écoulements astrophysiques. Notre point de départ, pour dériver l'équation de Galbrun, est l'équation d'Euler linéarisée, qui est un système d'équations aux dérivées partielles du premier ordre décrivant l'évolution des perturbations de l'écoulement. Une solution des équations d'Euler linéarisées étant donnée, nous introduisons le déplacement Lagrangien comme étant la solution d'une équation aux dérivées partielles linéaire du premier ordre, dont le second membre est la perturbation Eulérienne de la vitesse du fluide. Ce déplacement Lagrangien est solution de l'équation de Galbrun, à condition qu'il soit suffisamment régulier et que l'hypothèse dite de non-résonance soit satisfaite. Dans le cas où l'écoulement à grande échelle est stationnaire et tangent à la frontière du domaine, nous démontrons des résultats d'existence, d'unicité et de dépendance continue par rapport aux données, pour les solutions d'un problème aux limites avec condition initiale, pour les équations d'Euler linéarisées. Pour de tels écoulements, nous démontrons que le déplacement Lagrangien est bien défini, que la donnée initiale du déplacement Lagrangien peut être choisie afin de satisfaire à l'hypothèse de non-résonance et nous dérivons une estimation classique de l'énergie pour les solutions suffisamment régulières de l'équation de Galbrun. En raison de la présence de termes d'ordre zéro de signes indéfinis dans les équations, l'estimation de l'énergie autorise des solutions qui croissent exponentiellement avec le temps.

Place, publisher, year, edition, pages
Elsevier, 2021
Keywords
Galbrun's equation, Linearized Euler's equations, Friedrichs' systems, Acoustics
National Category
Computational Mathematics
Identifiers
urn:nbn:se:umu:diva-175316 (URN)10.1016/j.matpur.2021.04.004 (DOI)000656907800004 ()2-s2.0-85103947321 (Scopus ID)
Note

Originally included in thesis in manuscript form.

Available from: 2020-09-25 Created: 2020-09-25 Last updated: 2023-09-05Bibliographically approved

Open Access in DiVA

fulltext(574 kB)420 downloads
File information
File name FULLTEXT01.pdfFile size 574 kBChecksum SHA-512
320a1936ea1f30c00050d6bef08db96ddec5a0c2aaa1d6f771a13a588beaa3df1a3778ac5508a703ca733fefb8ae531869862220b5488d9e1638ac4afe0c9e4b
Type fulltextMimetype application/pdf
spikblad(367 kB)93 downloads
File information
File name SPIKBLAD01.pdfFile size 367 kBChecksum SHA-512
6bb3afd66304b8de6ff55d5d1c57d1502206761ac6f33855fed16704790bf1b58ffd9220ce5a15e8baace52024cd0422b13d8f01a074d09cbbc8d47b86df5484
Type spikbladMimetype application/pdf

Authority records

Hägg, Linus

Search in DiVA

By author/editor
Hägg, Linus
By organisation
Department of Computing Science
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 423 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 1259 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf