CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt157",{id:"formSmash:upper:j_idt157",widgetVar:"widget_formSmash_upper_j_idt157",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt161_j_idt169",{id:"formSmash:upper:j_idt161:j_idt169",widgetVar:"widget_formSmash_upper_j_idt161_j_idt169",target:"formSmash:upper:j_idt161:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Quasi-Arithmetic Filters for Topology OptimizationPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2016 (English)Licentiate thesis, comprehensive summary (Other academic)Alternative title
##### Abstract [en]

##### Place, publisher, year, edition, pages

Umeå: Umeå Universitet , 2016. , 23 p.
##### Series

Report / UMINF, ISSN 0348-0542 ; 16.04
##### National Category

Computational Mathematics Computer Science
##### Identifiers

URN: urn:nbn:se:umu:diva-116983ISBN: 978-91-7601-409-7 (print)OAI: oai:DiVA.org:umu-116983DiVA: diva2:903713
##### Presentation

2016-02-19, Umeå universitet, Umeå, 09:00
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt737",{id:"formSmash:j_idt737",widgetVar:"widget_formSmash_j_idt737",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt754",{id:"formSmash:j_idt754",widgetVar:"widget_formSmash_j_idt754",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt774",{id:"formSmash:j_idt774",widgetVar:"widget_formSmash_j_idt774",multiple:true});
##### Funder

eSSENCE - An eScience CollaborationSwedish Research Council, 621-3706
Available from: 2016-02-25 Created: 2016-02-16 Last updated: 2017-04-11Bibliographically approved
##### List of papers

Kvasiaritmetiska filter för topologioptimering (Swedish)

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. To obtain numerical solutions, the continuous problem is approximated by a finite-dimensional problem. The finite-dimensional approximation is typically obtained by partitioning the design domain into a finite number of elements and assigning to each element a design variable that determines the material state of that element. Although the finite-dimensional problem generally is solvable, a sequence of solutions corresponding to ever finer partitions of the design domain may not converge; that is, the optimized designs may exhibit mesh-dependence. Filtering procedures are amongst the most popular methods used to handle the existence issue related to the continuous problem as well as the mesh-dependence related to the finite-dimensional approximation. Over the years, a variety of filters for topology optimization have been presented.

To harmonize the use and analysis of filters within the field of topology optimization, we introduce the class of fW-mean filters that is based on the weighted quasi-arithmetic mean, also known as the weighted generalized f-mean, over some neighborhoods. We also define the class of generalized fW-mean filters that contains the vast majority of filters for topology optimization. In particular, the class of generalized fW-mean filters includes the fW-mean filters, as well as the projected fW-mean filters that are formed by adding a projection step to the fW-mean filters.

If the design variables are located in a regular grid, uniform weights are used within each neighborhood, and equal sized polytope shaped neighborhoods are used, then a cascade of generalized fW-mean filters can be applied with a computational complexity that is linear in the number of design variables. Detailed algorithms for octagonal shaped neighborhoods in 2D and rhombicuboctahedron shaped neighborhoods in 3D are provided. The theoretically obtained computational complexity of the algorithm for octagonal shaped neighborhoods in 2D has been numerically verified. By using the same type of algorithm as for filtering, the additional computational complexity for computing derivatives needed in gradient based optimization is also linear in the number of design variables.

To exemplify the use of generalized fW-mean filters in topology optimization, we consider minimization of compliance (maximization of global stiffness) of linearly elastic continuum bodies. We establish the existence of solutions to a version of the continuous minimal compliance problem when a cascade of projected continuous fW-mean filters is included in the formulation. Bourdin's classical existence result for the linear density filter is a partial case of this general theorem for projected continuous fW-mean filters. Inspired by the works of Svanberg & Svärd and Sigmund, we introduce the harmonic open-close filter, which is a cascade of four fW-mean filters. We present large-scale numerical experiments indicating that, for minimal compliance problems, the harmonic open-close filter produces almost binary designs, provides independent size control on both material and void regions, and yields mesh-independent designs.

1. On quasi-arithmetic mean based filters and their fast evaluation for large-scale topology optimization$(function(){PrimeFaces.cw("OverlayPanel","overlay892676",{id:"formSmash:j_idt823:0:j_idt833",widgetVar:"overlay892676",target:"formSmash:j_idt823:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Nonlinear filters in topology optimization: existence of solutions and efficient implementation for minimal compliance problems$(function(){PrimeFaces.cw("OverlayPanel","overlay901363",{id:"formSmash:j_idt823:1:j_idt833",widgetVar:"overlay901363",target:"formSmash:j_idt823:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1850",{id:"formSmash:j_idt1850",widgetVar:"widget_formSmash_j_idt1850",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1905",{id:"formSmash:lower:j_idt1905",widgetVar:"widget_formSmash_lower_j_idt1905",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1906_j_idt1908",{id:"formSmash:lower:j_idt1906:j_idt1908",widgetVar:"widget_formSmash_lower_j_idt1906_j_idt1908",target:"formSmash:lower:j_idt1906:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});